./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9918b49e0d76e4ce36b6a6760021b33460a8ae9b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:06:32,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:06:32,036 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:06:32,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:06:32,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:06:32,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:06:32,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:06:32,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:06:32,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:06:32,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:06:32,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:06:32,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:06:32,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:06:32,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:06:32,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:06:32,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:06:32,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:06:32,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:06:32,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:06:32,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:06:32,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:06:32,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:06:32,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:06:32,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:06:32,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:06:32,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:06:32,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:06:32,078 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:06:32,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:06:32,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:06:32,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:06:32,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:06:32,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:06:32,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:06:32,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:06:32,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:06:32,085 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:06:32,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:06:32,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:06:32,114 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:06:32,114 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:06:32,116 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:06:32,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:06:32,117 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:06:32,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:06:32,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:06:32,117 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:06:32,118 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:06:32,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:06:32,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:06:32,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:06:32,118 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:06:32,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:06:32,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:06:32,121 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:06:32,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:06:32,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:06:32,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:06:32,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:06:32,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:06:32,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:06:32,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:06:32,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:06:32,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:06:32,123 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:06:32,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:06:32,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:06:32,123 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2018-11-28 16:06:32,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:06:32,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:06:32,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:06:32,188 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:06:32,188 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:06:32,189 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 16:06:32,243 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38ee3575/bb28683ec6ec44be91cef01bc63218e0/FLAG3d152df28 [2018-11-28 16:06:32,663 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:06:32,664 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 16:06:32,671 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38ee3575/bb28683ec6ec44be91cef01bc63218e0/FLAG3d152df28 [2018-11-28 16:06:33,083 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38ee3575/bb28683ec6ec44be91cef01bc63218e0 [2018-11-28 16:06:33,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:06:33,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:06:33,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:06:33,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:06:33,093 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:06:33,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b04ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33, skipping insertion in model container [2018-11-28 16:06:33,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:06:33,131 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:06:33,359 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:06:33,365 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:06:33,390 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:06:33,406 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:06:33,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33 WrapperNode [2018-11-28 16:06:33,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:06:33,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:06:33,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:06:33,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:06:33,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:06:33,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:06:33,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:06:33,435 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:06:33,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... [2018-11-28 16:06:33,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:06:33,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:06:33,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:06:33,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:06:33,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:06:33,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:06:33,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:06:33,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:06:33,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:06:33,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:06:33,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:06:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 16:06:33,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 16:06:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2018-11-28 16:06:33,606 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2018-11-28 16:06:33,952 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:06:33,952 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:06:33,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:06:33 BoogieIcfgContainer [2018-11-28 16:06:33,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:06:33,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:06:33,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:06:33,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:06:33,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:06:33" (1/3) ... [2018-11-28 16:06:33,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64902886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:06:33, skipping insertion in model container [2018-11-28 16:06:33,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:06:33" (2/3) ... [2018-11-28 16:06:33,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64902886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:06:33, skipping insertion in model container [2018-11-28 16:06:33,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:06:33" (3/3) ... [2018-11-28 16:06:33,963 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 16:06:33,971 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:06:33,978 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:06:33,992 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:06:34,025 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:06:34,025 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:06:34,026 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:06:34,026 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:06:34,026 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:06:34,026 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:06:34,026 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:06:34,026 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:06:34,026 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:06:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-28 16:06:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:06:34,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:34,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:34,054 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:34,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 876608673, now seen corresponding path program 1 times [2018-11-28 16:06:34,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:34,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:34,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:34,150 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:34,150 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:34,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:34,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:34,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:06:34,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 16:06:34,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:06:34,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:06:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:06:34,388 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-11-28 16:06:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:34,574 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2018-11-28 16:06:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 16:06:34,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 16:06:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:34,588 INFO L225 Difference]: With dead ends: 60 [2018-11-28 16:06:34,588 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 16:06:34,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:06:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 16:06:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-11-28 16:06:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 16:06:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-28 16:06:34,630 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2018-11-28 16:06:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:34,631 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 16:06:34,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:06:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-28 16:06:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 16:06:34,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:34,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:34,634 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:34,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash 483581663, now seen corresponding path program 1 times [2018-11-28 16:06:34,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:34,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:34,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:34,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:34,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:34,644 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:34,645 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:34,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:34,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:34,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:34,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:06:34,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 16:06:34,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:06:34,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:06:34,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:06:34,815 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2018-11-28 16:06:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:35,108 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-28 16:06:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 16:06:35,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 16:06:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:35,110 INFO L225 Difference]: With dead ends: 42 [2018-11-28 16:06:35,111 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 16:06:35,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:06:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 16:06:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-11-28 16:06:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 16:06:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-28 16:06:35,118 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2018-11-28 16:06:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:35,119 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-28 16:06:35,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:06:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-28 16:06:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:06:35,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:35,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:35,121 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:35,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1158269966, now seen corresponding path program 1 times [2018-11-28 16:06:35,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:35,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:35,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:35,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:35,130 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:35,130 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:35,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:35,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:35,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:35,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:06:35,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 16:06:35,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:06:35,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:06:35,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:06:35,242 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2018-11-28 16:06:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:35,370 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-28 16:06:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 16:06:35,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-28 16:06:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:35,372 INFO L225 Difference]: With dead ends: 46 [2018-11-28 16:06:35,372 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 16:06:35,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:06:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 16:06:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-11-28 16:06:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 16:06:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-28 16:06:35,380 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2018-11-28 16:06:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:35,381 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-28 16:06:35,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:06:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-28 16:06:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 16:06:35,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:35,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:35,382 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:35,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash -457205388, now seen corresponding path program 1 times [2018-11-28 16:06:35,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:35,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:35,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:35,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:35,395 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:35,395 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:35,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:35,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:35,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:35,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:06:35,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 16:06:35,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 16:06:35,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 16:06:35,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 16:06:35,564 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-28 16:06:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:35,619 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-28 16:06:35,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 16:06:35,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-28 16:06:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:35,620 INFO L225 Difference]: With dead ends: 40 [2018-11-28 16:06:35,620 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 16:06:35,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:06:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 16:06:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 16:06:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 16:06:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-28 16:06:35,627 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2018-11-28 16:06:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:35,628 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 16:06:35,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 16:06:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-28 16:06:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:06:35,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:35,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:35,629 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:35,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1431348209, now seen corresponding path program 1 times [2018-11-28 16:06:35,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:35,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:35,639 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:35,639 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:35,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:35,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:35,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:35,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:35,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-28 16:06:35,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 16:06:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 16:06:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:06:35,912 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-28 16:06:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:36,149 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-28 16:06:36,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 16:06:36,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 16:06:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:36,151 INFO L225 Difference]: With dead ends: 46 [2018-11-28 16:06:36,152 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 16:06:36,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:06:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 16:06:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 16:06:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 16:06:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-28 16:06:36,167 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2018-11-28 16:06:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:36,168 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-28 16:06:36,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 16:06:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-28 16:06:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:06:36,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:36,170 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:36,174 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:36,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:36,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1537894100, now seen corresponding path program 1 times [2018-11-28 16:06:36,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:36,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:36,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:36,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:36,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:36,194 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:36,199 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:36,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:36,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:36,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:36,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:36,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-28 16:06:36,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:06:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:06:36,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:06:36,525 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2018-11-28 16:06:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:36,725 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-28 16:06:36,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 16:06:36,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-28 16:06:36,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:36,728 INFO L225 Difference]: With dead ends: 48 [2018-11-28 16:06:36,728 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 16:06:36,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:06:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 16:06:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-28 16:06:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 16:06:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-28 16:06:36,743 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2018-11-28 16:06:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:36,744 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 16:06:36,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:06:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-28 16:06:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:06:36,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:36,747 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:36,747 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:36,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash -849280247, now seen corresponding path program 2 times [2018-11-28 16:06:36,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:36,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:36,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:36,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:36,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:36,766 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:36,768 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:36,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:36,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 16:06:36,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 16:06:36,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:06:36,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:36,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:36,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-28 16:06:36,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 16:06:36,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 16:06:36,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 16:06:36,973 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2018-11-28 16:06:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:37,197 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-28 16:06:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:06:37,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-28 16:06:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:37,199 INFO L225 Difference]: With dead ends: 50 [2018-11-28 16:06:37,200 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 16:06:37,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:06:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 16:06:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 16:06:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 16:06:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-28 16:06:37,208 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2018-11-28 16:06:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:37,209 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-28 16:06:37,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 16:06:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-28 16:06:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:06:37,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:37,210 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:37,210 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:37,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:37,211 INFO L82 PathProgramCache]: Analyzing trace with hash -516331098, now seen corresponding path program 3 times [2018-11-28 16:06:37,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:37,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:37,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:06:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:37,220 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:37,221 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:37,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:37,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 16:06:37,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-28 16:06:37,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:06:37,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:37,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:37,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-28 16:06:37,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 16:06:37,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 16:06:37,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:06:37,451 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 9 states. [2018-11-28 16:06:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:37,694 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-28 16:06:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:06:37,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-28 16:06:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:37,698 INFO L225 Difference]: With dead ends: 52 [2018-11-28 16:06:37,698 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 16:06:37,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:06:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 16:06:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-28 16:06:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 16:06:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-28 16:06:37,714 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2018-11-28 16:06:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:37,715 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-28 16:06:37,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 16:06:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-28 16:06:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:06:37,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:37,719 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:37,719 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:37,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1878386625, now seen corresponding path program 4 times [2018-11-28 16:06:37,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:37,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:37,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:06:37,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:37,734 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:37,734 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:37,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:37,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 16:06:37,762 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 16:06:37,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:06:37,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:37,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:37,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-28 16:06:38,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 16:06:38,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 16:06:38,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-28 16:06:38,001 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 15 states. [2018-11-28 16:06:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:38,578 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-28 16:06:38,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 16:06:38,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-28 16:06:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:38,581 INFO L225 Difference]: With dead ends: 52 [2018-11-28 16:06:38,582 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 16:06:38,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 16:06:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 16:06:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-28 16:06:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 16:06:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-28 16:06:38,594 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 29 [2018-11-28 16:06:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:38,594 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-28 16:06:38,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 16:06:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-28 16:06:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:06:38,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:38,596 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:38,596 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:38,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash 841482334, now seen corresponding path program 5 times [2018-11-28 16:06:38,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:38,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:06:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:38,609 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:38,609 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:38,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:38,625 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 16:06:38,641 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-28 16:06:38,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:06:38,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:38,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:38,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-28 16:06:38,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 16:06:38,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 16:06:38,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:06:38,982 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 11 states. [2018-11-28 16:06:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:39,306 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-28 16:06:39,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 16:06:39,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-28 16:06:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:39,310 INFO L225 Difference]: With dead ends: 67 [2018-11-28 16:06:39,310 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 16:06:39,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-28 16:06:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 16:06:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-28 16:06:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 16:06:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-28 16:06:39,320 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 31 [2018-11-28 16:06:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:39,320 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-28 16:06:39,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 16:06:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-28 16:06:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:06:39,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:39,321 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:39,322 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:39,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1492674782, now seen corresponding path program 6 times [2018-11-28 16:06:39,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:39,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:39,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:39,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:06:39,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 16:06:39,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:06:39,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:06:39,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:06:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:06:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:06:39,419 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 3 states. [2018-11-28 16:06:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:39,525 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-28 16:06:39,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:06:39,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 16:06:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:39,530 INFO L225 Difference]: With dead ends: 65 [2018-11-28 16:06:39,530 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 16:06:39,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:06:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 16:06:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-28 16:06:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 16:06:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-28 16:06:39,548 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 31 [2018-11-28 16:06:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:39,548 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-28 16:06:39,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:06:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-28 16:06:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:06:39,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:39,553 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:39,554 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:39,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1099647772, now seen corresponding path program 7 times [2018-11-28 16:06:39,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:39,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:39,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:39,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:06:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:39,567 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:39,568 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:39,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:39,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:39,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:40,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:40,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-28 16:06:40,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 16:06:40,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 16:06:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:06:40,390 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 11 states. [2018-11-28 16:06:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:41,502 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-28 16:06:41,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 16:06:41,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-28 16:06:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:41,505 INFO L225 Difference]: With dead ends: 69 [2018-11-28 16:06:41,505 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 16:06:41,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-28 16:06:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 16:06:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-28 16:06:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 16:06:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-28 16:06:41,513 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 31 [2018-11-28 16:06:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:41,513 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-28 16:06:41,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 16:06:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-28 16:06:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 16:06:41,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:41,514 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:41,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:41,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:41,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1067036793, now seen corresponding path program 8 times [2018-11-28 16:06:41,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:41,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:41,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:41,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:41,523 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:41,524 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:41,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 16:06:41,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 16:06:41,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:06:41,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 16:06:41,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:41,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-28 16:06:41,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 16:06:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 16:06:41,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:06:41,757 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 9 states. [2018-11-28 16:06:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:41,989 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-28 16:06:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 16:06:41,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-28 16:06:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:41,991 INFO L225 Difference]: With dead ends: 66 [2018-11-28 16:06:41,991 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 16:06:41,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 16:06:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 16:06:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 16:06:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 16:06:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-28 16:06:42,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 33 [2018-11-28 16:06:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:42,002 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-28 16:06:42,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 16:06:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-28 16:06:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 16:06:42,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:42,004 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:42,004 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:42,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash -202245895, now seen corresponding path program 9 times [2018-11-28 16:06:42,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:42,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:42,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:42,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:06:42,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:42,013 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:42,013 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:42,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:42,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 16:06:42,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 16:06:42,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:06:42,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:06:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:42,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-28 16:06:42,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 16:06:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 16:06:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 16:06:42,312 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2018-11-28 16:06:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:42,558 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-28 16:06:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 16:06:42,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-28 16:06:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:42,560 INFO L225 Difference]: With dead ends: 66 [2018-11-28 16:06:42,560 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 16:06:42,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:06:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 16:06:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-11-28 16:06:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 16:06:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-28 16:06:42,568 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 33 [2018-11-28 16:06:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:42,569 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-28 16:06:42,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 16:06:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-28 16:06:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 16:06:42,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:42,576 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:42,576 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:42,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash -825201876, now seen corresponding path program 1 times [2018-11-28 16:06:42,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:42,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:42,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:06:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:42,584 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:42,584 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:42,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:06:42,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 16:06:43,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:43,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-28 16:06:43,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 16:06:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 16:06:43,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 16:06:43,481 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 15 states. [2018-11-28 16:06:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:06:44,143 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-28 16:06:44,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 16:06:44,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-28 16:06:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:06:44,145 INFO L225 Difference]: With dead ends: 56 [2018-11-28 16:06:44,145 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 16:06:44,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-28 16:06:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 16:06:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 16:06:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 16:06:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 16:06:44,153 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 34 [2018-11-28 16:06:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:06:44,153 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 16:06:44,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 16:06:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-28 16:06:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 16:06:44,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:06:44,154 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:06:44,154 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:06:44,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:06:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1486576746, now seen corresponding path program 10 times [2018-11-28 16:06:44,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:06:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:06:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:44,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:06:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:06:44,175 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:06:44,175 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:06:44,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:06:44,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 16:06:44,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 16:06:44,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:06:44,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:06:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:06:46,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:06:46,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-28 16:06:46,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 16:06:46,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 16:06:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=132, Unknown=1, NotChecked=0, Total=156 [2018-11-28 16:06:46,293 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 13 states. [2018-11-28 16:07:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:06,962 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-28 16:07:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 16:07:06,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-28 16:07:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:06,965 INFO L225 Difference]: With dead ends: 58 [2018-11-28 16:07:06,965 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 16:07:06,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=54, Invalid=282, Unknown=6, NotChecked=0, Total=342 [2018-11-28 16:07:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 16:07:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-28 16:07:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 16:07:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-28 16:07:06,977 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 35 [2018-11-28 16:07:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:06,977 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-28 16:07:06,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 16:07:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-28 16:07:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 16:07:06,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:06,980 INFO L402 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:06,981 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:06,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1228411308, now seen corresponding path program 11 times [2018-11-28 16:07:06,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:06,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:06,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:07:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:06,992 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:07:06,992 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:07:06,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:07:07,020 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 16:07:07,037 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-28 16:07:07,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:07,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:07:08,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:07:08,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-28 16:07:08,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 16:07:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 16:07:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 16:07:08,459 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 13 states. [2018-11-28 16:07:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:11,158 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-28 16:07:11,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 16:07:11,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-28 16:07:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:11,161 INFO L225 Difference]: With dead ends: 63 [2018-11-28 16:07:11,161 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 16:07:11,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-11-28 16:07:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 16:07:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 16:07:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 16:07:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-28 16:07:11,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 35 [2018-11-28 16:07:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:11,170 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-28 16:07:11,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 16:07:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-28 16:07:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 16:07:11,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:07:11,173 INFO L402 BasicCegarLoop]: trace histogram [9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:07:11,174 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:07:11,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:07:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1222056691, now seen corresponding path program 12 times [2018-11-28 16:07:11,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:07:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:07:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:11,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 16:07:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:07:11,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 16:07:11,185 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 16:07:11,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 16:07:11,205 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 16:07:11,234 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-28 16:07:11,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 16:07:11,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:07:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:07:11,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:07:11,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-28 16:07:11,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 16:07:11,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 16:07:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:07:11,530 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 12 states. [2018-11-28 16:07:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:07:11,824 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-28 16:07:11,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 16:07:11,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-28 16:07:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:07:11,825 INFO L225 Difference]: With dead ends: 46 [2018-11-28 16:07:11,826 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:07:11,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-28 16:07:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:07:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:07:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:07:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:07:11,828 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-28 16:07:11,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:07:11,828 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:07:11,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 16:07:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:07:11,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:07:11,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:07:30,055 WARN L180 SmtUtils]: Spent 18.01 s on a formula simplification. DAG size of input: 216 DAG size of output: 92 [2018-11-28 16:07:30,058 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:07:30,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:07:30,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:07:30,059 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:07:30,059 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:07:30,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:07:30,059 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 30 46) the Hoare annotation is: true [2018-11-28 16:07:30,059 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 30 46) no Hoare annotation was computed. [2018-11-28 16:07:30,059 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-28 16:07:30,059 INFO L444 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= 18 main_~y~0) (= main_~x~0 63) (<= main_~y~0 18) (= (* 7 main_~g~0) main_~x~0)) [2018-11-28 16:07:30,060 INFO L444 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (and (= main_~y~0 18) (= main_~x~0 63) (= (* 7 main_~g~0) main_~x~0)) [2018-11-28 16:07:30,060 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 30 46) no Hoare annotation was computed. [2018-11-28 16:07:30,060 INFO L444 ceAbstractionStarter]: At program point L41-1(line 41) the Hoare annotation is: (and (= main_~y~0 18) (= main_~x~0 63) (= (* 7 main_~g~0) main_~x~0)) [2018-11-28 16:07:30,060 INFO L444 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (and (= main_~y~0 18) (= main_~x~0 63)) [2018-11-28 16:07:30,060 INFO L448 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-11-28 16:07:30,060 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-28 16:07:30,060 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-28 16:07:30,061 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-28 16:07:30,061 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-28 16:07:30,061 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-28 16:07:30,061 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-28 16:07:30,061 INFO L448 ceAbstractionStarter]: For program point gcd_testEXIT(lines 10 27) no Hoare annotation was computed. [2018-11-28 16:07:30,061 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 25) no Hoare annotation was computed. [2018-11-28 16:07:30,061 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 11 27) no Hoare annotation was computed. [2018-11-28 16:07:30,061 INFO L451 ceAbstractionStarter]: At program point gcd_testENTRY(lines 10 27) the Hoare annotation is: true [2018-11-28 16:07:30,061 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2018-11-28 16:07:30,062 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 19 25) the Hoare annotation is: (let ((.cse2 (= gcd_test_~b |gcd_test_#in~b|)) (.cse1 (<= 1 gcd_test_~a))) (or (exists ((v_gcd_test_~a_47 Int) (v_gcd_test_~b_28 Int)) (let ((.cse0 (* 3 v_gcd_test_~b_28))) (and (<= |gcd_test_#in~a| (+ v_gcd_test_~a_47 .cse0)) (<= (* 8 v_gcd_test_~a_47) .cse0) (<= v_gcd_test_~b_28 |gcd_test_#in~b|)))) (and .cse1 (exists ((v_gcd_test_~b_32 Int)) (and (<= (+ gcd_test_~b (* 2 |gcd_test_#in~a|) 1) (* 7 v_gcd_test_~b_32)) (<= v_gcd_test_~b_32 |gcd_test_#in~b|)))) (exists ((v_gcd_test_~a_31 Int) (v_gcd_test_~b_23 Int)) (and (<= (+ v_gcd_test_~b_23 1) (* 2 v_gcd_test_~a_31)) (<= (+ v_gcd_test_~a_31 (* 3 v_gcd_test_~b_23)) |gcd_test_#in~a|) (<= |gcd_test_#in~b| v_gcd_test_~b_23))) (let ((.cse3 (+ (* 2 gcd_test_~b) gcd_test_~a))) (and .cse2 (<= |gcd_test_#in~a| .cse3) (<= .cse3 |gcd_test_#in~a|))) (let ((.cse4 (+ gcd_test_~b gcd_test_~a))) (and .cse2 (<= |gcd_test_#in~a| .cse4) (<= .cse4 |gcd_test_#in~a|))) (and (= (+ gcd_test_~a (* 3 |gcd_test_#in~b|)) |gcd_test_#in~a|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b)) (and (exists ((v_gcd_test_~b_23 Int)) (and (<= (+ gcd_test_~a (* 3 v_gcd_test_~b_23)) |gcd_test_#in~a|) (<= |gcd_test_#in~b| v_gcd_test_~b_23) (<= v_gcd_test_~b_23 (+ gcd_test_~b gcd_test_~a)))) (exists ((v_gcd_test_~b_25 Int)) (and (<= (+ gcd_test_~b gcd_test_~a) v_gcd_test_~b_25) (<= v_gcd_test_~b_25 |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 v_gcd_test_~b_25) gcd_test_~a))))) (and .cse2 (= gcd_test_~a |gcd_test_#in~a|)) (exists ((v_gcd_test_~b_25 Int)) (and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) v_gcd_test_~b_25) (<= v_gcd_test_~b_25 |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 v_gcd_test_~b_25) gcd_test_~a)))) (and .cse1 (or (not (= gcd_test_~b 0)) (exists ((gcd_test_~a Int)) (= (+ gcd_test_~b (* 2 gcd_test_~a) (* 3 |gcd_test_#in~b|)) |gcd_test_#in~a|))) (exists ((v_gcd_test_~b_32 Int)) (and (<= (+ gcd_test_~b (* 2 |gcd_test_#in~a|)) (* 7 v_gcd_test_~b_32)) (<= v_gcd_test_~b_32 |gcd_test_#in~b|)))))) [2018-11-28 16:07:30,062 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-28 16:07:30,062 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 11 27) no Hoare annotation was computed. [2018-11-28 16:07:30,062 INFO L448 ceAbstractionStarter]: For program point gcd_testFINAL(lines 10 27) no Hoare annotation was computed. [2018-11-28 16:07:30,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] [2018-11-28 16:07:30,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] [2018-11-28 16:07:30,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] [2018-11-28 16:07:30,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] [2018-11-28 16:07:30,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2018-11-28 16:07:30,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] [2018-11-28 16:07:30,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] [2018-11-28 16:07:30,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] [2018-11-28 16:07:30,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] [2018-11-28 16:07:30,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2018-11-28 16:07:30,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:07:30 BoogieIcfgContainer [2018-11-28 16:07:30,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:07:30,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:07:30,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:07:30,104 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:07:30,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:06:33" (3/4) ... [2018-11-28 16:07:30,112 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:07:30,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:07:30,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:07:30,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 16:07:30,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd_test [2018-11-28 16:07:30,130 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 16:07:30,130 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 16:07:30,131 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:07:30,158 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_gcd_test_~a_47 : int, v_gcd_test_~b_28 : int :: (\old(a) <= v_gcd_test_~a_47 + 3 * v_gcd_test_~b_28 && 8 * v_gcd_test_~a_47 <= 3 * v_gcd_test_~b_28) && v_gcd_test_~b_28 <= \old(b)) || (1 <= a && (\exists v_gcd_test_~b_32 : int :: b + 2 * \old(a) + 1 <= 7 * v_gcd_test_~b_32 && v_gcd_test_~b_32 <= \old(b)))) || (\exists v_gcd_test_~a_31 : int, v_gcd_test_~b_23 : int :: (v_gcd_test_~b_23 + 1 <= 2 * v_gcd_test_~a_31 && v_gcd_test_~a_31 + 3 * v_gcd_test_~b_23 <= \old(a)) && \old(b) <= v_gcd_test_~b_23)) || ((b == \old(b) && \old(a) <= 2 * b + a) && 2 * b + a <= \old(a))) || ((b == \old(b) && \old(a) <= b + a) && b + a <= \old(a))) || ((a + 3 * \old(b) == \old(a) && 3 * b + a <= \old(a)) && \old(b) <= b)) || ((\exists v_gcd_test_~b_23 : int :: (a + 3 * v_gcd_test_~b_23 <= \old(a) && \old(b) <= v_gcd_test_~b_23) && v_gcd_test_~b_23 <= b + a) && (\exists v_gcd_test_~b_25 : int :: (b + a <= v_gcd_test_~b_25 && v_gcd_test_~b_25 <= \old(b)) && \old(a) <= 3 * v_gcd_test_~b_25 + a))) || (b == \old(b) && a == \old(a))) || (\exists v_gcd_test_~b_25 : int :: (b + 2 * a <= v_gcd_test_~b_25 && v_gcd_test_~b_25 <= \old(b)) && \old(a) <= 3 * v_gcd_test_~b_25 + a)) || ((1 <= a && (!(b == 0) || (\exists gcd_test_~a : int :: b + 2 * gcd_test_~a + 3 * \old(b) == \old(a)))) && (\exists v_gcd_test_~b_32 : int :: b + 2 * \old(a) <= 7 * v_gcd_test_~b_32 && v_gcd_test_~b_32 <= \old(b))) [2018-11-28 16:07:30,182 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:07:30,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:07:30,185 INFO L168 Benchmark]: Toolchain (without parser) took 57097.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 278.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 129.3 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:30,186 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:30,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.30 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:30,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.34 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:30,188 INFO L168 Benchmark]: Boogie Preprocessor took 37.62 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:30,188 INFO L168 Benchmark]: RCFGBuilder took 480.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -132.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:30,191 INFO L168 Benchmark]: TraceAbstraction took 56149.07 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.0 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:07:30,191 INFO L168 Benchmark]: Witness Printer took 78.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:07:30,196 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.30 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.34 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.62 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 480.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -132.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56149.07 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.0 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. * Witness Printer took 78.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2018-11-28 16:07:30,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] [2018-11-28 16:07:30,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] [2018-11-28 16:07:30,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] [2018-11-28 16:07:30,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] [2018-11-28 16:07:30,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2018-11-28 16:07:30,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] [2018-11-28 16:07:30,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_47,QUANTIFIED] [2018-11-28 16:07:30,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_28,QUANTIFIED] [2018-11-28 16:07:30,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] [2018-11-28 16:07:30,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_31,QUANTIFIED] [2018-11-28 16:07:30,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_23,QUANTIFIED] [2018-11-28 16:07:30,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_25,QUANTIFIED] [2018-11-28 16:07:30,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2018-11-28 16:07:30,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] [2018-11-28 16:07:30,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~b_32,QUANTIFIED] Derived loop invariant: (((((((((\exists v_gcd_test_~a_47 : int, v_gcd_test_~b_28 : int :: (\old(a) <= v_gcd_test_~a_47 + 3 * v_gcd_test_~b_28 && 8 * v_gcd_test_~a_47 <= 3 * v_gcd_test_~b_28) && v_gcd_test_~b_28 <= \old(b)) || (1 <= a && (\exists v_gcd_test_~b_32 : int :: b + 2 * \old(a) + 1 <= 7 * v_gcd_test_~b_32 && v_gcd_test_~b_32 <= \old(b)))) || (\exists v_gcd_test_~a_31 : int, v_gcd_test_~b_23 : int :: (v_gcd_test_~b_23 + 1 <= 2 * v_gcd_test_~a_31 && v_gcd_test_~a_31 + 3 * v_gcd_test_~b_23 <= \old(a)) && \old(b) <= v_gcd_test_~b_23)) || ((b == \old(b) && \old(a) <= 2 * b + a) && 2 * b + a <= \old(a))) || ((b == \old(b) && \old(a) <= b + a) && b + a <= \old(a))) || ((a + 3 * \old(b) == \old(a) && 3 * b + a <= \old(a)) && \old(b) <= b)) || ((\exists v_gcd_test_~b_23 : int :: (a + 3 * v_gcd_test_~b_23 <= \old(a) && \old(b) <= v_gcd_test_~b_23) && v_gcd_test_~b_23 <= b + a) && (\exists v_gcd_test_~b_25 : int :: (b + a <= v_gcd_test_~b_25 && v_gcd_test_~b_25 <= \old(b)) && \old(a) <= 3 * v_gcd_test_~b_25 + a))) || (b == \old(b) && a == \old(a))) || (\exists v_gcd_test_~b_25 : int :: (b + 2 * a <= v_gcd_test_~b_25 && v_gcd_test_~b_25 <= \old(b)) && \old(a) <= 3 * v_gcd_test_~b_25 + a)) || ((1 <= a && (!(b == 0) || (\exists gcd_test_~a : int :: b + 2 * gcd_test_~a + 3 * \old(b) == \old(a)))) && (\exists v_gcd_test_~b_32 : int :: b + 2 * \old(a) <= 7 * v_gcd_test_~b_32 && v_gcd_test_~b_32 <= \old(b))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. SAFE Result, 56.0s OverallTime, 18 OverallIterations, 9 TraceHistogramMax, 28.5s AutomataDifference, 0.0s DeadEndRemovalTime, 18.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 386 SDtfs, 213 SDslu, 2069 SDs, 0 SdLazy, 2282 SolverSat, 64 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 61 PreInvPairs, 98 NumberOfFragments, 255 HoareAnnotationTreeSize, 61 FomulaSimplifications, 2081 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 609 FormulaSimplificationTreeSizeReductionInter, 18.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 497 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 479 ConstructedInterpolants, 76 QuantifiedInterpolants, 93753 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1090 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 66/497 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...