/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/fermat2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:48:12,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:48:12,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:48:12,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:48:12,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:48:12,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:48:12,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:48:12,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:48:12,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:48:12,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:48:12,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:48:12,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:48:12,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:48:12,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:48:12,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:48:12,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:48:12,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:48:12,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:48:12,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:48:12,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:48:12,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:48:12,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:48:12,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:48:12,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:48:12,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:48:12,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:48:12,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:48:12,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:48:12,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:48:12,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:48:12,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:48:12,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:48:12,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:48:12,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:48:12,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:48:12,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:48:12,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:48:12,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:48:12,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:48:12,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:48:12,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:48:12,603 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-08 12:48:12,618 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:48:12,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:48:12,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:48:12,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:48:12,620 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:48:12,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:48:12,621 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:48:12,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:48:12,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:48:12,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:48:12,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:48:12,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:48:12,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:48:12,622 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:48:12,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:48:12,622 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:48:12,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:48:12,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:48:12,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:48:12,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:48:12,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:48:12,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:48:12,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:48:12,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:48:12,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:48:12,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:48:12,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:48:12,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:48:12,626 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:48:12,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:48:12,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:48:12,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:48:12,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:48:12,986 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:48:12,986 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:48:12,987 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/fermat2.c [2020-07-08 12:48:13,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a05edc5/160c40843c8c40838f3c2aac44ec2cf0/FLAG67248e11a [2020-07-08 12:48:13,744 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:48:13,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/fermat2.c [2020-07-08 12:48:13,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a05edc5/160c40843c8c40838f3c2aac44ec2cf0/FLAG67248e11a [2020-07-08 12:48:14,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a05edc5/160c40843c8c40838f3c2aac44ec2cf0 [2020-07-08 12:48:14,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:48:14,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:48:14,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:14,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:48:14,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:48:14,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ab684d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14, skipping insertion in model container [2020-07-08 12:48:14,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:48:14,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:48:14,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:14,464 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:48:14,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:14,513 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:48:14,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14 WrapperNode [2020-07-08 12:48:14,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:14,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:48:14,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:48:14,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:48:14,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (1/1) ... [2020-07-08 12:48:14,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:48:14,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:48:14,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:48:14,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:48:14,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (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-08 12:48:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:48:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:48:14,730 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:48:14,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:48:14,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:48:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:48:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-08 12:48:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:48:14,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:48:14,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:48:14,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:48:14,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:48:14,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:48:15,055 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:48:15,056 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:48:15,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:15 BoogieIcfgContainer [2020-07-08 12:48:15,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:48:15,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:48:15,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:48:15,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:48:15,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:48:14" (1/3) ... [2020-07-08 12:48:15,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5890a969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:15, skipping insertion in model container [2020-07-08 12:48:15,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:14" (2/3) ... [2020-07-08 12:48:15,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5890a969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:15, skipping insertion in model container [2020-07-08 12:48:15,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:15" (3/3) ... [2020-07-08 12:48:15,073 INFO L109 eAbstractionObserver]: Analyzing ICFG fermat2.c [2020-07-08 12:48:15,084 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:48:15,092 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:48:15,116 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:48:15,152 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:48:15,153 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:48:15,153 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:48:15,153 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:48:15,153 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:48:15,153 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:48:15,154 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:48:15,154 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:48:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-08 12:48:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:48:15,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:15,179 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-08 12:48:15,179 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:15,186 INFO L82 PathProgramCache]: Analyzing trace with hash -849943384, now seen corresponding path program 1 times [2020-07-08 12:48:15,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:15,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660779437] [2020-07-08 12:48:15,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:15,267 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:15,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395282263] [2020-07-08 12:48:15,268 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-08 12:48:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-08 12:48:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:15,368 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:15,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2020-07-08 12:48:15,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-08 12:48:15,442 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #55#return; {31#true} is VALID [2020-07-08 12:48:15,443 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2020-07-08 12:48:15,443 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {31#true} is VALID [2020-07-08 12:48:15,444 INFO L263 TraceCheckUtils]: 5: Hoare triple {31#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31#true} is VALID [2020-07-08 12:48:15,444 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-08 12:48:15,446 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-08 12:48:15,446 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-08 12:48:15,447 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {32#false} {31#true} #59#return; {32#false} is VALID [2020-07-08 12:48:15,447 INFO L263 TraceCheckUtils]: 10: Hoare triple {32#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {32#false} is VALID [2020-07-08 12:48:15,448 INFO L280 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2020-07-08 12:48:15,448 INFO L280 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-08 12:48:15,449 INFO L280 TraceCheckUtils]: 13: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-08 12:48:15,449 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {32#false} {32#false} #61#return; {32#false} is VALID [2020-07-08 12:48:15,449 INFO L280 TraceCheckUtils]: 15: Hoare triple {32#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32#false} is VALID [2020-07-08 12:48:15,450 INFO L280 TraceCheckUtils]: 16: Hoare triple {32#false} assume !true; {32#false} is VALID [2020-07-08 12:48:15,451 INFO L263 TraceCheckUtils]: 17: Hoare triple {32#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32#false} is VALID [2020-07-08 12:48:15,451 INFO L280 TraceCheckUtils]: 18: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2020-07-08 12:48:15,452 INFO L280 TraceCheckUtils]: 19: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2020-07-08 12:48:15,452 INFO L280 TraceCheckUtils]: 20: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-08 12:48:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:48:15,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660779437] [2020-07-08 12:48:15,458 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:15,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395282263] [2020-07-08 12:48:15,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:15,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:48:15,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587270646] [2020-07-08 12:48:15,473 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-07-08 12:48:15,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:15,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:48:15,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:15,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:48:15,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:48:15,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:48:15,549 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-07-08 12:48:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:15,699 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2020-07-08 12:48:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:48:15,700 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-07-08 12:48:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:48:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2020-07-08 12:48:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:48:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2020-07-08 12:48:15,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2020-07-08 12:48:15,905 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-08 12:48:15,922 INFO L225 Difference]: With dead ends: 50 [2020-07-08 12:48:15,922 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 12:48:15,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-08 12:48:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 12:48:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-08 12:48:16,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:16,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:16,042 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:16,043 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:16,068 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-08 12:48:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-08 12:48:16,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:16,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:16,071 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:16,073 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:16,082 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-08 12:48:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-08 12:48:16,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:16,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:16,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:16,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:48:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-08 12:48:16,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2020-07-08 12:48:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:16,112 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-08 12:48:16,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:48:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-08 12:48:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:48:16,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:16,116 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-08 12:48:16,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-08 12:48:16,333 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1193991140, now seen corresponding path program 1 times [2020-07-08 12:48:16,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:16,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419922754] [2020-07-08 12:48:16,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:16,344 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:16,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705002628] [2020-07-08 12:48:16,345 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:16,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-08 12:48:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:16,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:16,675 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:48:30,679 WARN L193 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-08 12:48:30,722 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:48:49,970 WARN L193 SmtUtils]: Spent 10.39 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-08 12:48:52,062 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:49:00,382 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~u~0_BEFORE_CALL_1 Int)) (and (not (= (+ (* 2 v_main_~u~0_BEFORE_CALL_1) (* 4 (let ((.cse0 (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2)))) (* .cse0 .cse0)))) (+ (* v_main_~u~0_BEFORE_CALL_1 v_main_~u~0_BEFORE_CALL_1) 1))) (= 0 (mod (+ v_main_~u~0_BEFORE_CALL_1 1) (- 2))))) is different from false [2020-07-08 12:49:02,419 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~u~0_BEFORE_CALL_1 Int)) (and (not (= (+ (* 2 v_main_~u~0_BEFORE_CALL_1) (* 4 (let ((.cse0 (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2)))) (* .cse0 .cse0)))) (+ (* v_main_~u~0_BEFORE_CALL_1 v_main_~u~0_BEFORE_CALL_1) 1))) (= 0 (mod (+ v_main_~u~0_BEFORE_CALL_1 1) (- 2))))) is different from true [2020-07-08 12:49:02,420 INFO L263 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2020-07-08 12:49:02,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-08 12:49:02,420 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {242#true} {242#true} #55#return; {242#true} is VALID [2020-07-08 12:49:02,421 INFO L263 TraceCheckUtils]: 3: Hoare triple {242#true} call #t~ret2 := main(); {242#true} is VALID [2020-07-08 12:49:02,421 INFO L280 TraceCheckUtils]: 4: Hoare triple {242#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {242#true} is VALID [2020-07-08 12:49:02,421 INFO L263 TraceCheckUtils]: 5: Hoare triple {242#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {242#true} is VALID [2020-07-08 12:49:02,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2020-07-08 12:49:02,421 INFO L280 TraceCheckUtils]: 7: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2020-07-08 12:49:02,422 INFO L280 TraceCheckUtils]: 8: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-08 12:49:02,422 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {242#true} {242#true} #59#return; {242#true} is VALID [2020-07-08 12:49:02,422 INFO L263 TraceCheckUtils]: 10: Hoare triple {242#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {242#true} is VALID [2020-07-08 12:49:02,422 INFO L280 TraceCheckUtils]: 11: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2020-07-08 12:49:02,423 INFO L280 TraceCheckUtils]: 12: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2020-07-08 12:49:02,423 INFO L280 TraceCheckUtils]: 13: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-08 12:49:02,423 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {242#true} {242#true} #61#return; {242#true} is VALID [2020-07-08 12:49:04,448 INFO L280 TraceCheckUtils]: 15: Hoare triple {242#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {292#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 12:49:04,449 INFO L280 TraceCheckUtils]: 16: Hoare triple {292#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {292#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:49:04,467 INFO L263 TraceCheckUtils]: 17: Hoare triple {292#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {299#(or (<= 1 |__VERIFIER_assert_#in~cond|) (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~u~0_BEFORE_CALL_1 Int)) (and (not (= (+ (* 2 v_main_~u~0_BEFORE_CALL_1) (* 4 (* (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2)) (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2))))) (+ (* v_main_~u~0_BEFORE_CALL_1 v_main_~u~0_BEFORE_CALL_1) 1))) (= 0 (mod (+ v_main_~u~0_BEFORE_CALL_1 1) (- 2)))))))} is VALID [2020-07-08 12:49:04,469 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#(or (<= 1 |__VERIFIER_assert_#in~cond|) (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~u~0_BEFORE_CALL_1 Int)) (and (not (= (+ (* 2 v_main_~u~0_BEFORE_CALL_1) (* 4 (* (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2)) (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2))))) (+ (* v_main_~u~0_BEFORE_CALL_1 v_main_~u~0_BEFORE_CALL_1) 1))) (= 0 (mod (+ v_main_~u~0_BEFORE_CALL_1 1) (- 2)))))))} ~cond := #in~cond; {303#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~u~0_BEFORE_CALL_1 Int)) (and (not (= (+ (* 2 v_main_~u~0_BEFORE_CALL_1) (* 4 (* (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2)) (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2))))) (+ (* v_main_~u~0_BEFORE_CALL_1 v_main_~u~0_BEFORE_CALL_1) 1))) (= 0 (mod (+ v_main_~u~0_BEFORE_CALL_1 1) (- 2)))))))} is VALID [2020-07-08 12:49:04,474 INFO L280 TraceCheckUtils]: 19: Hoare triple {303#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~u~0_BEFORE_CALL_1 Int)) (and (not (= (+ (* 2 v_main_~u~0_BEFORE_CALL_1) (* 4 (* (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2)) (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2))))) (+ (* v_main_~u~0_BEFORE_CALL_1 v_main_~u~0_BEFORE_CALL_1) 1))) (= 0 (mod (+ v_main_~u~0_BEFORE_CALL_1 1) (- 2)))))))} assume 0 == ~cond; {307#(exists ((v_main_~u~0_BEFORE_CALL_1 Int)) (and (not (= (+ (* 2 v_main_~u~0_BEFORE_CALL_1) (* 4 (* (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2)) (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2))))) (+ (* v_main_~u~0_BEFORE_CALL_1 v_main_~u~0_BEFORE_CALL_1) 1))) (= 0 (mod (+ v_main_~u~0_BEFORE_CALL_1 1) (- 2)))))} is VALID [2020-07-08 12:49:06,532 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#(exists ((v_main_~u~0_BEFORE_CALL_1 Int)) (and (not (= (+ (* 2 v_main_~u~0_BEFORE_CALL_1) (* 4 (* (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2)) (div (+ (* v_main_~u~0_BEFORE_CALL_1 (- 1)) 1) (- 2))))) (+ (* v_main_~u~0_BEFORE_CALL_1 v_main_~u~0_BEFORE_CALL_1) 1))) (= 0 (mod (+ v_main_~u~0_BEFORE_CALL_1 1) (- 2)))))} assume !false; {243#false} is UNKNOWN [2020-07-08 12:49:06,536 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-08 12:49:06,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419922754] [2020-07-08 12:49:06,536 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:49:06,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705002628] [2020-07-08 12:49:06,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:49:06,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:49:06,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111565063] [2020-07-08 12:49:06,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-08 12:49:06,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:49:06,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:49:12,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 15 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-08 12:49:12,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:49:12,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:49:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:49:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=13, Unknown=2, NotChecked=6, Total=30 [2020-07-08 12:49:12,827 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2020-07-08 12:50:20,695 WARN L193 SmtUtils]: Spent 33.54 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-08 12:51:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:16,663 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-08 12:51:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:51:16,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-08 12:51:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:51:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:51:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-08 12:51:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:51:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-08 12:51:16,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2020-07-08 12:51:23,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 35 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-08 12:51:23,263 INFO L225 Difference]: With dead ends: 32 [2020-07-08 12:51:23,264 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:51:23,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.0s TimeCoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2020-07-08 12:51:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:51:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-08 12:51:23,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:51:23,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-08 12:51:23,335 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-08 12:51:23,335 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-08 12:51:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:23,340 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-08 12:51:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-08 12:51:23,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:51:23,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:51:23,342 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-08 12:51:23,342 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-08 12:51:23,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:23,347 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-08 12:51:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-08 12:51:23,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:51:23,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:51:23,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:51:23,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:51:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:51:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-08 12:51:23,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2020-07-08 12:51:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:51:23,353 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-08 12:51:23,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:51:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-08 12:51:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:51:23,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:51:23,354 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-08 12:51:23,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:51:23,556 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:51:23,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:51:23,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1415100442, now seen corresponding path program 1 times [2020-07-08 12:51:23,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:51:23,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336322515] [2020-07-08 12:51:23,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:51:23,564 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:51:23,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298795606] [2020-07-08 12:51:23,565 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-08 12:51:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:51:23,594 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-08 12:51:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:51:23,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:51:25,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:51:26,484 INFO L263 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2020-07-08 12:51:26,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {460#true} assume true; {460#true} is VALID [2020-07-08 12:51:26,485 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} #55#return; {460#true} is VALID [2020-07-08 12:51:26,485 INFO L263 TraceCheckUtils]: 3: Hoare triple {460#true} call #t~ret2 := main(); {460#true} is VALID [2020-07-08 12:51:26,485 INFO L280 TraceCheckUtils]: 4: Hoare triple {460#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {460#true} is VALID [2020-07-08 12:51:26,486 INFO L263 TraceCheckUtils]: 5: Hoare triple {460#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {460#true} is VALID [2020-07-08 12:51:26,486 INFO L280 TraceCheckUtils]: 6: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2020-07-08 12:51:26,487 INFO L280 TraceCheckUtils]: 7: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2020-07-08 12:51:26,487 INFO L280 TraceCheckUtils]: 8: Hoare triple {460#true} assume true; {460#true} is VALID [2020-07-08 12:51:26,488 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {460#true} {460#true} #59#return; {460#true} is VALID [2020-07-08 12:51:26,488 INFO L263 TraceCheckUtils]: 10: Hoare triple {460#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {460#true} is VALID [2020-07-08 12:51:26,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2020-07-08 12:51:26,489 INFO L280 TraceCheckUtils]: 12: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2020-07-08 12:51:26,489 INFO L280 TraceCheckUtils]: 13: Hoare triple {460#true} assume true; {460#true} is VALID [2020-07-08 12:51:26,490 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {460#true} {460#true} #61#return; {460#true} is VALID [2020-07-08 12:51:26,490 INFO L280 TraceCheckUtils]: 15: Hoare triple {460#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {460#true} is VALID [2020-07-08 12:51:26,491 INFO L280 TraceCheckUtils]: 16: Hoare triple {460#true} assume !false; {460#true} is VALID [2020-07-08 12:51:26,491 INFO L263 TraceCheckUtils]: 17: Hoare triple {460#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {460#true} is VALID [2020-07-08 12:51:26,503 INFO L280 TraceCheckUtils]: 18: Hoare triple {460#true} ~cond := #in~cond; {519#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:51:26,508 INFO L280 TraceCheckUtils]: 19: Hoare triple {519#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {523#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:51:26,512 INFO L280 TraceCheckUtils]: 20: Hoare triple {523#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {523#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:51:26,517 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {523#(not (= 0 |__VERIFIER_assert_#in~cond|))} {460#true} #63#return; {530#(= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)))} is VALID [2020-07-08 12:51:26,522 INFO L280 TraceCheckUtils]: 22: Hoare triple {530#(= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)))} assume !(0 != ~r~0); {534#(= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~A~0)))} is VALID [2020-07-08 12:51:26,526 INFO L263 TraceCheckUtils]: 23: Hoare triple {534#(= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~A~0)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {538#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:51:26,528 INFO L280 TraceCheckUtils]: 24: Hoare triple {538#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {542#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:51:26,532 INFO L280 TraceCheckUtils]: 25: Hoare triple {542#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {461#false} is VALID [2020-07-08 12:51:26,533 INFO L280 TraceCheckUtils]: 26: Hoare triple {461#false} assume !false; {461#false} is VALID [2020-07-08 12:51:26,535 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-08 12:51:26,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336322515] [2020-07-08 12:51:26,537 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:51:26,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298795606] [2020-07-08 12:51:26,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:51:26,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 12:51:26,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028230526] [2020-07-08 12:51:26,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-08 12:51:26,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:51:26,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:51:26,822 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-08 12:51:26,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:51:26,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:51:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:51:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:51:26,825 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 8 states. [2020-07-08 12:51:33,577 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-07-08 12:51:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:43,569 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-08 12:51:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:51:43,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-08 12:51:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:51:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:51:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-08 12:51:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:51:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-08 12:51:43,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2020-07-08 12:51:43,787 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-08 12:51:43,789 INFO L225 Difference]: With dead ends: 33 [2020-07-08 12:51:43,789 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 12:51:43,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:51:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 12:51:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-08 12:51:43,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:51:43,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-08 12:51:43,851 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-08 12:51:43,851 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-08 12:51:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:43,855 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-08 12:51:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-08 12:51:43,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:51:43,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:51:43,857 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-08 12:51:43,857 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-08 12:51:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:43,860 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-08 12:51:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-08 12:51:43,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:51:43,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:51:43,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:51:43,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:51:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 12:51:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-07-08 12:51:43,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 27 [2020-07-08 12:51:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:51:43,864 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-07-08 12:51:43,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:51:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-08 12:51:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:51:43,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:51:43,866 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-08 12:51:44,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:51:44,072 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:51:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:51:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1831429119, now seen corresponding path program 1 times [2020-07-08 12:51:44,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:51:44,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185730787] [2020-07-08 12:51:44,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:51:44,077 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:51:44,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366672682] [2020-07-08 12:51:44,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-08 12:51:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:51:44,102 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-08 12:51:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:51:44,136 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:51:46,916 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-07-08 12:51:47,448 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:51:50,249 INFO L263 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2020-07-08 12:51:50,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {693#true} assume true; {693#true} is VALID [2020-07-08 12:51:50,250 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {693#true} {693#true} #55#return; {693#true} is VALID [2020-07-08 12:51:50,250 INFO L263 TraceCheckUtils]: 3: Hoare triple {693#true} call #t~ret2 := main(); {693#true} is VALID [2020-07-08 12:51:50,250 INFO L280 TraceCheckUtils]: 4: Hoare triple {693#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {693#true} is VALID [2020-07-08 12:51:50,250 INFO L263 TraceCheckUtils]: 5: Hoare triple {693#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {693#true} is VALID [2020-07-08 12:51:50,250 INFO L280 TraceCheckUtils]: 6: Hoare triple {693#true} ~cond := #in~cond; {693#true} is VALID [2020-07-08 12:51:50,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {693#true} assume !(0 == ~cond); {693#true} is VALID [2020-07-08 12:51:50,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {693#true} assume true; {693#true} is VALID [2020-07-08 12:51:50,251 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {693#true} {693#true} #59#return; {693#true} is VALID [2020-07-08 12:51:50,252 INFO L263 TraceCheckUtils]: 10: Hoare triple {693#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {693#true} is VALID [2020-07-08 12:51:50,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {693#true} ~cond := #in~cond; {693#true} is VALID [2020-07-08 12:51:50,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {693#true} assume !(0 == ~cond); {693#true} is VALID [2020-07-08 12:51:50,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {693#true} assume true; {693#true} is VALID [2020-07-08 12:51:50,253 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {693#true} {693#true} #61#return; {693#true} is VALID [2020-07-08 12:51:50,260 INFO L280 TraceCheckUtils]: 15: Hoare triple {693#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {743#(= 1 main_~v~0)} is VALID [2020-07-08 12:51:50,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {743#(= 1 main_~v~0)} assume !false; {743#(= 1 main_~v~0)} is VALID [2020-07-08 12:51:50,264 INFO L263 TraceCheckUtils]: 17: Hoare triple {743#(= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {693#true} is VALID [2020-07-08 12:51:50,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {693#true} ~cond := #in~cond; {753#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:51:50,269 INFO L280 TraceCheckUtils]: 19: Hoare triple {753#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {757#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:51:50,273 INFO L280 TraceCheckUtils]: 20: Hoare triple {757#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {757#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:51:50,282 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {757#(not (= 0 |__VERIFIER_assert_#in~cond|))} {743#(= 1 main_~v~0)} #63#return; {764#(and (= 1 main_~v~0) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))))} is VALID [2020-07-08 12:51:50,286 INFO L280 TraceCheckUtils]: 22: Hoare triple {764#(and (= 1 main_~v~0) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))))} assume !!(0 != ~r~0); {764#(and (= 1 main_~v~0) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))))} is VALID [2020-07-08 12:51:50,313 INFO L280 TraceCheckUtils]: 23: Hoare triple {764#(and (= 1 main_~v~0) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))))} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {771#(and (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= 3 main_~v~0))} is VALID [2020-07-08 12:51:50,315 INFO L280 TraceCheckUtils]: 24: Hoare triple {771#(and (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= 3 main_~v~0))} assume !false; {771#(and (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= 3 main_~v~0))} is VALID [2020-07-08 12:51:50,318 INFO L263 TraceCheckUtils]: 25: Hoare triple {771#(and (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= 3 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:51:50,322 INFO L280 TraceCheckUtils]: 26: Hoare triple {778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:51:50,324 INFO L280 TraceCheckUtils]: 27: Hoare triple {782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {694#false} is VALID [2020-07-08 12:51:50,325 INFO L280 TraceCheckUtils]: 28: Hoare triple {694#false} assume !false; {694#false} is VALID [2020-07-08 12:51:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:51:50,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185730787] [2020-07-08 12:51:50,329 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:51:50,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366672682] [2020-07-08 12:51:50,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:51:50,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 12:51:50,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214018843] [2020-07-08 12:51:50,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-08 12:51:50,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:51:50,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:51:50,581 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-08 12:51:50,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:51:50,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:51:50,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:51:50,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2020-07-08 12:51:50,583 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 9 states. [2020-07-08 12:52:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:52:15,767 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-08 12:52:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:52:15,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-08 12:52:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:52:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:52:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-08 12:52:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:52:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-08 12:52:15,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2020-07-08 12:52:18,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-08 12:52:18,267 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:52:18,267 INFO L226 Difference]: Without dead ends: 38 [2020-07-08 12:52:18,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2020-07-08 12:52:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-08 12:52:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-08 12:52:18,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:52:18,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-08 12:52:18,335 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-08 12:52:18,336 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-08 12:52:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:52:18,340 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-08 12:52:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2020-07-08 12:52:18,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:52:18,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:52:18,341 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-08 12:52:18,341 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-08 12:52:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:52:18,344 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-08 12:52:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2020-07-08 12:52:18,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:52:18,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:52:18,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:52:18,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:52:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:52:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-08 12:52:18,349 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2020-07-08 12:52:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:52:18,349 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-08 12:52:18,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:52:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:52:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:52:18,351 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:52:18,351 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-08 12:52:18,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:52:18,565 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:52:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:52:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1774170817, now seen corresponding path program 1 times [2020-07-08 12:52:18,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:52:18,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421852924] [2020-07-08 12:52:18,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:52:18,571 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:52:18,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544379796] [2020-07-08 12:52:18,572 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-08 12:52:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:52:18,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-08 12:52:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:52:20,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:52:20,955 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-07-08 12:52:31,650 WARN L193 SmtUtils]: Spent 8.40 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-08 12:52:48,466 WARN L193 SmtUtils]: Spent 8.36 s on a formula simplification that was a NOOP. DAG size: 32 [2020-07-08 12:52:48,604 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:52:48,980 INFO L263 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2020-07-08 12:52:48,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {980#true} assume true; {980#true} is VALID [2020-07-08 12:52:48,981 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {980#true} {980#true} #55#return; {980#true} is VALID [2020-07-08 12:52:48,981 INFO L263 TraceCheckUtils]: 3: Hoare triple {980#true} call #t~ret2 := main(); {980#true} is VALID [2020-07-08 12:52:48,982 INFO L280 TraceCheckUtils]: 4: Hoare triple {980#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {980#true} is VALID [2020-07-08 12:52:48,982 INFO L263 TraceCheckUtils]: 5: Hoare triple {980#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {980#true} is VALID [2020-07-08 12:52:48,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {980#true} ~cond := #in~cond; {980#true} is VALID [2020-07-08 12:52:48,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {980#true} assume !(0 == ~cond); {980#true} is VALID [2020-07-08 12:52:48,983 INFO L280 TraceCheckUtils]: 8: Hoare triple {980#true} assume true; {980#true} is VALID [2020-07-08 12:52:48,983 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {980#true} {980#true} #59#return; {980#true} is VALID [2020-07-08 12:52:48,983 INFO L263 TraceCheckUtils]: 10: Hoare triple {980#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {980#true} is VALID [2020-07-08 12:52:48,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {980#true} ~cond := #in~cond; {980#true} is VALID [2020-07-08 12:52:48,984 INFO L280 TraceCheckUtils]: 12: Hoare triple {980#true} assume !(0 == ~cond); {980#true} is VALID [2020-07-08 12:52:48,984 INFO L280 TraceCheckUtils]: 13: Hoare triple {980#true} assume true; {980#true} is VALID [2020-07-08 12:52:48,984 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {980#true} {980#true} #61#return; {980#true} is VALID [2020-07-08 12:52:51,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {980#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1030#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 12:52:51,052 INFO L280 TraceCheckUtils]: 16: Hoare triple {1030#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {1030#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:52:51,052 INFO L263 TraceCheckUtils]: 17: Hoare triple {1030#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {980#true} is VALID [2020-07-08 12:52:51,054 INFO L280 TraceCheckUtils]: 18: Hoare triple {980#true} ~cond := #in~cond; {1040#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:52:51,056 INFO L280 TraceCheckUtils]: 19: Hoare triple {1040#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1044#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:52:51,058 INFO L280 TraceCheckUtils]: 20: Hoare triple {1044#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1044#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:52:51,061 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1044#(not (= 0 |__VERIFIER_assert_#in~cond|))} {1030#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} #63#return; {1051#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:52:51,064 INFO L280 TraceCheckUtils]: 22: Hoare triple {1051#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !!(0 != ~r~0); {1051#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:52:53,138 INFO L280 TraceCheckUtils]: 23: Hoare triple {1051#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !(~r~0 > 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {1058#(and (= 1 main_~v~0) (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2)))) (+ main_~r~0 main_~A~0 2)) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 12:52:53,141 INFO L280 TraceCheckUtils]: 24: Hoare triple {1058#(and (= 1 main_~v~0) (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2)))) (+ main_~r~0 main_~A~0 2)) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {1058#(and (= 1 main_~v~0) (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2)))) (+ main_~r~0 main_~A~0 2)) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:52:53,143 INFO L263 TraceCheckUtils]: 25: Hoare triple {1058#(and (= 1 main_~v~0) (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2)))) (+ main_~r~0 main_~A~0 2)) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:52:53,146 INFO L280 TraceCheckUtils]: 26: Hoare triple {1065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:52:53,148 INFO L280 TraceCheckUtils]: 27: Hoare triple {1069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {981#false} is VALID [2020-07-08 12:52:53,148 INFO L280 TraceCheckUtils]: 28: Hoare triple {981#false} assume !false; {981#false} is VALID [2020-07-08 12:52:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:52:53,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421852924] [2020-07-08 12:52:53,151 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:52:53,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544379796] [2020-07-08 12:52:53,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:52:53,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 12:52:53,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265659331] [2020-07-08 12:52:53,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-08 12:52:53,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:52:53,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:52:57,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-08 12:52:57,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:52:57,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:52:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:52:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=50, Unknown=5, NotChecked=0, Total=72 [2020-07-08 12:52:57,467 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 9 states. [2020-07-08 12:53:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:53:54,399 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-08 12:53:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:53:54,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-08 12:53:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:53:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:53:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-08 12:53:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:53:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-08 12:53:54,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2020-07-08 12:53:59,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-08 12:53:59,073 INFO L225 Difference]: With dead ends: 48 [2020-07-08 12:53:59,073 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 12:53:59,074 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=28, Invalid=77, Unknown=5, NotChecked=0, Total=110 [2020-07-08 12:53:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 12:53:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-08 12:53:59,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:53:59,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-08 12:53:59,171 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-08 12:53:59,171 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-08 12:53:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:53:59,174 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-08 12:53:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-08 12:53:59,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:53:59,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:53:59,177 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-08 12:53:59,177 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-08 12:53:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:53:59,181 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-08 12:53:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-08 12:53:59,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:53:59,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:53:59,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:53:59,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:53:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 12:53:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2020-07-08 12:53:59,185 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 29 [2020-07-08 12:53:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:53:59,186 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2020-07-08 12:53:59,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:53:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-08 12:53:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:53:59,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:53:59,187 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-08 12:53:59,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:53:59,401 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:53:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:53:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1286102758, now seen corresponding path program 2 times [2020-07-08 12:53:59,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:53:59,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963051073] [2020-07-08 12:53:59,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:53:59,407 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:53:59,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008795414] [2020-07-08 12:53:59,408 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 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-08 12:53:59,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:53:59,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:53:59,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-08 12:53:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:53:59,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:54:00,001 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-07-08 12:54:00,649 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-07-08 12:54:02,726 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-07-08 12:54:05,231 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:54:06,032 INFO L263 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2020-07-08 12:54:06,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {1305#true} assume true; {1305#true} is VALID [2020-07-08 12:54:06,033 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1305#true} {1305#true} #55#return; {1305#true} is VALID [2020-07-08 12:54:06,033 INFO L263 TraceCheckUtils]: 3: Hoare triple {1305#true} call #t~ret2 := main(); {1305#true} is VALID [2020-07-08 12:54:06,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {1305#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {1305#true} is VALID [2020-07-08 12:54:06,034 INFO L263 TraceCheckUtils]: 5: Hoare triple {1305#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1305#true} is VALID [2020-07-08 12:54:06,034 INFO L280 TraceCheckUtils]: 6: Hoare triple {1305#true} ~cond := #in~cond; {1305#true} is VALID [2020-07-08 12:54:06,034 INFO L280 TraceCheckUtils]: 7: Hoare triple {1305#true} assume !(0 == ~cond); {1305#true} is VALID [2020-07-08 12:54:06,034 INFO L280 TraceCheckUtils]: 8: Hoare triple {1305#true} assume true; {1305#true} is VALID [2020-07-08 12:54:06,035 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1305#true} {1305#true} #59#return; {1305#true} is VALID [2020-07-08 12:54:06,035 INFO L263 TraceCheckUtils]: 10: Hoare triple {1305#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1305#true} is VALID [2020-07-08 12:54:06,035 INFO L280 TraceCheckUtils]: 11: Hoare triple {1305#true} ~cond := #in~cond; {1305#true} is VALID [2020-07-08 12:54:06,035 INFO L280 TraceCheckUtils]: 12: Hoare triple {1305#true} assume !(0 == ~cond); {1305#true} is VALID [2020-07-08 12:54:06,036 INFO L280 TraceCheckUtils]: 13: Hoare triple {1305#true} assume true; {1305#true} is VALID [2020-07-08 12:54:06,036 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1305#true} {1305#true} #61#return; {1305#true} is VALID [2020-07-08 12:54:06,038 INFO L280 TraceCheckUtils]: 15: Hoare triple {1305#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1355#(= 1 main_~v~0)} is VALID [2020-07-08 12:54:06,040 INFO L280 TraceCheckUtils]: 16: Hoare triple {1355#(= 1 main_~v~0)} assume !false; {1355#(= 1 main_~v~0)} is VALID [2020-07-08 12:54:06,040 INFO L263 TraceCheckUtils]: 17: Hoare triple {1355#(= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1305#true} is VALID [2020-07-08 12:54:06,042 INFO L280 TraceCheckUtils]: 18: Hoare triple {1305#true} ~cond := #in~cond; {1365#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:54:06,044 INFO L280 TraceCheckUtils]: 19: Hoare triple {1365#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1369#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:54:06,046 INFO L280 TraceCheckUtils]: 20: Hoare triple {1369#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1369#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:54:06,048 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1369#(not (= 0 |__VERIFIER_assert_#in~cond|))} {1355#(= 1 main_~v~0)} #63#return; {1376#(and (= 1 main_~v~0) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))))} is VALID [2020-07-08 12:54:06,051 INFO L280 TraceCheckUtils]: 22: Hoare triple {1376#(and (= 1 main_~v~0) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))))} assume !!(0 != ~r~0); {1376#(and (= 1 main_~v~0) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))))} is VALID [2020-07-08 12:54:06,094 INFO L280 TraceCheckUtils]: 23: Hoare triple {1376#(and (= 1 main_~v~0) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))))} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} is VALID [2020-07-08 12:54:06,096 INFO L280 TraceCheckUtils]: 24: Hoare triple {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} assume !false; {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} is VALID [2020-07-08 12:54:06,097 INFO L263 TraceCheckUtils]: 25: Hoare triple {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1305#true} is VALID [2020-07-08 12:54:06,099 INFO L280 TraceCheckUtils]: 26: Hoare triple {1305#true} ~cond := #in~cond; {1365#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:54:06,101 INFO L280 TraceCheckUtils]: 27: Hoare triple {1365#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1369#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:54:06,103 INFO L280 TraceCheckUtils]: 28: Hoare triple {1369#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1369#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:54:06,105 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1369#(not (= 0 |__VERIFIER_assert_#in~cond|))} {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} #63#return; {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} is VALID [2020-07-08 12:54:06,107 INFO L280 TraceCheckUtils]: 30: Hoare triple {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} assume !!(0 != ~r~0); {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} is VALID [2020-07-08 12:54:06,163 INFO L280 TraceCheckUtils]: 31: Hoare triple {1383#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= 3 main_~v~0))} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1408#(and (= (+ (* main_~u~0 main_~u~0) 5) (+ (* 2 main_~u~0) (* 4 main_~v~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 5 main_~v~0))} is VALID [2020-07-08 12:54:06,165 INFO L280 TraceCheckUtils]: 32: Hoare triple {1408#(and (= (+ (* main_~u~0 main_~u~0) 5) (+ (* 2 main_~u~0) (* 4 main_~v~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 5 main_~v~0))} assume !false; {1408#(and (= (+ (* main_~u~0 main_~u~0) 5) (+ (* 2 main_~u~0) (* 4 main_~v~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 5 main_~v~0))} is VALID [2020-07-08 12:54:06,168 INFO L263 TraceCheckUtils]: 33: Hoare triple {1408#(and (= (+ (* main_~u~0 main_~u~0) 5) (+ (* 2 main_~u~0) (* 4 main_~v~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 5 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:54:06,170 INFO L280 TraceCheckUtils]: 34: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:54:06,172 INFO L280 TraceCheckUtils]: 35: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1306#false} is VALID [2020-07-08 12:54:06,173 INFO L280 TraceCheckUtils]: 36: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2020-07-08 12:54:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-08 12:54:06,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963051073] [2020-07-08 12:54:06,176 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:54:06,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008795414] [2020-07-08 12:54:06,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:54:06,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 12:54:06,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405270721] [2020-07-08 12:54:06,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-08 12:54:06,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:54:06,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:54:06,662 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-08 12:54:06,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:54:06,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:54:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:54:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:54:06,664 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 10 states. [2020-07-08 12:55:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:55:13,988 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-08 12:55:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:55:13,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-08 12:55:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:55:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:55:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-08 12:55:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:55:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-08 12:55:13,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2020-07-08 12:55:14,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:55:14,866 INFO L225 Difference]: With dead ends: 56 [2020-07-08 12:55:14,867 INFO L226 Difference]: Without dead ends: 54 [2020-07-08 12:55:14,867 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:55:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-08 12:55:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-07-08 12:55:14,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:55:14,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2020-07-08 12:55:14,999 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2020-07-08 12:55:14,999 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2020-07-08 12:55:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:55:15,003 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-08 12:55:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-08 12:55:15,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:55:15,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:55:15,004 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2020-07-08 12:55:15,005 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2020-07-08 12:55:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:55:15,008 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-08 12:55:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-08 12:55:15,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:55:15,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:55:15,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:55:15,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:55:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 12:55:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-07-08 12:55:15,012 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 37 [2020-07-08 12:55:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:55:15,012 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-08 12:55:15,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:55:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-08 12:55:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:55:15,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:55:15,013 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-08 12:55:15,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:55:15,224 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:55:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:55:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1343361060, now seen corresponding path program 1 times [2020-07-08 12:55:15,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:55:15,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323437389] [2020-07-08 12:55:15,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:55:15,231 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:55:15,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124547201] [2020-07-08 12:55:15,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:55:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:55:15,262 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:55:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:55:15,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:55:15,543 INFO L263 TraceCheckUtils]: 0: Hoare triple {1693#true} call ULTIMATE.init(); {1693#true} is VALID [2020-07-08 12:55:15,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-08 12:55:15,544 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1693#true} {1693#true} #55#return; {1693#true} is VALID [2020-07-08 12:55:15,544 INFO L263 TraceCheckUtils]: 3: Hoare triple {1693#true} call #t~ret2 := main(); {1693#true} is VALID [2020-07-08 12:55:15,544 INFO L280 TraceCheckUtils]: 4: Hoare triple {1693#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {1693#true} is VALID [2020-07-08 12:55:15,544 INFO L263 TraceCheckUtils]: 5: Hoare triple {1693#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1693#true} is VALID [2020-07-08 12:55:15,545 INFO L280 TraceCheckUtils]: 6: Hoare triple {1693#true} ~cond := #in~cond; {1693#true} is VALID [2020-07-08 12:55:15,545 INFO L280 TraceCheckUtils]: 7: Hoare triple {1693#true} assume !(0 == ~cond); {1693#true} is VALID [2020-07-08 12:55:15,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-08 12:55:15,545 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1693#true} {1693#true} #59#return; {1693#true} is VALID [2020-07-08 12:55:15,545 INFO L263 TraceCheckUtils]: 10: Hoare triple {1693#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1693#true} is VALID [2020-07-08 12:55:15,545 INFO L280 TraceCheckUtils]: 11: Hoare triple {1693#true} ~cond := #in~cond; {1693#true} is VALID [2020-07-08 12:55:15,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {1693#true} assume !(0 == ~cond); {1693#true} is VALID [2020-07-08 12:55:15,546 INFO L280 TraceCheckUtils]: 13: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-08 12:55:15,546 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1693#true} {1693#true} #61#return; {1693#true} is VALID [2020-07-08 12:55:15,548 INFO L280 TraceCheckUtils]: 15: Hoare triple {1693#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1743#(<= main_~v~0 1)} is VALID [2020-07-08 12:55:15,550 INFO L280 TraceCheckUtils]: 16: Hoare triple {1743#(<= main_~v~0 1)} assume !false; {1743#(<= main_~v~0 1)} is VALID [2020-07-08 12:55:15,550 INFO L263 TraceCheckUtils]: 17: Hoare triple {1743#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1693#true} is VALID [2020-07-08 12:55:15,550 INFO L280 TraceCheckUtils]: 18: Hoare triple {1693#true} ~cond := #in~cond; {1693#true} is VALID [2020-07-08 12:55:15,550 INFO L280 TraceCheckUtils]: 19: Hoare triple {1693#true} assume !(0 == ~cond); {1693#true} is VALID [2020-07-08 12:55:15,551 INFO L280 TraceCheckUtils]: 20: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-08 12:55:15,552 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1693#true} {1743#(<= main_~v~0 1)} #63#return; {1743#(<= main_~v~0 1)} is VALID [2020-07-08 12:55:15,554 INFO L280 TraceCheckUtils]: 22: Hoare triple {1743#(<= main_~v~0 1)} assume !!(0 != ~r~0); {1743#(<= main_~v~0 1)} is VALID [2020-07-08 12:55:15,572 INFO L280 TraceCheckUtils]: 23: Hoare triple {1743#(<= main_~v~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1768#(<= 0 main_~r~0)} is VALID [2020-07-08 12:55:15,573 INFO L280 TraceCheckUtils]: 24: Hoare triple {1768#(<= 0 main_~r~0)} assume !false; {1768#(<= 0 main_~r~0)} is VALID [2020-07-08 12:55:15,574 INFO L263 TraceCheckUtils]: 25: Hoare triple {1768#(<= 0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1693#true} is VALID [2020-07-08 12:55:15,574 INFO L280 TraceCheckUtils]: 26: Hoare triple {1693#true} ~cond := #in~cond; {1693#true} is VALID [2020-07-08 12:55:15,574 INFO L280 TraceCheckUtils]: 27: Hoare triple {1693#true} assume !(0 == ~cond); {1693#true} is VALID [2020-07-08 12:55:15,574 INFO L280 TraceCheckUtils]: 28: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-08 12:55:15,576 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1693#true} {1768#(<= 0 main_~r~0)} #63#return; {1768#(<= 0 main_~r~0)} is VALID [2020-07-08 12:55:15,578 INFO L280 TraceCheckUtils]: 30: Hoare triple {1768#(<= 0 main_~r~0)} assume !!(0 != ~r~0); {1790#(and (not (= 0 main_~r~0)) (<= 0 main_~r~0))} is VALID [2020-07-08 12:55:15,595 INFO L280 TraceCheckUtils]: 31: Hoare triple {1790#(and (not (= 0 main_~r~0)) (<= 0 main_~r~0))} assume !(~r~0 > 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {1694#false} is VALID [2020-07-08 12:55:15,596 INFO L280 TraceCheckUtils]: 32: Hoare triple {1694#false} assume !false; {1694#false} is VALID [2020-07-08 12:55:15,596 INFO L263 TraceCheckUtils]: 33: Hoare triple {1694#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1694#false} is VALID [2020-07-08 12:55:15,596 INFO L280 TraceCheckUtils]: 34: Hoare triple {1694#false} ~cond := #in~cond; {1694#false} is VALID [2020-07-08 12:55:15,596 INFO L280 TraceCheckUtils]: 35: Hoare triple {1694#false} assume 0 == ~cond; {1694#false} is VALID [2020-07-08 12:55:15,597 INFO L280 TraceCheckUtils]: 36: Hoare triple {1694#false} assume !false; {1694#false} is VALID [2020-07-08 12:55:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-08 12:55:15,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323437389] [2020-07-08 12:55:15,599 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:55:15,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124547201] [2020-07-08 12:55:15,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:55:15,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 12:55:15,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525211641] [2020-07-08 12:55:15,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-08 12:55:15,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:55:15,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:55:15,825 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-08 12:55:15,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:55:15,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:55:15,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:55:15,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:55:15,826 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 5 states. [2020-07-08 12:55:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:55:16,710 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-08 12:55:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:55:16,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-08 12:55:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:55:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:55:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-08 12:55:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:55:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-08 12:55:16,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2020-07-08 12:55:17,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:55:17,111 INFO L225 Difference]: With dead ends: 62 [2020-07-08 12:55:17,111 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 12:55:17,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:55:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 12:55:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-08 12:55:17,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:55:17,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-08 12:55:17,233 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-08 12:55:17,233 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-08 12:55:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:55:17,236 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-08 12:55:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-08 12:55:17,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:55:17,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:55:17,237 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-08 12:55:17,237 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-08 12:55:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:55:17,240 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-08 12:55:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-08 12:55:17,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:55:17,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:55:17,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:55:17,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:55:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 12:55:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-07-08 12:55:17,248 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 37 [2020-07-08 12:55:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:55:17,249 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-07-08 12:55:17,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:55:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-08 12:55:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:55:17,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:55:17,252 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-08 12:55:17,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:55:17,463 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:55:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:55:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash 332243810, now seen corresponding path program 2 times [2020-07-08 12:55:17,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:55:17,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257530895] [2020-07-08 12:55:17,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:55:17,474 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:55:17,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134318268] [2020-07-08 12:55:17,475 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:55:17,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:55:17,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:55:17,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-08 12:55:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:55:19,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:55:19,879 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-07-08 12:55:30,758 WARN L193 SmtUtils]: Spent 8.50 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-08 12:55:46,063 WARN L193 SmtUtils]: Spent 6.55 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-08 12:56:14,212 WARN L193 SmtUtils]: Spent 6.51 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 12:56:14,405 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:56:15,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2020-07-08 12:56:15,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {2077#true} assume true; {2077#true} is VALID [2020-07-08 12:56:15,315 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2077#true} {2077#true} #55#return; {2077#true} is VALID [2020-07-08 12:56:15,315 INFO L263 TraceCheckUtils]: 3: Hoare triple {2077#true} call #t~ret2 := main(); {2077#true} is VALID [2020-07-08 12:56:15,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {2077#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {2077#true} is VALID [2020-07-08 12:56:15,315 INFO L263 TraceCheckUtils]: 5: Hoare triple {2077#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2077#true} is VALID [2020-07-08 12:56:15,316 INFO L280 TraceCheckUtils]: 6: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2020-07-08 12:56:15,316 INFO L280 TraceCheckUtils]: 7: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2020-07-08 12:56:15,316 INFO L280 TraceCheckUtils]: 8: Hoare triple {2077#true} assume true; {2077#true} is VALID [2020-07-08 12:56:15,317 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2077#true} {2077#true} #59#return; {2077#true} is VALID [2020-07-08 12:56:15,317 INFO L263 TraceCheckUtils]: 10: Hoare triple {2077#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2077#true} is VALID [2020-07-08 12:56:15,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2020-07-08 12:56:15,317 INFO L280 TraceCheckUtils]: 12: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2020-07-08 12:56:15,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {2077#true} assume true; {2077#true} is VALID [2020-07-08 12:56:15,318 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2077#true} {2077#true} #61#return; {2077#true} is VALID [2020-07-08 12:56:17,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {2077#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2127#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 12:56:17,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {2127#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {2127#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:56:17,412 INFO L263 TraceCheckUtils]: 17: Hoare triple {2127#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2077#true} is VALID [2020-07-08 12:56:17,414 INFO L280 TraceCheckUtils]: 18: Hoare triple {2077#true} ~cond := #in~cond; {2137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:56:17,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {2137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2141#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:56:17,418 INFO L280 TraceCheckUtils]: 20: Hoare triple {2141#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {2141#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:56:17,421 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2141#(not (= 0 |__VERIFIER_assert_#in~cond|))} {2127#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} #63#return; {2148#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:56:17,423 INFO L280 TraceCheckUtils]: 22: Hoare triple {2148#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !!(0 != ~r~0); {2148#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:56:19,473 INFO L280 TraceCheckUtils]: 23: Hoare triple {2148#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !(~r~0 > 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 12:56:19,475 INFO L280 TraceCheckUtils]: 24: Hoare triple {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:56:19,476 INFO L263 TraceCheckUtils]: 25: Hoare triple {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2077#true} is VALID [2020-07-08 12:56:19,478 INFO L280 TraceCheckUtils]: 26: Hoare triple {2077#true} ~cond := #in~cond; {2137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:56:19,480 INFO L280 TraceCheckUtils]: 27: Hoare triple {2137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2141#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:56:19,482 INFO L280 TraceCheckUtils]: 28: Hoare triple {2141#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {2141#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:56:19,484 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2141#(not (= 0 |__VERIFIER_assert_#in~cond|))} {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} #63#return; {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:56:19,487 INFO L280 TraceCheckUtils]: 30: Hoare triple {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !!(0 != ~r~0); {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:56:21,566 INFO L280 TraceCheckUtils]: 31: Hoare triple {2155#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0 2) (+ main_~u~0 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (= (+ (* main_~v~0 main_~v~0) (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2))))) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 8)) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !(~r~0 > 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {2180#(and (= 1 main_~v~0) (= (+ (* 2 main_~u~0) (* (div (+ (* main_~u~0 (- 1)) 5) (- 2)) (div (+ (* main_~u~0 (- 1)) 5) (- 2)))) (+ main_~r~0 main_~A~0 6)) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 24) (+ (* main_~v~0 main_~v~0) (* 10 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 5) (- 2)) (div (+ (* main_~u~0 (- 1)) 5) (- 2)))))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 12:56:21,568 INFO L280 TraceCheckUtils]: 32: Hoare triple {2180#(and (= 1 main_~v~0) (= (+ (* 2 main_~u~0) (* (div (+ (* main_~u~0 (- 1)) 5) (- 2)) (div (+ (* main_~u~0 (- 1)) 5) (- 2)))) (+ main_~r~0 main_~A~0 6)) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 24) (+ (* main_~v~0 main_~v~0) (* 10 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 5) (- 2)) (div (+ (* main_~u~0 (- 1)) 5) (- 2)))))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {2180#(and (= 1 main_~v~0) (= (+ (* 2 main_~u~0) (* (div (+ (* main_~u~0 (- 1)) 5) (- 2)) (div (+ (* main_~u~0 (- 1)) 5) (- 2)))) (+ main_~r~0 main_~A~0 6)) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 24) (+ (* main_~v~0 main_~v~0) (* 10 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 5) (- 2)) (div (+ (* main_~u~0 (- 1)) 5) (- 2)))))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:56:21,621 INFO L263 TraceCheckUtils]: 33: Hoare triple {2180#(and (= 1 main_~v~0) (= (+ (* 2 main_~u~0) (* (div (+ (* main_~u~0 (- 1)) 5) (- 2)) (div (+ (* main_~u~0 (- 1)) 5) (- 2)))) (+ main_~r~0 main_~A~0 6)) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0) 24) (+ (* main_~v~0 main_~v~0) (* 10 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 5) (- 2)) (div (+ (* main_~u~0 (- 1)) 5) (- 2)))))) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2187#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:56:21,623 INFO L280 TraceCheckUtils]: 34: Hoare triple {2187#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2191#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:56:21,625 INFO L280 TraceCheckUtils]: 35: Hoare triple {2191#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2078#false} is VALID [2020-07-08 12:56:21,626 INFO L280 TraceCheckUtils]: 36: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2020-07-08 12:56:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 2 refuted. 8 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-08 12:56:21,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257530895] [2020-07-08 12:56:21,631 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:56:21,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134318268] [2020-07-08 12:56:21,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:56:21,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 12:56:21,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035040779] [2020-07-08 12:56:21,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-08 12:56:21,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:56:21,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:56:28,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 28 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-08 12:56:28,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:56:28,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:56:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:56:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=60, Unknown=11, NotChecked=0, Total=90 [2020-07-08 12:56:28,441 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 10 states. [2020-07-08 12:59:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:59:36,258 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-07-08 12:59:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:59:36,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-08 12:59:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:59:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:59:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-08 12:59:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:59:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-08 12:59:36,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2020-07-08 12:59:43,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 44 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-08 12:59:43,371 INFO L225 Difference]: With dead ends: 64 [2020-07-08 12:59:43,372 INFO L226 Difference]: Without dead ends: 62 [2020-07-08 12:59:43,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=30, Invalid=91, Unknown=11, NotChecked=0, Total=132 [2020-07-08 12:59:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-08 12:59:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2020-07-08 12:59:43,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:59:43,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2020-07-08 12:59:43,499 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2020-07-08 12:59:43,499 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2020-07-08 12:59:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:59:43,502 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-08 12:59:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-07-08 12:59:43,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:59:43,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:59:43,503 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2020-07-08 12:59:43,503 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2020-07-08 12:59:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:59:43,506 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-08 12:59:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-07-08 12:59:43,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:59:43,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:59:43,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:59:43,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:59:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-08 12:59:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2020-07-08 12:59:43,510 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 37 [2020-07-08 12:59:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:59:43,510 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2020-07-08 12:59:43,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:59:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-08 12:59:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-08 12:59:43,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:59:43,511 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-08 12:59:43,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-08 12:59:43,723 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:59:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:59:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash 584019147, now seen corresponding path program 3 times [2020-07-08 12:59:43,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:59:43,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871767948] [2020-07-08 12:59:43,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:59:43,729 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:59:43,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642825888] [2020-07-08 12:59:43,729 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:59:43,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-08 12:59:43,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:59:43,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-08 12:59:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:59:45,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:59:46,980 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-07-08 12:59:47,763 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:59:49,139 INFO L263 TraceCheckUtils]: 0: Hoare triple {2503#true} call ULTIMATE.init(); {2503#true} is VALID [2020-07-08 12:59:49,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-08 12:59:49,139 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2503#true} {2503#true} #55#return; {2503#true} is VALID [2020-07-08 12:59:49,139 INFO L263 TraceCheckUtils]: 3: Hoare triple {2503#true} call #t~ret2 := main(); {2503#true} is VALID [2020-07-08 12:59:49,140 INFO L280 TraceCheckUtils]: 4: Hoare triple {2503#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {2503#true} is VALID [2020-07-08 12:59:49,140 INFO L263 TraceCheckUtils]: 5: Hoare triple {2503#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2503#true} is VALID [2020-07-08 12:59:49,140 INFO L280 TraceCheckUtils]: 6: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2020-07-08 12:59:49,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {2503#true} assume !(0 == ~cond); {2503#true} is VALID [2020-07-08 12:59:49,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-08 12:59:49,140 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2503#true} {2503#true} #59#return; {2503#true} is VALID [2020-07-08 12:59:49,141 INFO L263 TraceCheckUtils]: 10: Hoare triple {2503#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2503#true} is VALID [2020-07-08 12:59:49,141 INFO L280 TraceCheckUtils]: 11: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2020-07-08 12:59:49,141 INFO L280 TraceCheckUtils]: 12: Hoare triple {2503#true} assume !(0 == ~cond); {2503#true} is VALID [2020-07-08 12:59:49,141 INFO L280 TraceCheckUtils]: 13: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-08 12:59:49,141 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2503#true} {2503#true} #61#return; {2503#true} is VALID [2020-07-08 12:59:49,178 INFO L280 TraceCheckUtils]: 15: Hoare triple {2503#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,180 INFO L280 TraceCheckUtils]: 16: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} assume !false; {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,180 INFO L263 TraceCheckUtils]: 17: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2503#true} is VALID [2020-07-08 12:59:49,181 INFO L280 TraceCheckUtils]: 18: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2020-07-08 12:59:49,181 INFO L280 TraceCheckUtils]: 19: Hoare triple {2503#true} assume !(0 == ~cond); {2503#true} is VALID [2020-07-08 12:59:49,181 INFO L280 TraceCheckUtils]: 20: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-08 12:59:49,183 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2503#true} {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} #63#return; {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,186 INFO L280 TraceCheckUtils]: 22: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} assume !!(0 != ~r~0); {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,187 INFO L280 TraceCheckUtils]: 23: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,189 INFO L280 TraceCheckUtils]: 24: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} assume !false; {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,189 INFO L263 TraceCheckUtils]: 25: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2503#true} is VALID [2020-07-08 12:59:49,190 INFO L280 TraceCheckUtils]: 26: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2020-07-08 12:59:49,190 INFO L280 TraceCheckUtils]: 27: Hoare triple {2503#true} assume !(0 == ~cond); {2503#true} is VALID [2020-07-08 12:59:49,190 INFO L280 TraceCheckUtils]: 28: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-08 12:59:49,192 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2503#true} {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} #63#return; {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,194 INFO L280 TraceCheckUtils]: 30: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} assume !!(0 != ~r~0); {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,196 INFO L280 TraceCheckUtils]: 31: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,197 INFO L280 TraceCheckUtils]: 32: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} assume !false; {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} is VALID [2020-07-08 12:59:49,198 INFO L263 TraceCheckUtils]: 33: Hoare triple {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2503#true} is VALID [2020-07-08 12:59:49,199 INFO L280 TraceCheckUtils]: 34: Hoare triple {2503#true} ~cond := #in~cond; {2611#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:59:49,201 INFO L280 TraceCheckUtils]: 35: Hoare triple {2611#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2615#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:59:49,203 INFO L280 TraceCheckUtils]: 36: Hoare triple {2615#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {2615#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:59:49,205 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2615#(not (= 0 |__VERIFIER_assert_#in~cond|))} {2553#(= 0 (mod (+ main_~u~0 1) (- 2)))} #63#return; {2622#(and (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:59:49,207 INFO L280 TraceCheckUtils]: 38: Hoare triple {2622#(and (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !!(0 != ~r~0); {2622#(and (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:59:51,253 INFO L280 TraceCheckUtils]: 39: Hoare triple {2622#(and (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2622#(and (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 12:59:51,254 INFO L280 TraceCheckUtils]: 40: Hoare triple {2622#(and (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {2622#(and (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 12:59:51,257 INFO L263 TraceCheckUtils]: 41: Hoare triple {2622#(and (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2635#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:59:51,259 INFO L280 TraceCheckUtils]: 42: Hoare triple {2635#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2639#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:59:51,261 INFO L280 TraceCheckUtils]: 43: Hoare triple {2639#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2504#false} is VALID [2020-07-08 12:59:51,261 INFO L280 TraceCheckUtils]: 44: Hoare triple {2504#false} assume !false; {2504#false} is VALID [2020-07-08 12:59:51,264 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-08 12:59:51,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871767948] [2020-07-08 12:59:51,264 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:59:51,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642825888] [2020-07-08 12:59:51,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:59:51,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 12:59:51,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103330943] [2020-07-08 12:59:51,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-08 12:59:51,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:59:51,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:59:53,761 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-08 12:59:53,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:59:53,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:59:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:59:53,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:59:53,762 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 8 states. [2020-07-08 13:00:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 13:00:20,998 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2020-07-08 13:00:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 13:00:20,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-08 13:00:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 13:00:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 13:00:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-08 13:00:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 13:00:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-08 13:00:21,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2020-07-08 13:00:23,482 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-08 13:00:23,484 INFO L225 Difference]: With dead ends: 68 [2020-07-08 13:00:23,485 INFO L226 Difference]: Without dead ends: 66 [2020-07-08 13:00:23,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-08 13:00:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-08 13:00:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2020-07-08 13:00:23,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 13:00:23,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 60 states. [2020-07-08 13:00:23,661 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 60 states. [2020-07-08 13:00:23,661 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 60 states. [2020-07-08 13:00:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 13:00:23,665 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-08 13:00:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-08 13:00:23,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 13:00:23,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 13:00:23,666 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 66 states. [2020-07-08 13:00:23,666 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 66 states. [2020-07-08 13:00:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 13:00:23,670 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-08 13:00:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-08 13:00:23,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 13:00:23,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 13:00:23,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 13:00:23,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 13:00:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-08 13:00:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2020-07-08 13:00:23,673 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 45 [2020-07-08 13:00:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 13:00:23,674 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2020-07-08 13:00:23,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 13:00:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-08 13:00:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-08 13:00:23,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 13:00:23,675 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 13:00:23,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 13:00:23,886 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 13:00:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 13:00:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash 641277449, now seen corresponding path program 2 times [2020-07-08 13:00:23,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 13:00:23,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308417692] [2020-07-08 13:00:23,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 13:00:23,891 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 13:00:23,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338989366] [2020-07-08 13:00:23,892 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 13:00:23,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 13:00:23,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 13:00:23,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-08 13:00:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 13:00:26,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 13:00:26,368 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-07-08 13:00:37,331 WARN L193 SmtUtils]: Spent 8.50 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-08 13:00:44,672 WARN L193 SmtUtils]: Spent 6.86 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-08 13:00:53,297 WARN L193 SmtUtils]: Spent 5.29 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-08 13:01:02,856 WARN L193 SmtUtils]: Spent 6.41 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-08 13:01:22,689 WARN L193 SmtUtils]: Spent 5.05 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 13:01:24,976 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 13:01:27,718 INFO L263 TraceCheckUtils]: 0: Hoare triple {2966#true} call ULTIMATE.init(); {2966#true} is VALID [2020-07-08 13:01:27,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {2966#true} assume true; {2966#true} is VALID [2020-07-08 13:01:27,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2966#true} {2966#true} #55#return; {2966#true} is VALID [2020-07-08 13:01:27,719 INFO L263 TraceCheckUtils]: 3: Hoare triple {2966#true} call #t~ret2 := main(); {2966#true} is VALID [2020-07-08 13:01:27,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {2966#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;~A~0 := ~convertDOUBLEToINT(#t~nondet0);havoc #t~nondet0;~R~0 := ~convertDOUBLEToINT(#t~nondet1);havoc #t~nondet1; {2966#true} is VALID [2020-07-08 13:01:27,720 INFO L263 TraceCheckUtils]: 5: Hoare triple {2966#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2966#true} is VALID [2020-07-08 13:01:27,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {2966#true} ~cond := #in~cond; {2966#true} is VALID [2020-07-08 13:01:27,720 INFO L280 TraceCheckUtils]: 7: Hoare triple {2966#true} assume !(0 == ~cond); {2966#true} is VALID [2020-07-08 13:01:27,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {2966#true} assume true; {2966#true} is VALID [2020-07-08 13:01:27,721 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2966#true} {2966#true} #59#return; {2966#true} is VALID [2020-07-08 13:01:27,721 INFO L263 TraceCheckUtils]: 10: Hoare triple {2966#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2966#true} is VALID [2020-07-08 13:01:27,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {2966#true} ~cond := #in~cond; {2966#true} is VALID [2020-07-08 13:01:27,721 INFO L280 TraceCheckUtils]: 12: Hoare triple {2966#true} assume !(0 == ~cond); {2966#true} is VALID [2020-07-08 13:01:27,721 INFO L280 TraceCheckUtils]: 13: Hoare triple {2966#true} assume true; {2966#true} is VALID [2020-07-08 13:01:27,721 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2966#true} {2966#true} #61#return; {2966#true} is VALID [2020-07-08 13:01:29,760 INFO L280 TraceCheckUtils]: 15: Hoare triple {2966#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3016#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 13:01:29,762 INFO L280 TraceCheckUtils]: 16: Hoare triple {3016#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {3016#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,763 INFO L263 TraceCheckUtils]: 17: Hoare triple {3016#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2966#true} is VALID [2020-07-08 13:01:29,764 INFO L280 TraceCheckUtils]: 18: Hoare triple {2966#true} ~cond := #in~cond; {3026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 13:01:29,767 INFO L280 TraceCheckUtils]: 19: Hoare triple {3026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3030#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 13:01:29,768 INFO L280 TraceCheckUtils]: 20: Hoare triple {3030#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {3030#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 13:01:29,771 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3030#(not (= 0 |__VERIFIER_assert_#in~cond|))} {3016#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} #63#return; {3037#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,773 INFO L280 TraceCheckUtils]: 22: Hoare triple {3037#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !!(0 != ~r~0); {3037#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,852 INFO L280 TraceCheckUtils]: 23: Hoare triple {3037#(and (= 1 main_~v~0) (= (+ main_~r~0 main_~A~0) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,855 INFO L280 TraceCheckUtils]: 24: Hoare triple {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,855 INFO L263 TraceCheckUtils]: 25: Hoare triple {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2966#true} is VALID [2020-07-08 13:01:29,855 INFO L280 TraceCheckUtils]: 26: Hoare triple {2966#true} ~cond := #in~cond; {2966#true} is VALID [2020-07-08 13:01:29,855 INFO L280 TraceCheckUtils]: 27: Hoare triple {2966#true} assume !(0 == ~cond); {2966#true} is VALID [2020-07-08 13:01:29,856 INFO L280 TraceCheckUtils]: 28: Hoare triple {2966#true} assume true; {2966#true} is VALID [2020-07-08 13:01:29,858 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2966#true} {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} #63#return; {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,860 INFO L280 TraceCheckUtils]: 30: Hoare triple {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !!(0 != ~r~0); {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,918 INFO L280 TraceCheckUtils]: 31: Hoare triple {3044#(and (= (* main_~u~0 main_~u~0) (+ (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0) 3)) (= (+ main_~r~0 main_~A~0 1) (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2)))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3069#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,920 INFO L280 TraceCheckUtils]: 32: Hoare triple {3069#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {3069#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,920 INFO L263 TraceCheckUtils]: 33: Hoare triple {3069#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2966#true} is VALID [2020-07-08 13:01:29,922 INFO L280 TraceCheckUtils]: 34: Hoare triple {2966#true} ~cond := #in~cond; {3026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 13:01:29,924 INFO L280 TraceCheckUtils]: 35: Hoare triple {3026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3030#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 13:01:29,926 INFO L280 TraceCheckUtils]: 36: Hoare triple {3030#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {3030#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 13:01:29,928 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {3030#(not (= 0 |__VERIFIER_assert_#in~cond|))} {3069#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= 0 (mod (+ main_~u~0 1) (- 2))))} #63#return; {3088#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:29,931 INFO L280 TraceCheckUtils]: 38: Hoare triple {3088#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !!(0 != ~r~0); {3088#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:32,042 INFO L280 TraceCheckUtils]: 39: Hoare triple {3088#(and (= (+ (* 2 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 1) (- 2)) (div (+ (* main_~u~0 (- 1)) 1) (- 2))))) (+ (* main_~u~0 main_~u~0) 1)) (= (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0)) (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !(~r~0 > 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3095#(and (= (+ (* main_~u~0 main_~u~0) 9) (+ (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2)))))) (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is UNKNOWN [2020-07-08 13:01:32,044 INFO L280 TraceCheckUtils]: 40: Hoare triple {3095#(and (= (+ (* main_~u~0 main_~u~0) 9) (+ (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2)))))) (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} assume !false; {3095#(and (= (+ (* main_~u~0 main_~u~0) 9) (+ (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2)))))) (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} is VALID [2020-07-08 13:01:32,047 INFO L263 TraceCheckUtils]: 41: Hoare triple {3095#(and (= (+ (* main_~u~0 main_~u~0) 9) (+ (* 6 main_~u~0) (* 4 (* (div (+ (* main_~u~0 (- 1)) 3) (- 2)) (div (+ (* main_~u~0 (- 1)) 3) (- 2)))))) (= (+ (* main_~v~0 main_~v~0) (* 2 main_~u~0) (* 4 main_~r~0) (* 4 main_~A~0)) (+ (* main_~u~0 main_~u~0) (* 2 main_~v~0))) (= 0 (mod (+ main_~u~0 1) (- 2))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3102#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 13:01:32,055 INFO L280 TraceCheckUtils]: 42: Hoare triple {3102#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3106#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 13:01:32,057 INFO L280 TraceCheckUtils]: 43: Hoare triple {3106#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2967#false} is VALID [2020-07-08 13:01:32,057 INFO L280 TraceCheckUtils]: 44: Hoare triple {2967#false} assume !false; {2967#false} is VALID [2020-07-08 13:01:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 21 refuted. 2 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-08 13:01:32,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308417692] [2020-07-08 13:01:32,063 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 13:01:32,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338989366] [2020-07-08 13:01:32,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 13:01:32,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-08 13:01:32,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943257803] [2020-07-08 13:01:32,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2020-07-08 13:01:32,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 13:01:32,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 13:01:37,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-08 13:01:37,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 13:01:37,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 13:01:37,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 13:01:37,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=96, Unknown=9, NotChecked=0, Total=132 [2020-07-08 13:01:37,074 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 12 states.