/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-8fc6572 [2020-07-10 15:30:00,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:30:00,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:30:00,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:30:00,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:30:00,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:30:00,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:30:00,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:30:00,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:30:00,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:30:00,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:30:00,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:30:00,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:30:00,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:30:00,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:30:00,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:30:00,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:30:00,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:30:00,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:30:00,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:30:00,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:30:00,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:30:00,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:30:00,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:30:00,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:30:00,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:30:00,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:30:00,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:30:00,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:30:00,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:30:00,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:30:00,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:30:00,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:30:00,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:30:00,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:30:00,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:30:00,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:30:00,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:30:00,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:30:00,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:30:00,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:30:00,121 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-10 15:30:00,135 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:30:00,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:30:00,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:30:00,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:30:00,137 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:30:00,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:30:00,137 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:30:00,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:30:00,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:30:00,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:30:00,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:30:00,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:30:00,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:30:00,138 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:30:00,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:30:00,139 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:30:00,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:30:00,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:30:00,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:30:00,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:30:00,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:30:00,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:30:00,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:30:00,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:30:00,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:30:00,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:30:00,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:30:00,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:30:00,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:30:00,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:30:00,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:30:00,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:30:00,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:30:00,434 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:30:00,434 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:30:00,435 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-10 15:30:00,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62fc927f/439fd7d235ac4ea4ab820c27f9f503c6/FLAG0f8a8504f [2020-07-10 15:30:00,964 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:30:00,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/fermat2.c [2020-07-10 15:30:00,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62fc927f/439fd7d235ac4ea4ab820c27f9f503c6/FLAG0f8a8504f [2020-07-10 15:30:01,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62fc927f/439fd7d235ac4ea4ab820c27f9f503c6 [2020-07-10 15:30:01,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:30:01,366 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:30:01,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:01,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:30:01,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:30:01,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9b0210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01, skipping insertion in model container [2020-07-10 15:30:01,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:30:01,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:30:01,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:01,588 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:30:01,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:01,625 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:30:01,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01 WrapperNode [2020-07-10 15:30:01,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:01,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:30:01,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:30:01,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:30:01,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:30:01,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:30:01,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:30:01,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:30:01,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (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-10 15:30:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:30:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:30:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:30:01,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:30:01,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:30:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:30:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 15:30:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:30:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:30:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:30:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:30:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:30:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:30:02,087 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:30:02,087 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:30:02,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:02 BoogieIcfgContainer [2020-07-10 15:30:02,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:30:02,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:30:02,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:30:02,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:30:02,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:30:01" (1/3) ... [2020-07-10 15:30:02,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672d4ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:02, skipping insertion in model container [2020-07-10 15:30:02,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01" (2/3) ... [2020-07-10 15:30:02,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672d4ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:02, skipping insertion in model container [2020-07-10 15:30:02,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:02" (3/3) ... [2020-07-10 15:30:02,100 INFO L109 eAbstractionObserver]: Analyzing ICFG fermat2.c [2020-07-10 15:30:02,112 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:30:02,121 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:30:02,138 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:30:02,163 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:30:02,164 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:30:02,164 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:30:02,164 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:30:02,164 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:30:02,164 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:30:02,165 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:30:02,165 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:30:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-10 15:30:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:30:02,192 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:02,194 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-10 15:30:02,194 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash -849943384, now seen corresponding path program 1 times [2020-07-10 15:30:02,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:02,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085653242] [2020-07-10 15:30:02,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:02,306 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:02,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160229224] [2020-07-10 15:30:02,308 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-10 15:30:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-10 15:30:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,376 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:02,452 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2020-07-10 15:30:02,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 15:30:02,453 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #55#return; {31#true} is VALID [2020-07-10 15:30:02,454 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2020-07-10 15:30:02,454 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-10 15:30:02,455 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-10 15:30:02,455 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-10 15:30:02,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-10 15:30:02,457 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-10 15:30:02,457 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {32#false} {31#true} #59#return; {32#false} is VALID [2020-07-10 15:30:02,458 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-10 15:30:02,458 INFO L280 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2020-07-10 15:30:02,459 INFO L280 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-10 15:30:02,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-10 15:30:02,459 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {32#false} {32#false} #61#return; {32#false} is VALID [2020-07-10 15:30:02,460 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-10 15:30:02,460 INFO L280 TraceCheckUtils]: 16: Hoare triple {32#false} assume !true; {32#false} is VALID [2020-07-10 15:30:02,461 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-10 15:30:02,461 INFO L280 TraceCheckUtils]: 18: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2020-07-10 15:30:02,461 INFO L280 TraceCheckUtils]: 19: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2020-07-10 15:30:02,462 INFO L280 TraceCheckUtils]: 20: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-10 15:30:02,466 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-10 15:30:02,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085653242] [2020-07-10 15:30:02,467 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:02,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160229224] [2020-07-10 15:30:02,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:02,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:30:02,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159463979] [2020-07-10 15:30:02,476 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-07-10 15:30:02,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:02,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:30:02,537 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-10 15:30:02,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:30:02,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:30:02,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:30:02,551 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-07-10 15:30:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:02,647 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2020-07-10 15:30:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:30:02,648 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-07-10 15:30:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2020-07-10 15:30:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2020-07-10 15:30:02,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2020-07-10 15:30:02,783 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-10 15:30:02,795 INFO L225 Difference]: With dead ends: 50 [2020-07-10 15:30:02,795 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 15:30:02,799 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-10 15:30:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 15:30:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-10 15:30:02,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:02,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:02,847 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:02,847 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:02,853 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 15:30:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 15:30:02,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:02,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:02,855 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:02,855 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:02,860 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 15:30:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 15:30:02,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:02,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:02,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:02,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:30:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-10 15:30:02,867 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2020-07-10 15:30:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:02,868 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-10 15:30:02,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:30:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 15:30:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:30:02,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:02,870 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-10 15:30:03,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-10 15:30:03,086 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1193991140, now seen corresponding path program 1 times [2020-07-10 15:30:03,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:03,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436717021] [2020-07-10 15:30:03,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:03,093 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:03,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363843470] [2020-07-10 15:30:03,094 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-10 15:30:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:03,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:30:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:03,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:03,283 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:30:15,826 WARN L193 SmtUtils]: Spent 8.21 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-10 15:30:15,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:30:34,992 WARN L193 SmtUtils]: Spent 12.44 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-10 15:30:37,066 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:30:45,213 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-10 15:30:47,227 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-10 15:30:47,228 INFO L263 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2020-07-10 15:30:47,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-10 15:30:47,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {242#true} {242#true} #55#return; {242#true} is VALID [2020-07-10 15:30:47,229 INFO L263 TraceCheckUtils]: 3: Hoare triple {242#true} call #t~ret2 := main(); {242#true} is VALID [2020-07-10 15:30:47,229 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-10 15:30:47,230 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-10 15:30:47,230 INFO L280 TraceCheckUtils]: 6: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2020-07-10 15:30:47,230 INFO L280 TraceCheckUtils]: 7: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2020-07-10 15:30:47,231 INFO L280 TraceCheckUtils]: 8: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-10 15:30:47,231 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {242#true} {242#true} #59#return; {242#true} is VALID [2020-07-10 15:30:47,231 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-10 15:30:47,231 INFO L280 TraceCheckUtils]: 11: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2020-07-10 15:30:47,232 INFO L280 TraceCheckUtils]: 12: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2020-07-10 15:30:47,232 INFO L280 TraceCheckUtils]: 13: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-10 15:30:47,232 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {242#true} {242#true} #61#return; {242#true} is VALID [2020-07-10 15:30:49,295 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-10 15:30:49,300 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-10 15:30:49,312 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-10 15:30:49,314 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-10 15:30:49,321 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-10 15:30:51,369 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-10 15:30:51,373 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-10 15:30:51,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436717021] [2020-07-10 15:30:51,373 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:51,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363843470] [2020-07-10 15:30:51,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:51,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:30:51,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991012829] [2020-07-10 15:30:51,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-10 15:30:51,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:51,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:30:57,577 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-10 15:30:57,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:30:57,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:30:57,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=13, Unknown=2, NotChecked=6, Total=30 [2020-07-10 15:30:57,579 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2020-07-10 15:32:03,231 WARN L193 SmtUtils]: Spent 31.84 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-10 15:32:59,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:32:59,033 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:32:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:32:59,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-10 15:32:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:32:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:32:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-10 15:32:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:32:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-10 15:32:59,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2020-07-10 15:33:05,542 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-10 15:33:05,545 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:33:05,545 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:33:05,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2020-07-10 15:33:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:33:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-10 15:33:05,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:33:05,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-10 15:33:05,611 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-10 15:33:05,611 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-10 15:33:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:33:05,620 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-10 15:33:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-10 15:33:05,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:33:05,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:33:05,621 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-10 15:33:05,621 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-10 15:33:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:33:05,625 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-10 15:33:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-10 15:33:05,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:33:05,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:33:05,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:33:05,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:33:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:33:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-10 15:33:05,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2020-07-10 15:33:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:33:05,630 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-10 15:33:05,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:33:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-10 15:33:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:33:05,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:33:05,631 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-10 15:33:05,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:33:05,837 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:33:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:33:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1415100442, now seen corresponding path program 1 times [2020-07-10 15:33:05,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:33:05,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401468395] [2020-07-10 15:33:05,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:33:05,845 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:33:05,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [297847490] [2020-07-10 15:33:05,846 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-10 15:33:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:33:05,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 15:33:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:33:05,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:33:07,140 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:33:07,490 INFO L263 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2020-07-10 15:33:07,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {460#true} assume true; {460#true} is VALID [2020-07-10 15:33:07,490 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} #55#return; {460#true} is VALID [2020-07-10 15:33:07,491 INFO L263 TraceCheckUtils]: 3: Hoare triple {460#true} call #t~ret2 := main(); {460#true} is VALID [2020-07-10 15:33:07,491 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-10 15:33:07,491 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-10 15:33:07,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2020-07-10 15:33:07,492 INFO L280 TraceCheckUtils]: 7: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2020-07-10 15:33:07,492 INFO L280 TraceCheckUtils]: 8: Hoare triple {460#true} assume true; {460#true} is VALID [2020-07-10 15:33:07,493 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {460#true} {460#true} #59#return; {460#true} is VALID [2020-07-10 15:33:07,493 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-10 15:33:07,493 INFO L280 TraceCheckUtils]: 11: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2020-07-10 15:33:07,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2020-07-10 15:33:07,494 INFO L280 TraceCheckUtils]: 13: Hoare triple {460#true} assume true; {460#true} is VALID [2020-07-10 15:33:07,494 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {460#true} {460#true} #61#return; {460#true} is VALID [2020-07-10 15:33:07,495 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-10 15:33:07,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {460#true} assume !false; {460#true} is VALID [2020-07-10 15:33:07,495 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-10 15:33:07,502 INFO L280 TraceCheckUtils]: 18: Hoare triple {460#true} ~cond := #in~cond; {519#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:33:07,505 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-10 15:33:07,508 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-10 15:33:07,513 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-10 15:33:07,518 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-10 15:33:07,521 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-10 15:33:07,523 INFO L280 TraceCheckUtils]: 24: Hoare triple {538#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {542#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:33:07,526 INFO L280 TraceCheckUtils]: 25: Hoare triple {542#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {461#false} is VALID [2020-07-10 15:33:07,526 INFO L280 TraceCheckUtils]: 26: Hoare triple {461#false} assume !false; {461#false} is VALID [2020-07-10 15:33:07,528 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-10 15:33:07,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401468395] [2020-07-10 15:33:07,529 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:33:07,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297847490] [2020-07-10 15:33:07,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:33:07,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:33:07,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086222036] [2020-07-10 15:33:07,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 15:33:07,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:33:07,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:33:07,714 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-10 15:33:07,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:33:07,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:33:07,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:33:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:33:07,716 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 8 states. [2020-07-10 15:33:14,107 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-07-10 15:33:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:33:24,049 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-10 15:33:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:33:24,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 15:33:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:33:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:33:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-10 15:33:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:33:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2020-07-10 15:33:24,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2020-07-10 15:33:24,293 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-10 15:33:24,296 INFO L225 Difference]: With dead ends: 33 [2020-07-10 15:33:24,296 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:33:24,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:33:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:33:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-10 15:33:24,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:33:24,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-10 15:33:24,352 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:33:24,352 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:33:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:33:24,355 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:33:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:33:24,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:33:24,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:33:24,356 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:33:24,356 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:33:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:33:24,358 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:33:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:33:24,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:33:24,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:33:24,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:33:24,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:33:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 15:33:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-07-10 15:33:24,362 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 27 [2020-07-10 15:33:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:33:24,362 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-07-10 15:33:24,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:33:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:33:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:33:24,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:33:24,364 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-10 15:33:24,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:33:24,568 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:33:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:33:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1831429119, now seen corresponding path program 1 times [2020-07-10 15:33:24,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:33:24,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962672619] [2020-07-10 15:33:24,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:33:24,574 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:33:24,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755611594] [2020-07-10 15:33:24,575 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-10 15:33:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:33:24,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:33:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:33:24,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:33:25,526 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-07-10 15:33:27,919 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:33:28,281 INFO L263 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2020-07-10 15:33:28,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {693#true} assume true; {693#true} is VALID [2020-07-10 15:33:28,282 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {693#true} {693#true} #55#return; {693#true} is VALID [2020-07-10 15:33:28,282 INFO L263 TraceCheckUtils]: 3: Hoare triple {693#true} call #t~ret2 := main(); {693#true} is VALID [2020-07-10 15:33:28,282 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-10 15:33:28,283 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-10 15:33:28,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {693#true} ~cond := #in~cond; {693#true} is VALID [2020-07-10 15:33:28,283 INFO L280 TraceCheckUtils]: 7: Hoare triple {693#true} assume !(0 == ~cond); {693#true} is VALID [2020-07-10 15:33:28,283 INFO L280 TraceCheckUtils]: 8: Hoare triple {693#true} assume true; {693#true} is VALID [2020-07-10 15:33:28,284 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {693#true} {693#true} #59#return; {693#true} is VALID [2020-07-10 15:33:28,284 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-10 15:33:28,284 INFO L280 TraceCheckUtils]: 11: Hoare triple {693#true} ~cond := #in~cond; {693#true} is VALID [2020-07-10 15:33:28,285 INFO L280 TraceCheckUtils]: 12: Hoare triple {693#true} assume !(0 == ~cond); {693#true} is VALID [2020-07-10 15:33:28,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {693#true} assume true; {693#true} is VALID [2020-07-10 15:33:28,285 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {693#true} {693#true} #61#return; {693#true} is VALID [2020-07-10 15:33:28,295 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-10 15:33:28,297 INFO L280 TraceCheckUtils]: 16: Hoare triple {743#(= 1 main_~v~0)} assume !false; {743#(= 1 main_~v~0)} is VALID [2020-07-10 15:33:28,297 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-10 15:33:28,299 INFO L280 TraceCheckUtils]: 18: Hoare triple {693#true} ~cond := #in~cond; {753#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:33:28,301 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-10 15:33:28,303 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-10 15:33:28,306 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-10 15:33:28,308 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-10 15:33:28,332 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-10 15:33:28,334 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-10 15:33:28,337 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-10 15:33:28,343 INFO L280 TraceCheckUtils]: 26: Hoare triple {778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:33:28,345 INFO L280 TraceCheckUtils]: 27: Hoare triple {782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {694#false} is VALID [2020-07-10 15:33:28,345 INFO L280 TraceCheckUtils]: 28: Hoare triple {694#false} assume !false; {694#false} is VALID [2020-07-10 15:33:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:33:28,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962672619] [2020-07-10 15:33:28,348 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:33:28,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755611594] [2020-07-10 15:33:28,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:33:28,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:33:28,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867309997] [2020-07-10 15:33:28,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-10 15:33:28,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:33:28,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:33:28,604 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-10 15:33:28,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:33:28,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:33:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:33:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:33:28,606 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 9 states. [2020-07-10 15:33:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:33:56,561 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-10 15:33:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:33:56,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-10 15:33:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:33:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:33:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-10 15:33:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:33:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-10 15:33:56,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2020-07-10 15:33:57,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:33:57,031 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:33:57,031 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:33:57,032 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:33:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:33:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-10 15:33:57,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:33:57,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-10 15:33:57,110 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-10 15:33:57,110 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-10 15:33:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:33:57,115 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-10 15:33:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2020-07-10 15:33:57,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:33:57,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:33:57,116 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-10 15:33:57,116 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-10 15:33:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:33:57,119 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-10 15:33:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2020-07-10 15:33:57,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:33:57,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:33:57,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:33:57,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:33:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:33:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-10 15:33:57,123 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2020-07-10 15:33:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:33:57,123 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-10 15:33:57,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:33:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-10 15:33:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:33:57,125 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:33:57,125 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-10 15:33:57,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:33:57,339 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:33:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:33:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1774170817, now seen corresponding path program 1 times [2020-07-10 15:33:57,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:33:57,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818857841] [2020-07-10 15:33:57,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:33:57,345 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:33:57,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643020950] [2020-07-10 15:33:57,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 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-10 15:33:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:33:57,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-10 15:33:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:33:59,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:33:59,746 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-07-10 15:34:10,569 WARN L193 SmtUtils]: Spent 8.43 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-10 15:34:27,678 WARN L193 SmtUtils]: Spent 8.66 s on a formula simplification that was a NOOP. DAG size: 32 [2020-07-10 15:34:27,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:34:28,268 INFO L263 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2020-07-10 15:34:28,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {980#true} assume true; {980#true} is VALID [2020-07-10 15:34:28,269 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {980#true} {980#true} #55#return; {980#true} is VALID [2020-07-10 15:34:28,269 INFO L263 TraceCheckUtils]: 3: Hoare triple {980#true} call #t~ret2 := main(); {980#true} is VALID [2020-07-10 15:34:28,269 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-10 15:34:28,270 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-10 15:34:28,270 INFO L280 TraceCheckUtils]: 6: Hoare triple {980#true} ~cond := #in~cond; {980#true} is VALID [2020-07-10 15:34:28,270 INFO L280 TraceCheckUtils]: 7: Hoare triple {980#true} assume !(0 == ~cond); {980#true} is VALID [2020-07-10 15:34:28,270 INFO L280 TraceCheckUtils]: 8: Hoare triple {980#true} assume true; {980#true} is VALID [2020-07-10 15:34:28,271 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {980#true} {980#true} #59#return; {980#true} is VALID [2020-07-10 15:34:28,271 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-10 15:34:28,271 INFO L280 TraceCheckUtils]: 11: Hoare triple {980#true} ~cond := #in~cond; {980#true} is VALID [2020-07-10 15:34:28,271 INFO L280 TraceCheckUtils]: 12: Hoare triple {980#true} assume !(0 == ~cond); {980#true} is VALID [2020-07-10 15:34:28,272 INFO L280 TraceCheckUtils]: 13: Hoare triple {980#true} assume true; {980#true} is VALID [2020-07-10 15:34:28,272 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {980#true} {980#true} #61#return; {980#true} is VALID [2020-07-10 15:34:30,323 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-10 15:34:30,326 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-10 15:34:30,327 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-10 15:34:30,329 INFO L280 TraceCheckUtils]: 18: Hoare triple {980#true} ~cond := #in~cond; {1040#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:34:30,331 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-10 15:34:30,334 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-10 15:34:30,337 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-10 15:34:30,341 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-10 15:34:32,394 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-10 15:34:32,397 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-10 15:34:32,400 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-10 15:34:32,404 INFO L280 TraceCheckUtils]: 26: Hoare triple {1065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:34:32,406 INFO L280 TraceCheckUtils]: 27: Hoare triple {1069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {981#false} is VALID [2020-07-10 15:34:32,406 INFO L280 TraceCheckUtils]: 28: Hoare triple {981#false} assume !false; {981#false} is VALID [2020-07-10 15:34:32,409 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-10 15:34:32,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818857841] [2020-07-10 15:34:32,409 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:34:32,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643020950] [2020-07-10 15:34:32,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:34:32,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:34:32,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136661345] [2020-07-10 15:34:32,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-10 15:34:32,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:34:32,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:34:36,774 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-10 15:34:36,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:34:36,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:34:36,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:34:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=50, Unknown=5, NotChecked=0, Total=72 [2020-07-10 15:34:36,776 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 9 states. [2020-07-10 15:35:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:35:34,757 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-10 15:35:34,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:35:34,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-07-10 15:35:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:35:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:35:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-10 15:35:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:35:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-10 15:35:34,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2020-07-10 15:35:39,437 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-10 15:35:39,440 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:35:39,440 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 15:35:39,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=28, Invalid=77, Unknown=5, NotChecked=0, Total=110 [2020-07-10 15:35:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 15:35:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-10 15:35:39,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:35:39,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-10 15:35:39,584 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-10 15:35:39,585 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-10 15:35:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:35:39,589 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-10 15:35:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-10 15:35:39,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:35:39,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:35:39,594 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-10 15:35:39,594 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-10 15:35:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:35:39,599 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-10 15:35:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-10 15:35:39,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:35:39,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:35:39,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:35:39,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:35:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 15:35:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2020-07-10 15:35:39,605 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 29 [2020-07-10 15:35:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:35:39,605 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2020-07-10 15:35:39,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:35:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-10 15:35:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:35:39,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:35:39,607 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-10 15:35:39,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:35:39,812 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:35:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:35:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1286102758, now seen corresponding path program 2 times [2020-07-10 15:35:39,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:35:39,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110841818] [2020-07-10 15:35:39,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:35:39,817 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:35:39,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174011966] [2020-07-10 15:35:39,818 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-10 15:35:39,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:35:39,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:35:39,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-10 15:35:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:35:39,921 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:35:40,354 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-07-10 15:35:41,189 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-07-10 15:35:47,792 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-07-10 15:35:54,389 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:35:57,540 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 3 [2020-07-10 15:35:57,848 INFO L263 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2020-07-10 15:35:57,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {1305#true} assume true; {1305#true} is VALID [2020-07-10 15:35:57,849 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1305#true} {1305#true} #55#return; {1305#true} is VALID [2020-07-10 15:35:57,850 INFO L263 TraceCheckUtils]: 3: Hoare triple {1305#true} call #t~ret2 := main(); {1305#true} is VALID [2020-07-10 15:35:57,850 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-10 15:35:57,850 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-10 15:35:57,851 INFO L280 TraceCheckUtils]: 6: Hoare triple {1305#true} ~cond := #in~cond; {1305#true} is VALID [2020-07-10 15:35:57,851 INFO L280 TraceCheckUtils]: 7: Hoare triple {1305#true} assume !(0 == ~cond); {1305#true} is VALID [2020-07-10 15:35:57,851 INFO L280 TraceCheckUtils]: 8: Hoare triple {1305#true} assume true; {1305#true} is VALID [2020-07-10 15:35:57,851 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1305#true} {1305#true} #59#return; {1305#true} is VALID [2020-07-10 15:35:57,851 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-10 15:35:57,852 INFO L280 TraceCheckUtils]: 11: Hoare triple {1305#true} ~cond := #in~cond; {1305#true} is VALID [2020-07-10 15:35:57,852 INFO L280 TraceCheckUtils]: 12: Hoare triple {1305#true} assume !(0 == ~cond); {1305#true} is VALID [2020-07-10 15:35:57,852 INFO L280 TraceCheckUtils]: 13: Hoare triple {1305#true} assume true; {1305#true} is VALID [2020-07-10 15:35:57,852 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1305#true} {1305#true} #61#return; {1305#true} is VALID [2020-07-10 15:35:57,855 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-10 15:35:57,857 INFO L280 TraceCheckUtils]: 16: Hoare triple {1355#(= 1 main_~v~0)} assume !false; {1355#(= 1 main_~v~0)} is VALID [2020-07-10 15:35:57,858 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-10 15:35:57,860 INFO L280 TraceCheckUtils]: 18: Hoare triple {1305#true} ~cond := #in~cond; {1365#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:35:57,862 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-10 15:35:57,865 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-10 15:35:57,868 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-10 15:35:57,871 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-10 15:35:57,916 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-10 15:35:57,918 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-10 15:35:57,919 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-10 15:35:57,921 INFO L280 TraceCheckUtils]: 26: Hoare triple {1305#true} ~cond := #in~cond; {1365#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:35:57,924 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-10 15:35:57,926 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-10 15:35:57,929 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-10 15:35:57,932 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-10 15:35:57,987 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-10 15:35:57,990 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-10 15:35:57,993 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-10 15:35:57,996 INFO L280 TraceCheckUtils]: 34: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:35:57,998 INFO L280 TraceCheckUtils]: 35: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1306#false} is VALID [2020-07-10 15:35:57,999 INFO L280 TraceCheckUtils]: 36: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2020-07-10 15:35:58,001 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-10 15:35:58,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110841818] [2020-07-10 15:35:58,002 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:35:58,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174011966] [2020-07-10 15:35:58,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:35:58,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-10 15:35:58,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228406103] [2020-07-10 15:35:58,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 15:35:58,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:35:58,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:35:58,645 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-10 15:35:58,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:35:58,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:35:58,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:35:58,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:35:58,646 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 10 states. [2020-07-10 15:36:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:36:49,861 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-10 15:36:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:36:49,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 15:36:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:36:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:36:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-10 15:36:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:36:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-10 15:36:49,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2020-07-10 15:36:50,730 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-10 15:36:50,732 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:36:50,732 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 15:36:50,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:36:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 15:36:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-07-10 15:36:50,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:36:50,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2020-07-10 15:36:50,855 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2020-07-10 15:36:50,855 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2020-07-10 15:36:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:36:50,859 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-10 15:36:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-10 15:36:50,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:36:50,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:36:50,860 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2020-07-10 15:36:50,860 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2020-07-10 15:36:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:36:50,863 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-10 15:36:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-10 15:36:50,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:36:50,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:36:50,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:36:50,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:36:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 15:36:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-07-10 15:36:50,867 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 37 [2020-07-10 15:36:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:36:50,867 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-10 15:36:50,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:36:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-10 15:36:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:36:50,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:36:50,869 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-10 15:36:51,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:36:51,072 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:36:51,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:36:51,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1343361060, now seen corresponding path program 1 times [2020-07-10 15:36:51,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:36:51,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179293491] [2020-07-10 15:36:51,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:36:51,077 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:36:51,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88169689] [2020-07-10 15:36:51,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 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-10 15:36:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:36:51,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:36:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:36:51,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:36:51,468 INFO L263 TraceCheckUtils]: 0: Hoare triple {1693#true} call ULTIMATE.init(); {1693#true} is VALID [2020-07-10 15:36:51,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-10 15:36:51,469 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1693#true} {1693#true} #55#return; {1693#true} is VALID [2020-07-10 15:36:51,469 INFO L263 TraceCheckUtils]: 3: Hoare triple {1693#true} call #t~ret2 := main(); {1693#true} is VALID [2020-07-10 15:36:51,469 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-10 15:36:51,470 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-10 15:36:51,470 INFO L280 TraceCheckUtils]: 6: Hoare triple {1693#true} ~cond := #in~cond; {1693#true} is VALID [2020-07-10 15:36:51,470 INFO L280 TraceCheckUtils]: 7: Hoare triple {1693#true} assume !(0 == ~cond); {1693#true} is VALID [2020-07-10 15:36:51,470 INFO L280 TraceCheckUtils]: 8: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-10 15:36:51,470 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1693#true} {1693#true} #59#return; {1693#true} is VALID [2020-07-10 15:36:51,470 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-10 15:36:51,471 INFO L280 TraceCheckUtils]: 11: Hoare triple {1693#true} ~cond := #in~cond; {1693#true} is VALID [2020-07-10 15:36:51,471 INFO L280 TraceCheckUtils]: 12: Hoare triple {1693#true} assume !(0 == ~cond); {1693#true} is VALID [2020-07-10 15:36:51,471 INFO L280 TraceCheckUtils]: 13: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-10 15:36:51,471 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1693#true} {1693#true} #61#return; {1693#true} is VALID [2020-07-10 15:36:51,473 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-10 15:36:51,475 INFO L280 TraceCheckUtils]: 16: Hoare triple {1743#(<= main_~v~0 1)} assume !false; {1743#(<= main_~v~0 1)} is VALID [2020-07-10 15:36:51,476 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-10 15:36:51,476 INFO L280 TraceCheckUtils]: 18: Hoare triple {1693#true} ~cond := #in~cond; {1693#true} is VALID [2020-07-10 15:36:51,476 INFO L280 TraceCheckUtils]: 19: Hoare triple {1693#true} assume !(0 == ~cond); {1693#true} is VALID [2020-07-10 15:36:51,476 INFO L280 TraceCheckUtils]: 20: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-10 15:36:51,479 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1693#true} {1743#(<= main_~v~0 1)} #63#return; {1743#(<= main_~v~0 1)} is VALID [2020-07-10 15:36:51,481 INFO L280 TraceCheckUtils]: 22: Hoare triple {1743#(<= main_~v~0 1)} assume !!(0 != ~r~0); {1743#(<= main_~v~0 1)} is VALID [2020-07-10 15:36:51,502 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-10 15:36:51,504 INFO L280 TraceCheckUtils]: 24: Hoare triple {1768#(<= 0 main_~r~0)} assume !false; {1768#(<= 0 main_~r~0)} is VALID [2020-07-10 15:36:51,505 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-10 15:36:51,505 INFO L280 TraceCheckUtils]: 26: Hoare triple {1693#true} ~cond := #in~cond; {1693#true} is VALID [2020-07-10 15:36:51,505 INFO L280 TraceCheckUtils]: 27: Hoare triple {1693#true} assume !(0 == ~cond); {1693#true} is VALID [2020-07-10 15:36:51,505 INFO L280 TraceCheckUtils]: 28: Hoare triple {1693#true} assume true; {1693#true} is VALID [2020-07-10 15:36:51,508 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1693#true} {1768#(<= 0 main_~r~0)} #63#return; {1768#(<= 0 main_~r~0)} is VALID [2020-07-10 15:36:51,511 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-10 15:36:51,533 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-10 15:36:51,533 INFO L280 TraceCheckUtils]: 32: Hoare triple {1694#false} assume !false; {1694#false} is VALID [2020-07-10 15:36:51,533 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-10 15:36:51,534 INFO L280 TraceCheckUtils]: 34: Hoare triple {1694#false} ~cond := #in~cond; {1694#false} is VALID [2020-07-10 15:36:51,534 INFO L280 TraceCheckUtils]: 35: Hoare triple {1694#false} assume 0 == ~cond; {1694#false} is VALID [2020-07-10 15:36:51,534 INFO L280 TraceCheckUtils]: 36: Hoare triple {1694#false} assume !false; {1694#false} is VALID [2020-07-10 15:36:51,536 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-10 15:36:51,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179293491] [2020-07-10 15:36:51,536 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:36:51,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88169689] [2020-07-10 15:36:51,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:36:51,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-10 15:36:51,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860617847] [2020-07-10 15:36:51,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-10 15:36:51,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:36:51,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:36:51,839 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-10 15:36:51,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:36:51,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:36:51,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:36:51,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:36:51,841 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 5 states. [2020-07-10 15:36:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:36:53,455 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-10 15:36:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:36:53,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-10 15:36:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:36:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:36:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-10 15:36:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:36:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2020-07-10 15:36:53,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2020-07-10 15:36:53,960 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-10 15:36:53,963 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:36:53,963 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:36:53,964 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-10 15:36:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:36:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-10 15:36:54,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:36:54,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-10 15:36:54,120 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 15:36:54,120 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 15:36:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:36:54,123 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-10 15:36:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:36:54,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:36:54,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:36:54,124 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 15:36:54,124 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 15:36:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:36:54,127 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-10 15:36:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:36:54,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:36:54,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:36:54,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:36:54,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:36:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 15:36:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-07-10 15:36:54,130 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 37 [2020-07-10 15:36:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:36:54,131 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-07-10 15:36:54,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:36:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:36:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:36:54,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:36:54,134 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-10 15:36:54,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:36:54,343 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:36:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:36:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash 332243810, now seen corresponding path program 2 times [2020-07-10 15:36:54,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:36:54,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606621141] [2020-07-10 15:36:54,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:36:54,349 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:36:54,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881609043] [2020-07-10 15:36:54,350 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-10 15:36:54,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:36:54,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:36:54,391 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-10 15:36:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:36:56,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:36:56,958 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-07-10 15:37:08,160 WARN L193 SmtUtils]: Spent 8.75 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-10 15:37:23,472 WARN L193 SmtUtils]: Spent 6.51 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-10 15:37:51,883 WARN L193 SmtUtils]: Spent 6.70 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 15:37:52,098 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:37:53,334 INFO L263 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2020-07-10 15:37:53,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {2077#true} assume true; {2077#true} is VALID [2020-07-10 15:37:53,335 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2077#true} {2077#true} #55#return; {2077#true} is VALID [2020-07-10 15:37:53,336 INFO L263 TraceCheckUtils]: 3: Hoare triple {2077#true} call #t~ret2 := main(); {2077#true} is VALID [2020-07-10 15:37:53,336 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-10 15:37:53,336 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-10 15:37:53,337 INFO L280 TraceCheckUtils]: 6: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2020-07-10 15:37:53,337 INFO L280 TraceCheckUtils]: 7: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2020-07-10 15:37:53,337 INFO L280 TraceCheckUtils]: 8: Hoare triple {2077#true} assume true; {2077#true} is VALID [2020-07-10 15:37:53,337 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2077#true} {2077#true} #59#return; {2077#true} is VALID [2020-07-10 15:37:53,338 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-10 15:37:53,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2020-07-10 15:37:53,338 INFO L280 TraceCheckUtils]: 12: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2020-07-10 15:37:53,338 INFO L280 TraceCheckUtils]: 13: Hoare triple {2077#true} assume true; {2077#true} is VALID [2020-07-10 15:37:53,338 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2077#true} {2077#true} #61#return; {2077#true} is VALID [2020-07-10 15:37:55,433 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-10 15:37:55,436 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-10 15:37:55,436 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-10 15:37:55,439 INFO L280 TraceCheckUtils]: 18: Hoare triple {2077#true} ~cond := #in~cond; {2137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:37:55,441 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-10 15:37:55,444 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-10 15:37:55,447 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-10 15:37:55,451 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-10 15:37:57,489 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-10 15:37:57,491 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-10 15:37:57,491 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-10 15:37:57,493 INFO L280 TraceCheckUtils]: 26: Hoare triple {2077#true} ~cond := #in~cond; {2137#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:37:57,495 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-10 15:37:57,497 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-10 15:37:57,499 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-10 15:37:57,502 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-10 15:37:59,581 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-10 15:37:59,584 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-10 15:37:59,641 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-10 15:37:59,644 INFO L280 TraceCheckUtils]: 34: Hoare triple {2187#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2191#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:37:59,646 INFO L280 TraceCheckUtils]: 35: Hoare triple {2191#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2078#false} is VALID [2020-07-10 15:37:59,647 INFO L280 TraceCheckUtils]: 36: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2020-07-10 15:37:59,652 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-10 15:37:59,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606621141] [2020-07-10 15:37:59,653 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:37:59,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881609043] [2020-07-10 15:37:59,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:37:59,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-10 15:37:59,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233138930] [2020-07-10 15:37:59,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 15:37:59,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:37:59,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:38:06,555 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-10 15:38:06,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:38:06,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:38:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:38:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=60, Unknown=11, NotChecked=0, Total=90 [2020-07-10 15:38:06,557 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 10 states. [2020-07-10 15:41:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:41:30,735 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-07-10 15:41:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:41:30,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 15:41:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:41:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:41:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-10 15:41:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:41:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2020-07-10 15:41:30,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2020-07-10 15:41:38,497 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-10 15:41:38,499 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:41:38,499 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 15:41:38,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=30, Invalid=91, Unknown=11, NotChecked=0, Total=132 [2020-07-10 15:41:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 15:41:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2020-07-10 15:41:38,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:41:38,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2020-07-10 15:41:38,722 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2020-07-10 15:41:38,722 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2020-07-10 15:41:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:41:38,726 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-10 15:41:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-07-10 15:41:38,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:41:38,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:41:38,726 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2020-07-10 15:41:38,726 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2020-07-10 15:41:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:41:38,730 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-10 15:41:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-07-10 15:41:38,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:41:38,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:41:38,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:41:38,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:41:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 15:41:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2020-07-10 15:41:38,735 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 37 [2020-07-10 15:41:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:41:38,736 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2020-07-10 15:41:38,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:41:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-10 15:41:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 15:41:38,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:41:38,739 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-10 15:41:38,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-10 15:41:38,946 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:41:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:41:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash 584019147, now seen corresponding path program 3 times [2020-07-10 15:41:38,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:41:38,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417985974] [2020-07-10 15:41:38,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:41:38,953 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:41:38,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240547639] [2020-07-10 15:41:38,954 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-10 15:41:38,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:41:38,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:41:38,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 15:41:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:41:41,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:41:47,573 WARN L193 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-10 15:41:48,300 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:41:49,517 INFO L263 TraceCheckUtils]: 0: Hoare triple {2503#true} call ULTIMATE.init(); {2503#true} is VALID [2020-07-10 15:41:49,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-10 15:41:49,518 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2503#true} {2503#true} #55#return; {2503#true} is VALID [2020-07-10 15:41:49,518 INFO L263 TraceCheckUtils]: 3: Hoare triple {2503#true} call #t~ret2 := main(); {2503#true} is VALID [2020-07-10 15:41:49,518 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-10 15:41:49,518 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-10 15:41:49,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2020-07-10 15:41:49,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {2503#true} assume !(0 == ~cond); {2503#true} is VALID [2020-07-10 15:41:49,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-10 15:41:49,519 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2503#true} {2503#true} #59#return; {2503#true} is VALID [2020-07-10 15:41:49,519 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-10 15:41:49,519 INFO L280 TraceCheckUtils]: 11: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2020-07-10 15:41:49,519 INFO L280 TraceCheckUtils]: 12: Hoare triple {2503#true} assume !(0 == ~cond); {2503#true} is VALID [2020-07-10 15:41:49,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-10 15:41:49,520 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2503#true} {2503#true} #61#return; {2503#true} is VALID [2020-07-10 15:41:49,564 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-10 15:41:49,567 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-10 15:41:49,567 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-10 15:41:49,568 INFO L280 TraceCheckUtils]: 18: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2020-07-10 15:41:49,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {2503#true} assume !(0 == ~cond); {2503#true} is VALID [2020-07-10 15:41:49,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-10 15:41:49,571 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-10 15:41:49,573 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-10 15:41:49,575 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-10 15:41:49,577 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-10 15:41:49,577 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-10 15:41:49,577 INFO L280 TraceCheckUtils]: 26: Hoare triple {2503#true} ~cond := #in~cond; {2503#true} is VALID [2020-07-10 15:41:49,577 INFO L280 TraceCheckUtils]: 27: Hoare triple {2503#true} assume !(0 == ~cond); {2503#true} is VALID [2020-07-10 15:41:49,578 INFO L280 TraceCheckUtils]: 28: Hoare triple {2503#true} assume true; {2503#true} is VALID [2020-07-10 15:41:49,580 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-10 15:41:49,582 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-10 15:41:49,584 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-10 15:41:49,586 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-10 15:41:49,586 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-10 15:41:49,588 INFO L280 TraceCheckUtils]: 34: Hoare triple {2503#true} ~cond := #in~cond; {2611#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:41:49,590 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-10 15:41:49,592 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-10 15:41:49,594 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-10 15:41:49,596 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-10 15:41:51,720 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-10 15:41:51,722 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-10 15:41:51,725 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-10 15:41:51,727 INFO L280 TraceCheckUtils]: 42: Hoare triple {2635#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2639#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:41:51,729 INFO L280 TraceCheckUtils]: 43: Hoare triple {2639#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2504#false} is VALID [2020-07-10 15:41:51,729 INFO L280 TraceCheckUtils]: 44: Hoare triple {2504#false} assume !false; {2504#false} is VALID [2020-07-10 15:41:51,732 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-10 15:41:51,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417985974] [2020-07-10 15:41:51,733 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:41:51,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240547639] [2020-07-10 15:41:51,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:41:51,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:41:51,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058081839] [2020-07-10 15:41:51,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-10 15:41:51,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:41:51,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:41:54,261 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-10 15:41:54,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:41:54,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:41:54,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:41:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2020-07-10 15:41:54,263 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 8 states. [2020-07-10 15:42:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:42:21,900 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2020-07-10 15:42:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:42:21,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-10 15:42:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:42:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:42:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-10 15:42:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:42:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2020-07-10 15:42:21,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2020-07-10 15:42:24,425 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-10 15:42:24,426 INFO L225 Difference]: With dead ends: 68 [2020-07-10 15:42:24,426 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 15:42:24,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2020-07-10 15:42:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 15:42:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2020-07-10 15:42:24,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:42:24,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 60 states. [2020-07-10 15:42:24,626 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 60 states. [2020-07-10 15:42:24,626 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 60 states. [2020-07-10 15:42:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:42:24,629 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-10 15:42:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-10 15:42:24,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:42:24,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:42:24,630 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 66 states. [2020-07-10 15:42:24,630 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 66 states. [2020-07-10 15:42:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:42:24,633 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2020-07-10 15:42:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-07-10 15:42:24,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:42:24,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:42:24,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:42:24,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:42:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 15:42:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2020-07-10 15:42:24,636 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 45 [2020-07-10 15:42:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:42:24,637 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2020-07-10 15:42:24,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:42:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-07-10 15:42:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 15:42:24,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:42:24,638 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-10 15:42:24,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:42:24,847 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:42:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:42:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash 641277449, now seen corresponding path program 2 times [2020-07-10 15:42:24,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:42:24,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546719573] [2020-07-10 15:42:24,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:42:24,852 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:42:24,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386195275] [2020-07-10 15:42:24,852 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-10 15:42:24,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:42:24,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:42:24,893 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-10 15:42:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:42:26,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:42:27,370 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-07-10 15:42:38,202 WARN L193 SmtUtils]: Spent 8.38 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-10 15:42:45,320 WARN L193 SmtUtils]: Spent 6.49 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-10 15:42:52,235 WARN L193 SmtUtils]: Spent 4.25 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-10 15:43:00,440 WARN L193 SmtUtils]: Spent 4.71 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-10 15:43:16,961 WARN L193 SmtUtils]: Spent 4.52 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 15:43:18,127 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:43:26,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {2966#true} call ULTIMATE.init(); {2966#true} is VALID [2020-07-10 15:43:26,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {2966#true} assume true; {2966#true} is VALID [2020-07-10 15:43:26,256 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2966#true} {2966#true} #55#return; {2966#true} is VALID [2020-07-10 15:43:26,256 INFO L263 TraceCheckUtils]: 3: Hoare triple {2966#true} call #t~ret2 := main(); {2966#true} is VALID [2020-07-10 15:43:26,257 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-10 15:43:26,257 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-10 15:43:26,257 INFO L280 TraceCheckUtils]: 6: Hoare triple {2966#true} ~cond := #in~cond; {2966#true} is VALID [2020-07-10 15:43:26,257 INFO L280 TraceCheckUtils]: 7: Hoare triple {2966#true} assume !(0 == ~cond); {2966#true} is VALID [2020-07-10 15:43:26,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {2966#true} assume true; {2966#true} is VALID [2020-07-10 15:43:26,257 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2966#true} {2966#true} #59#return; {2966#true} is VALID [2020-07-10 15:43:26,257 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-10 15:43:26,258 INFO L280 TraceCheckUtils]: 11: Hoare triple {2966#true} ~cond := #in~cond; {2966#true} is VALID [2020-07-10 15:43:26,258 INFO L280 TraceCheckUtils]: 12: Hoare triple {2966#true} assume !(0 == ~cond); {2966#true} is VALID [2020-07-10 15:43:26,258 INFO L280 TraceCheckUtils]: 13: Hoare triple {2966#true} assume true; {2966#true} is VALID [2020-07-10 15:43:26,258 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2966#true} {2966#true} #61#return; {2966#true} is VALID [2020-07-10 15:43:28,657 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-10 15:43:28,659 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-10 15:43:28,659 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-10 15:43:28,661 INFO L280 TraceCheckUtils]: 18: Hoare triple {2966#true} ~cond := #in~cond; {3026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:43:28,663 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-10 15:43:28,665 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-10 15:43:28,668 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-10 15:43:28,670 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-10 15:43:28,745 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-10 15:43:28,747 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-10 15:43:28,747 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-10 15:43:28,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {2966#true} ~cond := #in~cond; {2966#true} is VALID [2020-07-10 15:43:28,747 INFO L280 TraceCheckUtils]: 27: Hoare triple {2966#true} assume !(0 == ~cond); {2966#true} is VALID [2020-07-10 15:43:28,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {2966#true} assume true; {2966#true} is VALID [2020-07-10 15:43:28,750 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-10 15:43:28,752 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-10 15:43:28,809 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-10 15:43:28,811 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-10 15:43:28,811 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-10 15:43:28,816 INFO L280 TraceCheckUtils]: 34: Hoare triple {2966#true} ~cond := #in~cond; {3026#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:43:28,818 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-10 15:43:28,825 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-10 15:43:28,827 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-10 15:43:28,830 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-10 15:43:30,922 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-10 15:43:30,924 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-10 15:43:30,926 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-10 15:43:30,929 INFO L280 TraceCheckUtils]: 42: Hoare triple {3102#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3106#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:43:30,931 INFO L280 TraceCheckUtils]: 43: Hoare triple {3106#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2967#false} is VALID [2020-07-10 15:43:30,931 INFO L280 TraceCheckUtils]: 44: Hoare triple {2967#false} assume !false; {2967#false} is VALID [2020-07-10 15:43:30,937 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-10 15:43:30,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546719573] [2020-07-10 15:43:30,937 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:43:30,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386195275] [2020-07-10 15:43:30,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:43:30,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-10 15:43:30,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626605399] [2020-07-10 15:43:30,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2020-07-10 15:43:30,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:43:30,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 15:43:35,943 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-10 15:43:35,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 15:43:35,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:43:35,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 15:43:35,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=94, Unknown=11, NotChecked=0, Total=132 [2020-07-10 15:43:35,944 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 12 states.