/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/mannadiv.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:52:43,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:52:43,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:52:43,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:52:43,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:52:43,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:52:43,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:52:43,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:52:43,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:52:43,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:52:43,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:52:43,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:52:43,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:52:43,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:52:43,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:52:43,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:52:43,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:52:43,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:52:43,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:52:43,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:52:43,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:52:43,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:52:43,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:52:43,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:52:43,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:52:43,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:52:43,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:52:43,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:52:43,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:52:43,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:52:43,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:52:43,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:52:43,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:52:43,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:52:43,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:52:43,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:52:43,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:52:43,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:52:43,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:52:43,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:52:43,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:52:43,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:52:43,520 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:52:43,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:52:43,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:52:43,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:52:43,522 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:52:43,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:52:43,523 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:52:43,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:52:43,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:52:43,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:52:43,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:52:43,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:52:43,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:52:43,525 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:52:43,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:52:43,525 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:52:43,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:52:43,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:52:43,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:52:43,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:52:43,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:52:43,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:43,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:52:43,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:52:43,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:52:43,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:52:43,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:52:43,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:52:43,529 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:52:43,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:52:43,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:52:43,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:52:43,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:52:43,858 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:52:43,858 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:52:43,859 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/mannadiv.c [2020-07-17 22:52:43,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc2aa1d/c4796d7e9377416bbed57301dce17805/FLAG80c8edcac [2020-07-17 22:52:44,346 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:52:44,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c [2020-07-17 22:52:44,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc2aa1d/c4796d7e9377416bbed57301dce17805/FLAG80c8edcac [2020-07-17 22:52:44,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc2aa1d/c4796d7e9377416bbed57301dce17805 [2020-07-17 22:52:44,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:44,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:44,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:44,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:44,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:44,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@565a9679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44, skipping insertion in model container [2020-07-17 22:52:44,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:44,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:45,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:45,036 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:45,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:45,066 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:45,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45 WrapperNode [2020-07-17 22:52:45,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:45,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:45,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:45,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:45,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (1/1) ... [2020-07-17 22:52:45,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (1/1) ... [2020-07-17 22:52:45,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (1/1) ... [2020-07-17 22:52:45,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (1/1) ... [2020-07-17 22:52:45,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (1/1) ... [2020-07-17 22:52:45,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (1/1) ... [2020-07-17 22:52:45,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (1/1) ... [2020-07-17 22:52:45,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:45,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:45,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:45,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:45,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (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 [2020-07-17 22:52:45,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:45,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:45,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:45,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:52:45,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:45,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:45,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:45,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:45,492 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:45,493 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:52:45,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:45 BoogieIcfgContainer [2020-07-17 22:52:45,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:45,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:45,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:45,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:45,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:44" (1/3) ... [2020-07-17 22:52:45,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585250d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:45, skipping insertion in model container [2020-07-17 22:52:45,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:45" (2/3) ... [2020-07-17 22:52:45,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585250d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:45, skipping insertion in model container [2020-07-17 22:52:45,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:45" (3/3) ... [2020-07-17 22:52:45,507 INFO L109 eAbstractionObserver]: Analyzing ICFG mannadiv.c [2020-07-17 22:52:45,520 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:45,529 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:45,546 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:45,569 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:45,569 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:45,569 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:45,569 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:45,569 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:45,570 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:45,570 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:45,570 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-17 22:52:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:52:45,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:45,597 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:45,598 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash -849943384, now seen corresponding path program 1 times [2020-07-17 22:52:45,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:45,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810279933] [2020-07-17 22:52:45,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-17 22:52:45,752 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {31#true} {31#true} #55#return; {31#true} is VALID [2020-07-17 22:52:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-17 22:52:45,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-17 22:52:45,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-17 22:52:45,765 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #59#return; {32#false} is VALID [2020-07-17 22:52:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-17 22:52:45,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-17 22:52:45,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-17 22:52:45,775 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#false} {32#false} #61#return; {32#false} is VALID [2020-07-17 22:52:45,775 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2020-07-17 22:52:45,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-17 22:52:45,776 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #55#return; {31#true} is VALID [2020-07-17 22:52:45,776 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2020-07-17 22:52:45,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {31#true} is VALID [2020-07-17 22:52:45,777 INFO L263 TraceCheckUtils]: 5: Hoare triple {31#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {31#true} is VALID [2020-07-17 22:52:45,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-17 22:52:45,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-17 22:52:45,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-17 22:52:45,780 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {32#false} {31#true} #59#return; {32#false} is VALID [2020-07-17 22:52:45,780 INFO L263 TraceCheckUtils]: 10: Hoare triple {32#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {31#true} is VALID [2020-07-17 22:52:45,780 INFO L280 TraceCheckUtils]: 11: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-17 22:52:45,781 INFO L280 TraceCheckUtils]: 12: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-17 22:52:45,782 INFO L280 TraceCheckUtils]: 13: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-17 22:52:45,782 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {32#false} {32#false} #61#return; {32#false} is VALID [2020-07-17 22:52:45,782 INFO L280 TraceCheckUtils]: 15: Hoare triple {32#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {32#false} is VALID [2020-07-17 22:52:45,783 INFO L280 TraceCheckUtils]: 16: Hoare triple {32#false} assume !true; {32#false} is VALID [2020-07-17 22:52:45,783 INFO L263 TraceCheckUtils]: 17: Hoare triple {32#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {32#false} is VALID [2020-07-17 22:52:45,783 INFO L280 TraceCheckUtils]: 18: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2020-07-17 22:52:45,784 INFO L280 TraceCheckUtils]: 19: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2020-07-17 22:52:45,784 INFO L280 TraceCheckUtils]: 20: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-17 22:52:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:52:45,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810279933] [2020-07-17 22:52:45,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:45,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:52:45,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073074046] [2020-07-17 22:52:45,799 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-07-17 22:52:45,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:45,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:52:45,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:45,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:52:45,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:45,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:52:45,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:45,857 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-07-17 22:52:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:45,939 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2020-07-17 22:52:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:52:45,939 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-07-17 22:52:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2020-07-17 22:52:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2020-07-17 22:52:45,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2020-07-17 22:52:46,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:46,094 INFO L225 Difference]: With dead ends: 50 [2020-07-17 22:52:46,095 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:52:46,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:52:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 22:52:46,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:46,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-17 22:52:46,146 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:52:46,146 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:52:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,152 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-17 22:52:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:52:46,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:46,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:46,153 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:52:46,154 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:52:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,158 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-17 22:52:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:52:46,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:46,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:46,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:46,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:52:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-17 22:52:46,165 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2020-07-17 22:52:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:46,165 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-17 22:52:46,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:52:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:52:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:52:46,167 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:46,167 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:46,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:46,168 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1193991140, now seen corresponding path program 1 times [2020-07-17 22:52:46,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:46,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921633341] [2020-07-17 22:52:46,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:46,187 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:46,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533822386] [2020-07-17 22:52:46,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:52:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:46,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 22:52:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:46,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:46,449 INFO L263 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {192#true} is VALID [2020-07-17 22:52:46,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2020-07-17 22:52:46,450 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #55#return; {192#true} is VALID [2020-07-17 22:52:46,450 INFO L263 TraceCheckUtils]: 3: Hoare triple {192#true} call #t~ret2 := main(); {192#true} is VALID [2020-07-17 22:52:46,451 INFO L280 TraceCheckUtils]: 4: Hoare triple {192#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {192#true} is VALID [2020-07-17 22:52:46,451 INFO L263 TraceCheckUtils]: 5: Hoare triple {192#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {192#true} is VALID [2020-07-17 22:52:46,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {192#true} ~cond := #in~cond; {192#true} is VALID [2020-07-17 22:52:46,452 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#true} assume !(0 == ~cond); {192#true} is VALID [2020-07-17 22:52:46,452 INFO L280 TraceCheckUtils]: 8: Hoare triple {192#true} assume true; {192#true} is VALID [2020-07-17 22:52:46,452 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {192#true} {192#true} #59#return; {192#true} is VALID [2020-07-17 22:52:46,453 INFO L263 TraceCheckUtils]: 10: Hoare triple {192#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {192#true} is VALID [2020-07-17 22:52:46,454 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#true} ~cond := #in~cond; {230#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-17 22:52:46,455 INFO L280 TraceCheckUtils]: 12: Hoare triple {230#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {234#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-17 22:52:46,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {234#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {234#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-17 22:52:46,457 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {234#(not (= 0 |assume_abort_if_not_#in~cond|))} {192#true} #61#return; {241#(not (= 0 main_~x2~0))} is VALID [2020-07-17 22:52:46,458 INFO L280 TraceCheckUtils]: 15: Hoare triple {241#(not (= 0 main_~x2~0))} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {245#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (not (= 0 main_~x2~0)) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:46,459 INFO L280 TraceCheckUtils]: 16: Hoare triple {245#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (not (= 0 main_~x2~0)) (= main_~x1~0 main_~y3~0))} assume !false; {245#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (not (= 0 main_~x2~0)) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:46,460 INFO L263 TraceCheckUtils]: 17: Hoare triple {245#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (not (= 0 main_~x2~0)) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {252#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:46,461 INFO L280 TraceCheckUtils]: 18: Hoare triple {252#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {256#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:46,462 INFO L280 TraceCheckUtils]: 19: Hoare triple {256#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {193#false} is VALID [2020-07-17 22:52:46,463 INFO L280 TraceCheckUtils]: 20: Hoare triple {193#false} assume !false; {193#false} is VALID [2020-07-17 22:52:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:52:46,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921633341] [2020-07-17 22:52:46,467 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:46,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533822386] [2020-07-17 22:52:46,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:46,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:52:46,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718560895] [2020-07-17 22:52:46,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-17 22:52:46,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:46,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:52:46,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:46,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:52:46,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:46,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:52:46,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:52:46,502 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 8 states. [2020-07-17 22:52:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,834 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-17 22:52:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:52:46,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-17 22:52:46,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:52:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2020-07-17 22:52:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:52:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2020-07-17 22:52:46,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2020-07-17 22:52:46,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:46,894 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:52:46,894 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:52:46,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:52:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:52:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2020-07-17 22:52:46,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:46,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 29 states. [2020-07-17 22:52:46,917 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 29 states. [2020-07-17 22:52:46,917 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 29 states. [2020-07-17 22:52:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,921 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-17 22:52:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-17 22:52:46,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:46,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:46,922 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 32 states. [2020-07-17 22:52:46,922 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 32 states. [2020-07-17 22:52:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,926 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-17 22:52:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-17 22:52:46,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:46,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:46,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:46,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:52:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-17 22:52:46,931 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 21 [2020-07-17 22:52:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:46,931 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-17 22:52:46,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:52:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-17 22:52:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:52:46,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:46,933 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:47,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:52:47,148 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:47,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1415100442, now seen corresponding path program 1 times [2020-07-17 22:52:47,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:47,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118618829] [2020-07-17 22:52:47,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:47,161 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:47,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535766783] [2020-07-17 22:52:47,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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) [2020-07-17 22:52:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:47,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:47,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:47,327 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-17 22:52:47,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-17 22:52:47,328 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #55#return; {422#true} is VALID [2020-07-17 22:52:47,328 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret2 := main(); {422#true} is VALID [2020-07-17 22:52:47,328 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {422#true} is VALID [2020-07-17 22:52:47,329 INFO L263 TraceCheckUtils]: 5: Hoare triple {422#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {422#true} is VALID [2020-07-17 22:52:47,329 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2020-07-17 22:52:47,329 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2020-07-17 22:52:47,330 INFO L280 TraceCheckUtils]: 8: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-17 22:52:47,330 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {422#true} {422#true} #59#return; {422#true} is VALID [2020-07-17 22:52:47,330 INFO L263 TraceCheckUtils]: 10: Hoare triple {422#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {422#true} is VALID [2020-07-17 22:52:47,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2020-07-17 22:52:47,331 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2020-07-17 22:52:47,331 INFO L280 TraceCheckUtils]: 13: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-17 22:52:47,332 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {422#true} {422#true} #61#return; {422#true} is VALID [2020-07-17 22:52:47,332 INFO L280 TraceCheckUtils]: 15: Hoare triple {422#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {422#true} is VALID [2020-07-17 22:52:47,332 INFO L280 TraceCheckUtils]: 16: Hoare triple {422#true} assume !false; {422#true} is VALID [2020-07-17 22:52:47,333 INFO L263 TraceCheckUtils]: 17: Hoare triple {422#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {422#true} is VALID [2020-07-17 22:52:47,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} ~cond := #in~cond; {481#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:47,335 INFO L280 TraceCheckUtils]: 19: Hoare triple {481#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {485#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:47,336 INFO L280 TraceCheckUtils]: 20: Hoare triple {485#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {485#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:47,337 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {485#(not (= 0 |__VERIFIER_assert_#in~cond|))} {422#true} #63#return; {492#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} is VALID [2020-07-17 22:52:47,339 INFO L280 TraceCheckUtils]: 22: Hoare triple {492#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} assume !(0 != ~y3~0); {496#(= (+ main_~y2~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} is VALID [2020-07-17 22:52:47,340 INFO L263 TraceCheckUtils]: 23: Hoare triple {496#(= (+ main_~y2~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {500#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:47,341 INFO L280 TraceCheckUtils]: 24: Hoare triple {500#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {504#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:47,342 INFO L280 TraceCheckUtils]: 25: Hoare triple {504#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {423#false} is VALID [2020-07-17 22:52:47,342 INFO L280 TraceCheckUtils]: 26: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-17 22:52:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:52:47,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118618829] [2020-07-17 22:52:47,345 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:47,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535766783] [2020-07-17 22:52:47,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:47,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 22:52:47,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081646544] [2020-07-17 22:52:47,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-17 22:52:47,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:47,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:52:47,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:47,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:52:47,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:47,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:52:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:52:47,381 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2020-07-17 22:52:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:51,794 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-17 22:52:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:52:51,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-17 22:52:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:52:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2020-07-17 22:52:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:52:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2020-07-17 22:52:51,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2020-07-17 22:52:51,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:51,851 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:52:51,853 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:52:51,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:52:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:52:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2020-07-17 22:52:51,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:51,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2020-07-17 22:52:51,878 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2020-07-17 22:52:51,878 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2020-07-17 22:52:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:51,881 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-17 22:52:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-17 22:52:51,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:51,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:51,882 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2020-07-17 22:52:51,882 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2020-07-17 22:52:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:51,885 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-17 22:52:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-17 22:52:51,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:51,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:51,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:51,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:52:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-17 22:52:51,889 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 27 [2020-07-17 22:52:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:51,889 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-17 22:52:51,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:52:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-17 22:52:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:52:51,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:51,891 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:52,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:52,104 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1831429119, now seen corresponding path program 1 times [2020-07-17 22:52:52,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:52,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655365435] [2020-07-17 22:52:52,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:52,117 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:52,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096464903] [2020-07-17 22:52:52,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:52:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:52,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-17 22:52:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:52,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:52,277 INFO L263 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2020-07-17 22:52:52,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-17 22:52:52,278 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} #55#return; {679#true} is VALID [2020-07-17 22:52:52,278 INFO L263 TraceCheckUtils]: 3: Hoare triple {679#true} call #t~ret2 := main(); {679#true} is VALID [2020-07-17 22:52:52,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {679#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {679#true} is VALID [2020-07-17 22:52:52,279 INFO L263 TraceCheckUtils]: 5: Hoare triple {679#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {679#true} is VALID [2020-07-17 22:52:52,279 INFO L280 TraceCheckUtils]: 6: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2020-07-17 22:52:52,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2020-07-17 22:52:52,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-17 22:52:52,280 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {679#true} {679#true} #59#return; {679#true} is VALID [2020-07-17 22:52:52,280 INFO L263 TraceCheckUtils]: 10: Hoare triple {679#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {679#true} is VALID [2020-07-17 22:52:52,281 INFO L280 TraceCheckUtils]: 11: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2020-07-17 22:52:52,281 INFO L280 TraceCheckUtils]: 12: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2020-07-17 22:52:52,281 INFO L280 TraceCheckUtils]: 13: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-17 22:52:52,281 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {679#true} {679#true} #61#return; {679#true} is VALID [2020-07-17 22:52:52,282 INFO L280 TraceCheckUtils]: 15: Hoare triple {679#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:52,283 INFO L280 TraceCheckUtils]: 16: Hoare triple {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !false; {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:52,283 INFO L263 TraceCheckUtils]: 17: Hoare triple {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {679#true} is VALID [2020-07-17 22:52:52,284 INFO L280 TraceCheckUtils]: 18: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2020-07-17 22:52:52,284 INFO L280 TraceCheckUtils]: 19: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2020-07-17 22:52:52,284 INFO L280 TraceCheckUtils]: 20: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-17 22:52:52,285 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {679#true} {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} #63#return; {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:52,286 INFO L280 TraceCheckUtils]: 22: Hoare triple {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !!(0 != ~y3~0); {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:52,287 INFO L280 TraceCheckUtils]: 23: Hoare triple {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {754#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:52,288 INFO L280 TraceCheckUtils]: 24: Hoare triple {754#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !false; {754#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:52,290 INFO L263 TraceCheckUtils]: 25: Hoare triple {754#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 1) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:52,290 INFO L280 TraceCheckUtils]: 26: Hoare triple {761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:52,291 INFO L280 TraceCheckUtils]: 27: Hoare triple {765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {680#false} is VALID [2020-07-17 22:52:52,291 INFO L280 TraceCheckUtils]: 28: Hoare triple {680#false} assume !false; {680#false} is VALID [2020-07-17 22:52:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:52:52,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655365435] [2020-07-17 22:52:52,294 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:52,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096464903] [2020-07-17 22:52:52,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:52,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 22:52:52,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379011952] [2020-07-17 22:52:52,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-17 22:52:52,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:52,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:52:52,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:52,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:52:52,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:52,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:52:52,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:52:52,330 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2020-07-17 22:52:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:52,640 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-17 22:52:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:52:52,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-17 22:52:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-17 22:52:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-17 22:52:52,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-17 22:52:52,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:52,725 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:52:52,726 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:52:52,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:52:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:52:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-17 22:52:52,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:52,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-17 22:52:52,770 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:52:52,770 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:52:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:52,778 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-17 22:52:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-17 22:52:52,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:52,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:52,779 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:52:52,779 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:52:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:52,784 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-17 22:52:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-17 22:52:52,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:52,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:52,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:52,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:52:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-07-17 22:52:52,791 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 29 [2020-07-17 22:52:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:52,791 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-07-17 22:52:52,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:52:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-17 22:52:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:52:52,793 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:52,793 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:53,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:53,004 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:53,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:53,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1286102758, now seen corresponding path program 2 times [2020-07-17 22:52:53,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:53,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310325822] [2020-07-17 22:52:53,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:53,023 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:53,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115538761] [2020-07-17 22:52:53,023 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-07-17 22:52:53,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:52:53,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:53,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-17 22:52:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:53,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:53,230 INFO L263 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2020-07-17 22:52:53,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-17 22:52:53,231 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1009#true} {1009#true} #55#return; {1009#true} is VALID [2020-07-17 22:52:53,231 INFO L263 TraceCheckUtils]: 3: Hoare triple {1009#true} call #t~ret2 := main(); {1009#true} is VALID [2020-07-17 22:52:53,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {1009#true} is VALID [2020-07-17 22:52:53,232 INFO L263 TraceCheckUtils]: 5: Hoare triple {1009#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1009#true} is VALID [2020-07-17 22:52:53,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#true} ~cond := #in~cond; {1009#true} is VALID [2020-07-17 22:52:53,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#true} assume !(0 == ~cond); {1009#true} is VALID [2020-07-17 22:52:53,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-17 22:52:53,233 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1009#true} {1009#true} #59#return; {1009#true} is VALID [2020-07-17 22:52:53,233 INFO L263 TraceCheckUtils]: 10: Hoare triple {1009#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1009#true} is VALID [2020-07-17 22:52:53,234 INFO L280 TraceCheckUtils]: 11: Hoare triple {1009#true} ~cond := #in~cond; {1009#true} is VALID [2020-07-17 22:52:53,234 INFO L280 TraceCheckUtils]: 12: Hoare triple {1009#true} assume !(0 == ~cond); {1009#true} is VALID [2020-07-17 22:52:53,234 INFO L280 TraceCheckUtils]: 13: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-17 22:52:53,234 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1009#true} {1009#true} #61#return; {1009#true} is VALID [2020-07-17 22:52:53,242 INFO L280 TraceCheckUtils]: 15: Hoare triple {1009#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:53,243 INFO L280 TraceCheckUtils]: 16: Hoare triple {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !false; {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:53,244 INFO L263 TraceCheckUtils]: 17: Hoare triple {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1009#true} is VALID [2020-07-17 22:52:53,244 INFO L280 TraceCheckUtils]: 18: Hoare triple {1009#true} ~cond := #in~cond; {1009#true} is VALID [2020-07-17 22:52:53,244 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#true} assume !(0 == ~cond); {1009#true} is VALID [2020-07-17 22:52:53,245 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-17 22:52:53,246 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1009#true} {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} #63#return; {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:53,247 INFO L280 TraceCheckUtils]: 22: Hoare triple {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !!(0 != ~y3~0); {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:53,248 INFO L280 TraceCheckUtils]: 23: Hoare triple {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:53,248 INFO L280 TraceCheckUtils]: 24: Hoare triple {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !false; {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:53,248 INFO L263 TraceCheckUtils]: 25: Hoare triple {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1009#true} is VALID [2020-07-17 22:52:53,249 INFO L280 TraceCheckUtils]: 26: Hoare triple {1009#true} ~cond := #in~cond; {1009#true} is VALID [2020-07-17 22:52:53,249 INFO L280 TraceCheckUtils]: 27: Hoare triple {1009#true} assume !(0 == ~cond); {1009#true} is VALID [2020-07-17 22:52:53,249 INFO L280 TraceCheckUtils]: 28: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-17 22:52:53,250 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1009#true} {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} #63#return; {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:53,251 INFO L280 TraceCheckUtils]: 30: Hoare triple {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !!(0 != ~y3~0); {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:53,255 INFO L280 TraceCheckUtils]: 31: Hoare triple {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1109#(and (= 1 main_~x2~0) (= 2 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} is VALID [2020-07-17 22:52:53,255 INFO L280 TraceCheckUtils]: 32: Hoare triple {1109#(and (= 1 main_~x2~0) (= 2 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} assume !false; {1109#(and (= 1 main_~x2~0) (= 2 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} is VALID [2020-07-17 22:52:53,256 INFO L263 TraceCheckUtils]: 33: Hoare triple {1109#(and (= 1 main_~x2~0) (= 2 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:53,257 INFO L280 TraceCheckUtils]: 34: Hoare triple {1116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:53,257 INFO L280 TraceCheckUtils]: 35: Hoare triple {1120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1010#false} is VALID [2020-07-17 22:52:53,257 INFO L280 TraceCheckUtils]: 36: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2020-07-17 22:52:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-17 22:52:53,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310325822] [2020-07-17 22:52:53,261 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:53,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115538761] [2020-07-17 22:52:53,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:53,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:52:53,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527439661] [2020-07-17 22:52:53,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-17 22:52:53,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:53,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:52:53,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:53,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:52:53,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:52:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:52:53,314 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 7 states. [2020-07-17 22:52:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:53,736 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-17 22:52:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:52:53,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-17 22:52:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2020-07-17 22:52:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2020-07-17 22:52:53,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2020-07-17 22:52:53,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:53,824 INFO L225 Difference]: With dead ends: 68 [2020-07-17 22:52:53,825 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 22:52:53,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:52:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 22:52:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-17 22:52:53,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:53,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-17 22:52:53,871 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-17 22:52:53,871 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-17 22:52:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:53,874 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-17 22:52:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-17 22:52:53,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:53,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:53,875 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-17 22:52:53,875 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-17 22:52:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:53,878 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-17 22:52:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-17 22:52:53,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:53,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:53,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:53,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-17 22:52:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-07-17 22:52:53,882 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 37 [2020-07-17 22:52:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:53,882 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-07-17 22:52:53,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:52:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-17 22:52:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:52:53,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:53,884 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:54,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:54,097 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:54,097 INFO L82 PathProgramCache]: Analyzing trace with hash 274985508, now seen corresponding path program 1 times [2020-07-17 22:52:54,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:54,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791899004] [2020-07-17 22:52:54,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:54,109 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:54,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162128141] [2020-07-17 22:52:54,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:52:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:54,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-17 22:52:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:54,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:54,329 INFO L263 TraceCheckUtils]: 0: Hoare triple {1402#true} call ULTIMATE.init(); {1402#true} is VALID [2020-07-17 22:52:54,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-17 22:52:54,329 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1402#true} {1402#true} #55#return; {1402#true} is VALID [2020-07-17 22:52:54,330 INFO L263 TraceCheckUtils]: 3: Hoare triple {1402#true} call #t~ret2 := main(); {1402#true} is VALID [2020-07-17 22:52:54,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {1402#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {1402#true} is VALID [2020-07-17 22:52:54,330 INFO L263 TraceCheckUtils]: 5: Hoare triple {1402#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1402#true} is VALID [2020-07-17 22:52:54,330 INFO L280 TraceCheckUtils]: 6: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2020-07-17 22:52:54,330 INFO L280 TraceCheckUtils]: 7: Hoare triple {1402#true} assume !(0 == ~cond); {1402#true} is VALID [2020-07-17 22:52:54,331 INFO L280 TraceCheckUtils]: 8: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-17 22:52:54,331 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1402#true} {1402#true} #59#return; {1402#true} is VALID [2020-07-17 22:52:54,331 INFO L263 TraceCheckUtils]: 10: Hoare triple {1402#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1402#true} is VALID [2020-07-17 22:52:54,331 INFO L280 TraceCheckUtils]: 11: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2020-07-17 22:52:54,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {1402#true} assume !(0 == ~cond); {1402#true} is VALID [2020-07-17 22:52:54,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-17 22:52:54,332 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1402#true} {1402#true} #61#return; {1402#true} is VALID [2020-07-17 22:52:54,333 INFO L280 TraceCheckUtils]: 15: Hoare triple {1402#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:54,334 INFO L280 TraceCheckUtils]: 16: Hoare triple {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !false; {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:54,334 INFO L263 TraceCheckUtils]: 17: Hoare triple {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1402#true} is VALID [2020-07-17 22:52:54,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2020-07-17 22:52:54,334 INFO L280 TraceCheckUtils]: 19: Hoare triple {1402#true} assume !(0 == ~cond); {1402#true} is VALID [2020-07-17 22:52:54,335 INFO L280 TraceCheckUtils]: 20: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-17 22:52:54,336 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1402#true} {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} #63#return; {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:54,336 INFO L280 TraceCheckUtils]: 22: Hoare triple {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !!(0 != ~y3~0); {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-17 22:52:54,337 INFO L280 TraceCheckUtils]: 23: Hoare triple {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !(1 + ~y2~0 == ~x2~0);~y2~0 := 1 + ~y2~0;~y3~0 := ~y3~0 - 1; {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:54,338 INFO L280 TraceCheckUtils]: 24: Hoare triple {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !false; {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:54,338 INFO L263 TraceCheckUtils]: 25: Hoare triple {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1402#true} is VALID [2020-07-17 22:52:54,339 INFO L280 TraceCheckUtils]: 26: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2020-07-17 22:52:54,339 INFO L280 TraceCheckUtils]: 27: Hoare triple {1402#true} assume !(0 == ~cond); {1402#true} is VALID [2020-07-17 22:52:54,339 INFO L280 TraceCheckUtils]: 28: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-17 22:52:54,340 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1402#true} {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} #63#return; {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:54,341 INFO L280 TraceCheckUtils]: 30: Hoare triple {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !!(0 != ~y3~0); {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-17 22:52:54,343 INFO L280 TraceCheckUtils]: 31: Hoare triple {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1502#(and (= 2 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} is VALID [2020-07-17 22:52:54,344 INFO L280 TraceCheckUtils]: 32: Hoare triple {1502#(and (= 2 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} assume !false; {1502#(and (= 2 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} is VALID [2020-07-17 22:52:54,345 INFO L263 TraceCheckUtils]: 33: Hoare triple {1502#(and (= 2 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:54,346 INFO L280 TraceCheckUtils]: 34: Hoare triple {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:54,347 INFO L280 TraceCheckUtils]: 35: Hoare triple {1513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1403#false} is VALID [2020-07-17 22:52:54,347 INFO L280 TraceCheckUtils]: 36: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2020-07-17 22:52:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-17 22:52:54,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791899004] [2020-07-17 22:52:54,350 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:54,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162128141] [2020-07-17 22:52:54,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:54,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:52:54,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944635249] [2020-07-17 22:52:54,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-17 22:52:54,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:54,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:52:54,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:54,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:52:54,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:52:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:52:54,394 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2020-07-17 22:52:54,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:54,846 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2020-07-17 22:52:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:52:54,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-17 22:52:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-17 22:52:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:52:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-17 22:52:54,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2020-07-17 22:52:54,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:54,955 INFO L225 Difference]: With dead ends: 84 [2020-07-17 22:52:54,956 INFO L226 Difference]: Without dead ends: 68 [2020-07-17 22:52:54,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:52:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-17 22:52:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-17 22:52:55,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:55,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2020-07-17 22:52:55,017 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-17 22:52:55,017 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-17 22:52:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:55,022 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-17 22:52:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-17 22:52:55,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:55,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:55,023 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-17 22:52:55,023 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-17 22:52:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:55,026 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-17 22:52:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-17 22:52:55,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:55,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:55,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:55,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-17 22:52:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-07-17 22:52:55,030 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 37 [2020-07-17 22:52:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:55,031 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-07-17 22:52:55,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:52:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-17 22:52:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 22:52:55,032 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:55,032 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:55,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:52:55,247 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash 584019147, now seen corresponding path program 3 times [2020-07-17 22:52:55,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:55,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175782662] [2020-07-17 22:52:55,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:55,257 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:55,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745248191] [2020-07-17 22:52:55,258 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-07-17 22:52:55,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-17 22:52:55,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:55,291 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-17 22:52:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-17 22:52:57,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:57,535 INFO L263 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1871#true} is VALID [2020-07-17 22:52:57,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-17 22:52:57,536 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1871#true} {1871#true} #55#return; {1871#true} is VALID [2020-07-17 22:52:57,536 INFO L263 TraceCheckUtils]: 3: Hoare triple {1871#true} call #t~ret2 := main(); {1871#true} is VALID [2020-07-17 22:52:57,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {1871#true} is VALID [2020-07-17 22:52:57,537 INFO L263 TraceCheckUtils]: 5: Hoare triple {1871#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1871#true} is VALID [2020-07-17 22:52:57,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} ~cond := #in~cond; {1871#true} is VALID [2020-07-17 22:52:57,537 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} assume !(0 == ~cond); {1871#true} is VALID [2020-07-17 22:52:57,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-17 22:52:57,537 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1871#true} {1871#true} #59#return; {1871#true} is VALID [2020-07-17 22:52:57,538 INFO L263 TraceCheckUtils]: 10: Hoare triple {1871#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1871#true} is VALID [2020-07-17 22:52:57,538 INFO L280 TraceCheckUtils]: 11: Hoare triple {1871#true} ~cond := #in~cond; {1871#true} is VALID [2020-07-17 22:52:57,538 INFO L280 TraceCheckUtils]: 12: Hoare triple {1871#true} assume !(0 == ~cond); {1871#true} is VALID [2020-07-17 22:52:57,539 INFO L280 TraceCheckUtils]: 13: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-17 22:52:57,539 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1871#true} {1871#true} #61#return; {1871#true} is VALID [2020-07-17 22:52:57,539 INFO L280 TraceCheckUtils]: 15: Hoare triple {1871#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1871#true} is VALID [2020-07-17 22:52:57,540 INFO L280 TraceCheckUtils]: 16: Hoare triple {1871#true} assume !false; {1871#true} is VALID [2020-07-17 22:52:57,540 INFO L263 TraceCheckUtils]: 17: Hoare triple {1871#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1871#true} is VALID [2020-07-17 22:52:57,540 INFO L280 TraceCheckUtils]: 18: Hoare triple {1871#true} ~cond := #in~cond; {1871#true} is VALID [2020-07-17 22:52:57,540 INFO L280 TraceCheckUtils]: 19: Hoare triple {1871#true} assume !(0 == ~cond); {1871#true} is VALID [2020-07-17 22:52:57,540 INFO L280 TraceCheckUtils]: 20: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-17 22:52:57,541 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1871#true} {1871#true} #63#return; {1871#true} is VALID [2020-07-17 22:52:57,541 INFO L280 TraceCheckUtils]: 22: Hoare triple {1871#true} assume !!(0 != ~y3~0); {1871#true} is VALID [2020-07-17 22:52:57,541 INFO L280 TraceCheckUtils]: 23: Hoare triple {1871#true} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1871#true} is VALID [2020-07-17 22:52:57,541 INFO L280 TraceCheckUtils]: 24: Hoare triple {1871#true} assume !false; {1871#true} is VALID [2020-07-17 22:52:57,542 INFO L263 TraceCheckUtils]: 25: Hoare triple {1871#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1871#true} is VALID [2020-07-17 22:52:57,542 INFO L280 TraceCheckUtils]: 26: Hoare triple {1871#true} ~cond := #in~cond; {1871#true} is VALID [2020-07-17 22:52:57,542 INFO L280 TraceCheckUtils]: 27: Hoare triple {1871#true} assume !(0 == ~cond); {1871#true} is VALID [2020-07-17 22:52:57,542 INFO L280 TraceCheckUtils]: 28: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-17 22:52:57,542 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1871#true} {1871#true} #63#return; {1871#true} is VALID [2020-07-17 22:52:57,542 INFO L280 TraceCheckUtils]: 30: Hoare triple {1871#true} assume !!(0 != ~y3~0); {1871#true} is VALID [2020-07-17 22:52:57,543 INFO L280 TraceCheckUtils]: 31: Hoare triple {1871#true} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1871#true} is VALID [2020-07-17 22:52:57,543 INFO L280 TraceCheckUtils]: 32: Hoare triple {1871#true} assume !false; {1871#true} is VALID [2020-07-17 22:52:57,543 INFO L263 TraceCheckUtils]: 33: Hoare triple {1871#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1871#true} is VALID [2020-07-17 22:52:57,544 INFO L280 TraceCheckUtils]: 34: Hoare triple {1871#true} ~cond := #in~cond; {1978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:57,544 INFO L280 TraceCheckUtils]: 35: Hoare triple {1978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:57,545 INFO L280 TraceCheckUtils]: 36: Hoare triple {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:52:57,546 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} {1871#true} #63#return; {1989#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} is VALID [2020-07-17 22:52:57,546 INFO L280 TraceCheckUtils]: 38: Hoare triple {1989#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} assume !!(0 != ~y3~0); {1989#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} is VALID [2020-07-17 22:52:59,574 INFO L280 TraceCheckUtils]: 39: Hoare triple {1989#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1996#(and (= main_~x1~0 (+ main_~y3~0 (* main_~y1~0 main_~x2~0))) (= 0 main_~y2~0))} is UNKNOWN [2020-07-17 22:52:59,575 INFO L280 TraceCheckUtils]: 40: Hoare triple {1996#(and (= main_~x1~0 (+ main_~y3~0 (* main_~y1~0 main_~x2~0))) (= 0 main_~y2~0))} assume !false; {1996#(and (= main_~x1~0 (+ main_~y3~0 (* main_~y1~0 main_~x2~0))) (= 0 main_~y2~0))} is VALID [2020-07-17 22:52:59,576 INFO L263 TraceCheckUtils]: 41: Hoare triple {1996#(and (= main_~x1~0 (+ main_~y3~0 (* main_~y1~0 main_~x2~0))) (= 0 main_~y2~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:59,577 INFO L280 TraceCheckUtils]: 42: Hoare triple {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:59,577 INFO L280 TraceCheckUtils]: 43: Hoare triple {2007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1872#false} is VALID [2020-07-17 22:52:59,577 INFO L280 TraceCheckUtils]: 44: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2020-07-17 22:52:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-17 22:52:59,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175782662] [2020-07-17 22:52:59,580 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:59,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745248191] [2020-07-17 22:52:59,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:59,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 22:52:59,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471523314] [2020-07-17 22:52:59,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-17 22:52:59,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:59,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:53:01,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:01,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:53:01,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:53:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:53:01,677 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2020-07-17 22:53:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:06,020 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2020-07-17 22:53:06,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:53:06,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-17 22:53:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:53:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-17 22:53:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:53:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-17 22:53:06,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2020-07-17 22:53:08,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:08,135 INFO L225 Difference]: With dead ends: 70 [2020-07-17 22:53:08,135 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:53:08,137 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:53:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:53:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:53:08,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:08,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:53:08,138 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:53:08,138 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:53:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:08,139 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:53:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:53:08,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:08,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:08,140 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:53:08,140 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:53:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:08,140 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:53:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:53:08,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:08,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:08,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:08,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:53:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:53:08,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-07-17 22:53:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:08,142 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:53:08,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:53:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:53:08,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:08,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:08,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:53:08,517 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:53:08,518 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:53:08,518 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:53:08,518 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:53:08,518 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:53:08,518 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:53:08,518 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 10 12) the Hoare annotation is: true [2020-07-17 22:53:08,518 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-17 22:53:08,518 INFO L268 CegarLoopResult]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2020-07-17 22:53:08,518 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 10 12) no Hoare annotation was computed. [2020-07-17 22:53:08,519 INFO L264 CegarLoopResult]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse0 (* main_~y1~0 main_~x2~0))) (and (= (+ main_~y2~0 .cse0) main_~x1~0) (not (= 0 main_~x2~0)) (= (+ main_~y2~0 main_~y3~0 .cse0) main_~x1~0))) [2020-07-17 22:53:08,519 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-17 22:53:08,519 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2020-07-17 22:53:08,519 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2020-07-17 22:53:08,519 INFO L268 CegarLoopResult]: For program point L38(lines 38 45) no Hoare annotation was computed. [2020-07-17 22:53:08,519 INFO L264 CegarLoopResult]: At program point L38-2(lines 33 46) the Hoare annotation is: (and (not (= 0 main_~x2~0)) (= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)) [2020-07-17 22:53:08,519 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (not (= 0 main_~x2~0)) (= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)) [2020-07-17 22:53:08,519 INFO L268 CegarLoopResult]: For program point L34-1(lines 33 46) no Hoare annotation was computed. [2020-07-17 22:53:08,520 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2020-07-17 22:53:08,520 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-17 22:53:08,520 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-17 22:53:08,520 INFO L268 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-07-17 22:53:08,520 INFO L268 CegarLoopResult]: For program point L15(lines 15 16) no Hoare annotation was computed. [2020-07-17 22:53:08,520 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2020-07-17 22:53:08,520 INFO L268 CegarLoopResult]: For program point L14(lines 14 17) no Hoare annotation was computed. [2020-07-17 22:53:08,520 INFO L268 CegarLoopResult]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2020-07-17 22:53:08,520 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2020-07-17 22:53:08,520 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2020-07-17 22:53:08,523 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:53:08,524 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:53:08,525 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:53:08,527 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:53:08,527 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:53:08,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:53:08 BoogieIcfgContainer [2020-07-17 22:53:08,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:53:08,540 INFO L168 Benchmark]: Toolchain (without parser) took 23763.44 ms. Allocated memory was 146.3 MB in the beginning and 274.7 MB in the end (delta: 128.5 MB). Free memory was 103.9 MB in the beginning and 107.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:53:08,541 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:53:08,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.83 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 93.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:53:08,542 INFO L168 Benchmark]: Boogie Preprocessor took 114.32 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.7 MB in the beginning and 183.4 MB in the end (delta: -89.7 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:53:08,543 INFO L168 Benchmark]: RCFGBuilder took 312.71 ms. Allocated memory is still 203.4 MB. Free memory was 182.5 MB in the beginning and 164.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:53:08,544 INFO L168 Benchmark]: TraceAbstraction took 23037.73 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 164.0 MB in the beginning and 107.7 MB in the end (delta: 56.4 MB). Peak memory consumption was 127.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:53:08,547 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.83 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 93.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.32 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.7 MB in the beginning and 183.4 MB in the end (delta: -89.7 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 312.71 ms. Allocated memory is still 203.4 MB. Free memory was 182.5 MB in the beginning and 164.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23037.73 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 164.0 MB in the beginning and 107.7 MB in the end (delta: 56.4 MB). Peak memory consumption was 127.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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: 33]: Loop Invariant Derived loop invariant: !(0 == x2) && y2 + y3 + y1 * x2 == x1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 22.7s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 150 SDtfs, 60 SDslu, 523 SDs, 0 SdLazy, 347 SolverSat, 21 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 28 PreInvPairs, 44 NumberOfFragments, 54 HoareAnnotationTreeSize, 28 FomulaSimplifications, 453 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 217 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 20250 SizeOfPredicates, 16 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 82/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...