/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/sqrt1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:52:59,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:52:59,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:52:59,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:52:59,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:52:59,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:52:59,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:52:59,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:52:59,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:52:59,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:52:59,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:52:59,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:52:59,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:52:59,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:52:59,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:52:59,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:52:59,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:52:59,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:52:59,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:52:59,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:52:59,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:52:59,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:52:59,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:52:59,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:52:59,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:52:59,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:52:59,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:52:59,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:52:59,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:52:59,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:52:59,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:52:59,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:52:59,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:52:59,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:52:59,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:52:59,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:52:59,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:52:59,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:52:59,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:52:59,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:52:59,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:52:59,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:52:59,827 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:52:59,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:52:59,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:52:59,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:52:59,829 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:52:59,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:52:59,830 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:52:59,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:52:59,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:52:59,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:52:59,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:52:59,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:52:59,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:52:59,831 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:52:59,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:52:59,831 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:52:59,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:52:59,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:52:59,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:52:59,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:52:59,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:52:59,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:59,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:52:59,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:52:59,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:52:59,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:52:59,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:52:59,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:52:59,834 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:52:59,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:53:00,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:53:00,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:53:00,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:53:00,152 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:53:00,153 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:53:00,154 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/sqrt1.c [2020-07-17 22:53:00,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c429eea6a/322cdbeffcbb4e45a5f306ff2ddf6ad5/FLAG57e97d8e8 [2020-07-17 22:53:00,805 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:53:00,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/sqrt1.c [2020-07-17 22:53:00,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c429eea6a/322cdbeffcbb4e45a5f306ff2ddf6ad5/FLAG57e97d8e8 [2020-07-17 22:53:01,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c429eea6a/322cdbeffcbb4e45a5f306ff2ddf6ad5 [2020-07-17 22:53:01,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:53:01,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:53:01,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:53:01,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:53:01,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:53:01,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec926a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01, skipping insertion in model container [2020-07-17 22:53:01,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:53:01,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:53:01,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:53:01,423 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:53:01,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:53:01,467 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:53:01,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01 WrapperNode [2020-07-17 22:53:01,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:53:01,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:53:01,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:53:01,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:53:01,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01" (1/1) ... [2020-07-17 22:53:01,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:53:01,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:53:01,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:53:01,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:53:01,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53: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-17 22:53:01,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:53:01,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:53:01,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:53:01,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:53:01,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:53:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:53:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:53:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:53:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:53:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:53:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:53:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:53:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:53:02,009 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:53:02,010 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:53:02,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:53:02 BoogieIcfgContainer [2020-07-17 22:53:02,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:53:02,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:53:02,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:53:02,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:53:02,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:53:01" (1/3) ... [2020-07-17 22:53:02,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625c7991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:53:02, skipping insertion in model container [2020-07-17 22:53:02,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:53:01" (2/3) ... [2020-07-17 22:53:02,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625c7991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:53:02, skipping insertion in model container [2020-07-17 22:53:02,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:53:02" (3/3) ... [2020-07-17 22:53:02,030 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt1.c [2020-07-17 22:53:02,046 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:53:02,058 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:53:02,076 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:53:02,108 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:53:02,108 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:53:02,108 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:53:02,108 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:53:02,109 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:53:02,109 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:53:02,109 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:53:02,109 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:53:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-17 22:53:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:53:02,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:02,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:02,146 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1080899301, now seen corresponding path program 1 times [2020-07-17 22:53:02,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:02,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269756178] [2020-07-17 22:53:02,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:02,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-17 22:53:02,317 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #50#return; {27#true} is VALID [2020-07-17 22:53:02,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-17 22:53:02,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-17 22:53:02,321 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #50#return; {27#true} is VALID [2020-07-17 22:53:02,322 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret1 := main(); {27#true} is VALID [2020-07-17 22:53:02,322 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~a~0 := 0;~s~0 := 1;~t~0 := 1; {27#true} is VALID [2020-07-17 22:53:02,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} assume false; {28#false} is VALID [2020-07-17 22:53:02,326 INFO L263 TraceCheckUtils]: 6: Hoare triple {28#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {28#false} is VALID [2020-07-17 22:53:02,326 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-17 22:53:02,327 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-17 22:53:02,327 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-17 22:53:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:53:02,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269756178] [2020-07-17 22:53:02,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:53:02,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:53:02,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138475916] [2020-07-17 22:53:02,339 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:53:02,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:02,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:53:02,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:02,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:53:02,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:53:02,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:53:02,399 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-17 22:53:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:02,595 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2020-07-17 22:53:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:53:02,595 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:53:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:53:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2020-07-17 22:53:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:53:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2020-07-17 22:53:02,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2020-07-17 22:53:02,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:02,799 INFO L225 Difference]: With dead ends: 43 [2020-07-17 22:53:02,799 INFO L226 Difference]: Without dead ends: 19 [2020-07-17 22:53:02,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:53:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-17 22:53:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-17 22:53:02,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:02,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-17 22:53:02,869 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:53:02,869 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:53:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:02,876 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-17 22:53:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-07-17 22:53:02,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:02,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:02,878 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:53:02,878 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:53:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:02,884 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-17 22:53:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-07-17 22:53:02,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:02,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:02,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:02,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:53:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-07-17 22:53:02,893 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2020-07-17 22:53:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:02,893 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-17 22:53:02,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:53:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-07-17 22:53:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:53:02,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:02,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:02,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:53:02,895 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1082567597, now seen corresponding path program 1 times [2020-07-17 22:53:02,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:02,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520425803] [2020-07-17 22:53:02,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:03,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {165#true} assume true; {165#true} is VALID [2020-07-17 22:53:03,103 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {165#true} {165#true} #50#return; {165#true} is VALID [2020-07-17 22:53:03,103 INFO L263 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {165#true} is VALID [2020-07-17 22:53:03,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2020-07-17 22:53:03,105 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #50#return; {165#true} is VALID [2020-07-17 22:53:03,105 INFO L263 TraceCheckUtils]: 3: Hoare triple {165#true} call #t~ret1 := main(); {165#true} is VALID [2020-07-17 22:53:03,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {165#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~a~0 := 0;~s~0 := 1;~t~0 := 1; {169#(and (<= main_~t~0 (+ (* 2 main_~a~0) 1)) (<= (+ (* 2 main_~a~0) 1) main_~t~0))} is VALID [2020-07-17 22:53:03,110 INFO L280 TraceCheckUtils]: 5: Hoare triple {169#(and (<= main_~t~0 (+ (* 2 main_~a~0) 1)) (<= (+ (* 2 main_~a~0) 1) main_~t~0))} assume !false; {169#(and (<= main_~t~0 (+ (* 2 main_~a~0) 1)) (<= (+ (* 2 main_~a~0) 1) main_~t~0))} is VALID [2020-07-17 22:53:03,113 INFO L263 TraceCheckUtils]: 6: Hoare triple {169#(and (<= main_~t~0 (+ (* 2 main_~a~0) 1)) (<= (+ (* 2 main_~a~0) 1) main_~t~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {170#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:03,114 INFO L280 TraceCheckUtils]: 7: Hoare triple {170#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {171#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:53:03,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {171#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {166#false} is VALID [2020-07-17 22:53:03,116 INFO L280 TraceCheckUtils]: 9: Hoare triple {166#false} assume !false; {166#false} is VALID [2020-07-17 22:53:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:53:03,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520425803] [2020-07-17 22:53:03,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:53:03,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:53:03,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011200128] [2020-07-17 22:53:03,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:53:03,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:03,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:53:03,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:03,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:53:03,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:03,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:53:03,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:53:03,144 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-07-17 22:53:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:03,448 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-17 22:53:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:53:03,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:53:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:53:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-17 22:53:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:53:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-17 22:53:03,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2020-07-17 22:53:03,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:03,518 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:53:03,518 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:53:03,521 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:53:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:53:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 22:53:03,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:03,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-17 22:53:03,550 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:53:03,550 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:53:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:03,554 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-17 22:53:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-17 22:53:03,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:03,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:03,556 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:53:03,556 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:53:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:03,560 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-17 22:53:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-17 22:53:03,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:03,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:03,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:03,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:53:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-17 22:53:03,565 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2020-07-17 22:53:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:03,565 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-17 22:53:03,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:53:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-17 22:53:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:53:03,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:03,567 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:03,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:53:03,568 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash 725386554, now seen corresponding path program 1 times [2020-07-17 22:53:03,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:03,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007384060] [2020-07-17 22:53:03,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:03,584 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:03,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834055195] [2020-07-17 22:53:03,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:03,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:53:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:03,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:03,889 INFO L263 TraceCheckUtils]: 0: Hoare triple {296#true} call ULTIMATE.init(); {296#true} is VALID [2020-07-17 22:53:03,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {296#true} assume true; {296#true} is VALID [2020-07-17 22:53:03,890 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {296#true} {296#true} #50#return; {296#true} is VALID [2020-07-17 22:53:03,890 INFO L263 TraceCheckUtils]: 3: Hoare triple {296#true} call #t~ret1 := main(); {296#true} is VALID [2020-07-17 22:53:03,892 INFO L280 TraceCheckUtils]: 4: Hoare triple {296#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~a~0 := 0;~s~0 := 1;~t~0 := 1; {313#(and (= 1 main_~s~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:03,893 INFO L280 TraceCheckUtils]: 5: Hoare triple {313#(and (= 1 main_~s~0) (= 0 main_~a~0))} assume !false; {313#(and (= 1 main_~s~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:03,893 INFO L263 TraceCheckUtils]: 6: Hoare triple {313#(and (= 1 main_~s~0) (= 0 main_~a~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {296#true} is VALID [2020-07-17 22:53:03,894 INFO L280 TraceCheckUtils]: 7: Hoare triple {296#true} ~cond := #in~cond; {296#true} is VALID [2020-07-17 22:53:03,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {296#true} assume !(0 == ~cond); {296#true} is VALID [2020-07-17 22:53:03,895 INFO L280 TraceCheckUtils]: 9: Hoare triple {296#true} assume true; {296#true} is VALID [2020-07-17 22:53:03,897 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {296#true} {313#(and (= 1 main_~s~0) (= 0 main_~a~0))} #54#return; {313#(and (= 1 main_~s~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:03,898 INFO L263 TraceCheckUtils]: 11: Hoare triple {313#(and (= 1 main_~s~0) (= 0 main_~a~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:53:03,900 INFO L280 TraceCheckUtils]: 12: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:03,902 INFO L280 TraceCheckUtils]: 13: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {297#false} is VALID [2020-07-17 22:53:03,902 INFO L280 TraceCheckUtils]: 14: Hoare triple {297#false} assume !false; {297#false} is VALID [2020-07-17 22:53:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:53:03,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007384060] [2020-07-17 22:53:03,906 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:03,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834055195] [2020-07-17 22:53:03,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:53:03,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:53:03,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520087023] [2020-07-17 22:53:03,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-17 22:53:03,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:03,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:53:03,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:03,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:53:03,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:03,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:53:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:53:03,938 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2020-07-17 22:53:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:04,284 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-07-17 22:53:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:53:04,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-17 22:53:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:53:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-17 22:53:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:53:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-17 22:53:04,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-17 22:53:04,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:04,371 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:53:04,371 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:53:04,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:53:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:53:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-17 22:53:04,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:04,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-17 22:53:04,427 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-17 22:53:04,427 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-17 22:53:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:04,433 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-07-17 22:53:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2020-07-17 22:53:04,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:04,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:04,435 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-17 22:53:04,435 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-17 22:53:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:04,441 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-07-17 22:53:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2020-07-17 22:53:04,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:04,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:04,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:04,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:53:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-07-17 22:53:04,449 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 15 [2020-07-17 22:53:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:04,450 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-07-17 22:53:04,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:53:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-17 22:53:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:53:04,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:04,452 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:04,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:53:04,667 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash -436292723, now seen corresponding path program 1 times [2020-07-17 22:53:04,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:04,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365308271] [2020-07-17 22:53:04,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:04,695 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:04,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638897597] [2020-07-17 22:53:04,696 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-17 22:53:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:04,738 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:53:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:04,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:04,844 INFO L263 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {529#true} is VALID [2020-07-17 22:53:04,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {529#true} assume true; {529#true} is VALID [2020-07-17 22:53:04,845 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {529#true} {529#true} #50#return; {529#true} is VALID [2020-07-17 22:53:04,846 INFO L263 TraceCheckUtils]: 3: Hoare triple {529#true} call #t~ret1 := main(); {529#true} is VALID [2020-07-17 22:53:04,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {529#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~a~0 := 0;~s~0 := 1;~t~0 := 1; {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:04,850 INFO L280 TraceCheckUtils]: 5: Hoare triple {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} assume !false; {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:04,850 INFO L263 TraceCheckUtils]: 6: Hoare triple {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {529#true} is VALID [2020-07-17 22:53:04,851 INFO L280 TraceCheckUtils]: 7: Hoare triple {529#true} ~cond := #in~cond; {529#true} is VALID [2020-07-17 22:53:04,851 INFO L280 TraceCheckUtils]: 8: Hoare triple {529#true} assume !(0 == ~cond); {529#true} is VALID [2020-07-17 22:53:04,852 INFO L280 TraceCheckUtils]: 9: Hoare triple {529#true} assume true; {529#true} is VALID [2020-07-17 22:53:04,854 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {529#true} {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} #54#return; {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:04,855 INFO L263 TraceCheckUtils]: 11: Hoare triple {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {529#true} is VALID [2020-07-17 22:53:04,855 INFO L280 TraceCheckUtils]: 12: Hoare triple {529#true} ~cond := #in~cond; {529#true} is VALID [2020-07-17 22:53:04,856 INFO L280 TraceCheckUtils]: 13: Hoare triple {529#true} assume !(0 == ~cond); {529#true} is VALID [2020-07-17 22:53:04,856 INFO L280 TraceCheckUtils]: 14: Hoare triple {529#true} assume true; {529#true} is VALID [2020-07-17 22:53:04,858 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {529#true} {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} #56#return; {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:04,860 INFO L263 TraceCheckUtils]: 16: Hoare triple {546#(and (= 1 main_~s~0) (= 1 main_~t~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:53:04,861 INFO L280 TraceCheckUtils]: 17: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:04,862 INFO L280 TraceCheckUtils]: 18: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {530#false} is VALID [2020-07-17 22:53:04,863 INFO L280 TraceCheckUtils]: 19: Hoare triple {530#false} assume !false; {530#false} is VALID [2020-07-17 22:53:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:53:04,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365308271] [2020-07-17 22:53:04,866 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:04,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638897597] [2020-07-17 22:53:04,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:53:04,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:53:04,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918684582] [2020-07-17 22:53:04,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:53:04,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:04,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:53:04,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:04,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:53:04,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:04,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:53:04,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:53:04,916 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 5 states. [2020-07-17 22:53:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:05,201 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-17 22:53:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:53:05,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:53:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:53:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-17 22:53:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:53:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-17 22:53:05,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-17 22:53:05,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:05,276 INFO L225 Difference]: With dead ends: 41 [2020-07-17 22:53:05,277 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:53:05,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:53:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:53:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-17 22:53:05,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:05,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-17 22:53:05,339 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:53:05,339 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:53:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:05,344 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-17 22:53:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-17 22:53:05,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:05,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:05,347 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-17 22:53:05,348 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-17 22:53:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:05,352 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-17 22:53:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-17 22:53:05,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:05,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:05,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:05,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:53:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-17 22:53:05,357 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2020-07-17 22:53:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:05,357 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-17 22:53:05,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:53:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-17 22:53:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:53:05,359 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:05,359 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:05,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:05,573 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2135406385, now seen corresponding path program 1 times [2020-07-17 22:53:05,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:05,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569010159] [2020-07-17 22:53:05,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:05,588 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:05,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046166676] [2020-07-17 22:53:05,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:05,623 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-17 22:53:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:05,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:05,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {785#true} call ULTIMATE.init(); {785#true} is VALID [2020-07-17 22:53:05,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-17 22:53:05,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {785#true} {785#true} #50#return; {785#true} is VALID [2020-07-17 22:53:05,755 INFO L263 TraceCheckUtils]: 3: Hoare triple {785#true} call #t~ret1 := main(); {785#true} is VALID [2020-07-17 22:53:05,757 INFO L280 TraceCheckUtils]: 4: Hoare triple {785#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~a~0 := 0;~s~0 := 1;~t~0 := 1; {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:05,758 INFO L280 TraceCheckUtils]: 5: Hoare triple {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} assume !false; {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:05,758 INFO L263 TraceCheckUtils]: 6: Hoare triple {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {785#true} is VALID [2020-07-17 22:53:05,758 INFO L280 TraceCheckUtils]: 7: Hoare triple {785#true} ~cond := #in~cond; {785#true} is VALID [2020-07-17 22:53:05,758 INFO L280 TraceCheckUtils]: 8: Hoare triple {785#true} assume !(0 == ~cond); {785#true} is VALID [2020-07-17 22:53:05,759 INFO L280 TraceCheckUtils]: 9: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-17 22:53:05,760 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {785#true} {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} #54#return; {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:05,760 INFO L263 TraceCheckUtils]: 11: Hoare triple {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {785#true} is VALID [2020-07-17 22:53:05,761 INFO L280 TraceCheckUtils]: 12: Hoare triple {785#true} ~cond := #in~cond; {785#true} is VALID [2020-07-17 22:53:05,761 INFO L280 TraceCheckUtils]: 13: Hoare triple {785#true} assume !(0 == ~cond); {785#true} is VALID [2020-07-17 22:53:05,761 INFO L280 TraceCheckUtils]: 14: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-17 22:53:05,762 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {785#true} {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} #56#return; {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:05,763 INFO L263 TraceCheckUtils]: 16: Hoare triple {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {785#true} is VALID [2020-07-17 22:53:05,763 INFO L280 TraceCheckUtils]: 17: Hoare triple {785#true} ~cond := #in~cond; {785#true} is VALID [2020-07-17 22:53:05,763 INFO L280 TraceCheckUtils]: 18: Hoare triple {785#true} assume !(0 == ~cond); {785#true} is VALID [2020-07-17 22:53:05,763 INFO L280 TraceCheckUtils]: 19: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-17 22:53:05,765 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {785#true} {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} #58#return; {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:05,767 INFO L280 TraceCheckUtils]: 21: Hoare triple {802#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {854#(and (= 4 main_~s~0) (= 1 main_~a~0))} is VALID [2020-07-17 22:53:05,768 INFO L280 TraceCheckUtils]: 22: Hoare triple {854#(and (= 4 main_~s~0) (= 1 main_~a~0))} assume !false; {854#(and (= 4 main_~s~0) (= 1 main_~a~0))} is VALID [2020-07-17 22:53:05,768 INFO L263 TraceCheckUtils]: 23: Hoare triple {854#(and (= 4 main_~s~0) (= 1 main_~a~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {785#true} is VALID [2020-07-17 22:53:05,769 INFO L280 TraceCheckUtils]: 24: Hoare triple {785#true} ~cond := #in~cond; {785#true} is VALID [2020-07-17 22:53:05,769 INFO L280 TraceCheckUtils]: 25: Hoare triple {785#true} assume !(0 == ~cond); {785#true} is VALID [2020-07-17 22:53:05,769 INFO L280 TraceCheckUtils]: 26: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-17 22:53:05,770 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {785#true} {854#(and (= 4 main_~s~0) (= 1 main_~a~0))} #54#return; {854#(and (= 4 main_~s~0) (= 1 main_~a~0))} is VALID [2020-07-17 22:53:05,772 INFO L263 TraceCheckUtils]: 28: Hoare triple {854#(and (= 4 main_~s~0) (= 1 main_~a~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {876#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:53:05,772 INFO L280 TraceCheckUtils]: 29: Hoare triple {876#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:05,773 INFO L280 TraceCheckUtils]: 30: Hoare triple {880#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {786#false} is VALID [2020-07-17 22:53:05,773 INFO L280 TraceCheckUtils]: 31: Hoare triple {786#false} assume !false; {786#false} is VALID [2020-07-17 22:53:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-17 22:53:05,776 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569010159] [2020-07-17 22:53:05,776 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:05,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046166676] [2020-07-17 22:53:05,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:53:05,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 22:53:05,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238002824] [2020-07-17 22:53:05,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-17 22:53:05,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:05,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:53:05,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:05,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:53:05,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:05,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:53:05,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:53:05,814 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 6 states. [2020-07-17 22:53:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:06,293 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-17 22:53:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:53:06,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-17 22:53:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:53:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-17 22:53:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:53:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-17 22:53:06,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-17 22:53:06,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:06,389 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:53:06,389 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 22:53:06,392 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:53:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 22:53:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-17 22:53:06,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:06,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-17 22:53:06,453 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-17 22:53:06,454 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-17 22:53:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:06,458 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2020-07-17 22:53:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2020-07-17 22:53:06,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:06,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:06,460 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-17 22:53:06,460 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-17 22:53:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:06,464 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2020-07-17 22:53:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2020-07-17 22:53:06,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:06,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:06,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:06,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-17 22:53:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2020-07-17 22:53:06,469 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 32 [2020-07-17 22:53:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:06,469 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2020-07-17 22:53:06,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:53:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2020-07-17 22:53:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:53:06,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:06,471 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:06,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:06,673 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2069437160, now seen corresponding path program 2 times [2020-07-17 22:53:06,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:06,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219247200] [2020-07-17 22:53:06,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:06,687 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:06,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319166314] [2020-07-17 22:53:06,688 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:06,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:53:06,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:53:06,738 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:53:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:06,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:06,863 INFO L263 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2020-07-17 22:53:06,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-17 22:53:06,864 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1152#true} {1152#true} #50#return; {1152#true} is VALID [2020-07-17 22:53:06,864 INFO L263 TraceCheckUtils]: 3: Hoare triple {1152#true} call #t~ret1 := main(); {1152#true} is VALID [2020-07-17 22:53:06,865 INFO L280 TraceCheckUtils]: 4: Hoare triple {1152#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:06,865 INFO L280 TraceCheckUtils]: 5: Hoare triple {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} assume !false; {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:06,866 INFO L263 TraceCheckUtils]: 6: Hoare triple {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1152#true} is VALID [2020-07-17 22:53:06,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-17 22:53:06,866 INFO L280 TraceCheckUtils]: 8: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-17 22:53:06,866 INFO L280 TraceCheckUtils]: 9: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-17 22:53:06,868 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1152#true} {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} #54#return; {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:06,868 INFO L263 TraceCheckUtils]: 11: Hoare triple {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1152#true} is VALID [2020-07-17 22:53:06,868 INFO L280 TraceCheckUtils]: 12: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-17 22:53:06,869 INFO L280 TraceCheckUtils]: 13: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-17 22:53:06,869 INFO L280 TraceCheckUtils]: 14: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-17 22:53:06,871 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1152#true} {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} #56#return; {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:06,871 INFO L263 TraceCheckUtils]: 16: Hoare triple {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1152#true} is VALID [2020-07-17 22:53:06,872 INFO L280 TraceCheckUtils]: 17: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-17 22:53:06,872 INFO L280 TraceCheckUtils]: 18: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-17 22:53:06,872 INFO L280 TraceCheckUtils]: 19: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-17 22:53:06,874 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1152#true} {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} #58#return; {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} is VALID [2020-07-17 22:53:06,875 INFO L280 TraceCheckUtils]: 21: Hoare triple {1169#(and (= 1 main_~s~0) (= 1 main_~t~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} is VALID [2020-07-17 22:53:06,875 INFO L280 TraceCheckUtils]: 22: Hoare triple {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} assume !false; {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} is VALID [2020-07-17 22:53:06,875 INFO L263 TraceCheckUtils]: 23: Hoare triple {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1152#true} is VALID [2020-07-17 22:53:06,876 INFO L280 TraceCheckUtils]: 24: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-17 22:53:06,876 INFO L280 TraceCheckUtils]: 25: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-17 22:53:06,876 INFO L280 TraceCheckUtils]: 26: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-17 22:53:06,878 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1152#true} {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} #54#return; {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} is VALID [2020-07-17 22:53:06,878 INFO L263 TraceCheckUtils]: 28: Hoare triple {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1152#true} is VALID [2020-07-17 22:53:06,879 INFO L280 TraceCheckUtils]: 29: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-17 22:53:06,879 INFO L280 TraceCheckUtils]: 30: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-17 22:53:06,879 INFO L280 TraceCheckUtils]: 31: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-17 22:53:06,882 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1152#true} {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} #56#return; {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} is VALID [2020-07-17 22:53:06,887 INFO L263 TraceCheckUtils]: 33: Hoare triple {1221#(and (= 3 main_~t~0) (= (+ main_~t~0 1) main_~s~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:53:06,888 INFO L280 TraceCheckUtils]: 34: Hoare triple {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:06,889 INFO L280 TraceCheckUtils]: 35: Hoare triple {1262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1153#false} is VALID [2020-07-17 22:53:06,889 INFO L280 TraceCheckUtils]: 36: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2020-07-17 22:53:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-17 22:53:06,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219247200] [2020-07-17 22:53:06,892 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:06,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319166314] [2020-07-17 22:53:06,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:53:06,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 22:53:06,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342952386] [2020-07-17 22:53:06,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-17 22:53:06,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:06,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:53:06,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:06,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:53:06,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:53:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:53:06,947 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 6 states. [2020-07-17 22:53:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:07,396 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2020-07-17 22:53:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:53:07,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-17 22:53:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:53:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-17 22:53:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:53:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-17 22:53:07,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-17 22:53:07,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:07,501 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:53:07,501 INFO L226 Difference]: Without dead ends: 53 [2020-07-17 22:53:07,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:53:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-17 22:53:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-17 22:53:07,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:07,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-17 22:53:07,553 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-17 22:53:07,553 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-17 22:53:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:07,557 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-17 22:53:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-17 22:53:07,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:07,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:07,558 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-17 22:53:07,558 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-17 22:53:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:07,561 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-17 22:53:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-17 22:53:07,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:07,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:07,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:07,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-17 22:53:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-07-17 22:53:07,566 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 37 [2020-07-17 22:53:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:07,566 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-07-17 22:53:07,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:53:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-17 22:53:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-17 22:53:07,568 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:07,568 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:07,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:07,783 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash -121404966, now seen corresponding path program 3 times [2020-07-17 22:53:07,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:07,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476564035] [2020-07-17 22:53:07,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:07,795 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:07,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553910518] [2020-07-17 22:53:07,796 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:07,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:53:07,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:53:07,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-17 22:53:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:53:07,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:08,032 INFO L263 TraceCheckUtils]: 0: Hoare triple {1542#true} call ULTIMATE.init(); {1542#true} is VALID [2020-07-17 22:53:08,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-17 22:53:08,033 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1542#true} {1542#true} #50#return; {1542#true} is VALID [2020-07-17 22:53:08,033 INFO L263 TraceCheckUtils]: 3: Hoare triple {1542#true} call #t~ret1 := main(); {1542#true} is VALID [2020-07-17 22:53:08,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {1542#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:08,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} assume !false; {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:08,037 INFO L263 TraceCheckUtils]: 6: Hoare triple {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1542#true} is VALID [2020-07-17 22:53:08,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-17 22:53:08,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-17 22:53:08,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-17 22:53:08,039 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1542#true} {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} #54#return; {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:08,039 INFO L263 TraceCheckUtils]: 11: Hoare triple {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1542#true} is VALID [2020-07-17 22:53:08,039 INFO L280 TraceCheckUtils]: 12: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-17 22:53:08,040 INFO L280 TraceCheckUtils]: 13: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-17 22:53:08,040 INFO L280 TraceCheckUtils]: 14: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-17 22:53:08,041 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1542#true} {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} #56#return; {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:08,042 INFO L263 TraceCheckUtils]: 16: Hoare triple {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1542#true} is VALID [2020-07-17 22:53:08,042 INFO L280 TraceCheckUtils]: 17: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-17 22:53:08,042 INFO L280 TraceCheckUtils]: 18: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-17 22:53:08,042 INFO L280 TraceCheckUtils]: 19: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-17 22:53:08,043 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1542#true} {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} #58#return; {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} is VALID [2020-07-17 22:53:08,045 INFO L280 TraceCheckUtils]: 21: Hoare triple {1559#(and (= 1 main_~s~0) (= 1 main_~t~0) (= 0 main_~a~0))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2020-07-17 22:53:08,046 INFO L280 TraceCheckUtils]: 22: Hoare triple {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} assume !false; {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2020-07-17 22:53:08,047 INFO L263 TraceCheckUtils]: 23: Hoare triple {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1542#true} is VALID [2020-07-17 22:53:08,047 INFO L280 TraceCheckUtils]: 24: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-17 22:53:08,047 INFO L280 TraceCheckUtils]: 25: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-17 22:53:08,048 INFO L280 TraceCheckUtils]: 26: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-17 22:53:08,049 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1542#true} {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} #54#return; {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2020-07-17 22:53:08,049 INFO L263 TraceCheckUtils]: 28: Hoare triple {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1542#true} is VALID [2020-07-17 22:53:08,049 INFO L280 TraceCheckUtils]: 29: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-17 22:53:08,050 INFO L280 TraceCheckUtils]: 30: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-17 22:53:08,050 INFO L280 TraceCheckUtils]: 31: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-17 22:53:08,051 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1542#true} {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} #56#return; {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2020-07-17 22:53:08,051 INFO L263 TraceCheckUtils]: 33: Hoare triple {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1542#true} is VALID [2020-07-17 22:53:08,052 INFO L280 TraceCheckUtils]: 34: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-17 22:53:08,052 INFO L280 TraceCheckUtils]: 35: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-17 22:53:08,052 INFO L280 TraceCheckUtils]: 36: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-17 22:53:08,053 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1542#true} {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} #58#return; {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} is VALID [2020-07-17 22:53:08,054 INFO L280 TraceCheckUtils]: 38: Hoare triple {1611#(and (= 3 main_~t~0) (= 1 main_~a~0) (= main_~s~0 (+ main_~t~0 1)))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1663#(and (= 2 main_~a~0) (= 9 main_~s~0))} is VALID [2020-07-17 22:53:08,055 INFO L280 TraceCheckUtils]: 39: Hoare triple {1663#(and (= 2 main_~a~0) (= 9 main_~s~0))} assume !false; {1663#(and (= 2 main_~a~0) (= 9 main_~s~0))} is VALID [2020-07-17 22:53:08,056 INFO L263 TraceCheckUtils]: 40: Hoare triple {1663#(and (= 2 main_~a~0) (= 9 main_~s~0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1542#true} is VALID [2020-07-17 22:53:08,056 INFO L280 TraceCheckUtils]: 41: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-17 22:53:08,056 INFO L280 TraceCheckUtils]: 42: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-17 22:53:08,057 INFO L280 TraceCheckUtils]: 43: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-17 22:53:08,058 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1542#true} {1663#(and (= 2 main_~a~0) (= 9 main_~s~0))} #54#return; {1663#(and (= 2 main_~a~0) (= 9 main_~s~0))} is VALID [2020-07-17 22:53:08,061 INFO L263 TraceCheckUtils]: 45: Hoare triple {1663#(and (= 2 main_~a~0) (= 9 main_~s~0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:53:08,062 INFO L280 TraceCheckUtils]: 46: Hoare triple {1685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:08,063 INFO L280 TraceCheckUtils]: 47: Hoare triple {1689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1543#false} is VALID [2020-07-17 22:53:08,063 INFO L280 TraceCheckUtils]: 48: Hoare triple {1543#false} assume !false; {1543#false} is VALID [2020-07-17 22:53:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-17 22:53:08,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476564035] [2020-07-17 22:53:08,067 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:08,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553910518] [2020-07-17 22:53:08,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:53:08,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:53:08,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435758219] [2020-07-17 22:53:08,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2020-07-17 22:53:08,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:08,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:53:08,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:08,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:53:08,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:08,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:53:08,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:53:08,130 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 7 states. [2020-07-17 22:53:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:08,884 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2020-07-17 22:53:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:53:08,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2020-07-17 22:53:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:53:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-07-17 22:53:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:53:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-07-17 22:53:08,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2020-07-17 22:53:09,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:09,040 INFO L225 Difference]: With dead ends: 71 [2020-07-17 22:53:09,040 INFO L226 Difference]: Without dead ends: 69 [2020-07-17 22:53:09,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:53:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-17 22:53:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2020-07-17 22:53:09,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:09,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2020-07-17 22:53:09,125 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2020-07-17 22:53:09,126 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2020-07-17 22:53:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:09,131 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2020-07-17 22:53:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2020-07-17 22:53:09,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:09,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:09,132 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2020-07-17 22:53:09,132 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2020-07-17 22:53:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:09,137 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2020-07-17 22:53:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2020-07-17 22:53:09,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:09,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:09,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:09,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-17 22:53:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2020-07-17 22:53:09,142 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 49 [2020-07-17 22:53:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:09,142 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2020-07-17 22:53:09,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:53:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2020-07-17 22:53:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 22:53:09,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:09,144 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:09,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:53:09,359 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1300456723, now seen corresponding path program 4 times [2020-07-17 22:53:09,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:09,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308994275] [2020-07-17 22:53:09,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:09,374 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:09,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473513103] [2020-07-17 22:53:09,375 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:09,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:53:09,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:53:09,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-17 22:53:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-17 22:53:11,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:13,832 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:53:30,717 WARN L193 SmtUtils]: Spent 8.88 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-17 22:53:30,732 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:53:50,264 WARN L193 SmtUtils]: Spent 8.29 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-17 22:53:52,343 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:54:00,550 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~t~0_BEFORE_CALL_21 Int)) (let ((.cse0 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2))) (and (= v_main_~t~0_BEFORE_CALL_21 (+ (* 2 .cse0) 1)) (not (= (+ (* 4 (* .cse0 .cse0)) (* 8 .cse0) 3) (+ (* 2 v_main_~t~0_BEFORE_CALL_21) (* v_main_~t~0_BEFORE_CALL_21 v_main_~t~0_BEFORE_CALL_21))))))) is different from false [2020-07-17 22:54:00,570 INFO L263 TraceCheckUtils]: 0: Hoare triple {2043#true} call ULTIMATE.init(); {2043#true} is VALID [2020-07-17 22:54:00,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-17 22:54:00,570 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2043#true} {2043#true} #50#return; {2043#true} is VALID [2020-07-17 22:54:00,571 INFO L263 TraceCheckUtils]: 3: Hoare triple {2043#true} call #t~ret1 := main(); {2043#true} is VALID [2020-07-17 22:54:00,571 INFO L280 TraceCheckUtils]: 4: Hoare triple {2043#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2043#true} is VALID [2020-07-17 22:54:00,571 INFO L280 TraceCheckUtils]: 5: Hoare triple {2043#true} assume !false; {2043#true} is VALID [2020-07-17 22:54:00,571 INFO L263 TraceCheckUtils]: 6: Hoare triple {2043#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2043#true} is VALID [2020-07-17 22:54:00,572 INFO L280 TraceCheckUtils]: 7: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-17 22:54:00,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-17 22:54:00,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-17 22:54:00,572 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2043#true} {2043#true} #54#return; {2043#true} is VALID [2020-07-17 22:54:00,572 INFO L263 TraceCheckUtils]: 11: Hoare triple {2043#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2043#true} is VALID [2020-07-17 22:54:00,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-17 22:54:00,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-17 22:54:00,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-17 22:54:00,573 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2043#true} {2043#true} #56#return; {2043#true} is VALID [2020-07-17 22:54:00,573 INFO L263 TraceCheckUtils]: 16: Hoare triple {2043#true} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2043#true} is VALID [2020-07-17 22:54:00,574 INFO L280 TraceCheckUtils]: 17: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-17 22:54:00,574 INFO L280 TraceCheckUtils]: 18: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-17 22:54:00,574 INFO L280 TraceCheckUtils]: 19: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-17 22:54:00,574 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2043#true} {2043#true} #58#return; {2043#true} is VALID [2020-07-17 22:54:00,575 INFO L280 TraceCheckUtils]: 21: Hoare triple {2043#true} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2043#true} is VALID [2020-07-17 22:54:00,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {2043#true} assume !false; {2043#true} is VALID [2020-07-17 22:54:00,575 INFO L263 TraceCheckUtils]: 23: Hoare triple {2043#true} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2043#true} is VALID [2020-07-17 22:54:00,575 INFO L280 TraceCheckUtils]: 24: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-17 22:54:00,576 INFO L280 TraceCheckUtils]: 25: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-17 22:54:00,576 INFO L280 TraceCheckUtils]: 26: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-17 22:54:00,576 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2043#true} {2043#true} #54#return; {2043#true} is VALID [2020-07-17 22:54:00,576 INFO L263 TraceCheckUtils]: 28: Hoare triple {2043#true} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2043#true} is VALID [2020-07-17 22:54:00,578 INFO L280 TraceCheckUtils]: 29: Hoare triple {2043#true} ~cond := #in~cond; {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:54:00,578 INFO L280 TraceCheckUtils]: 30: Hoare triple {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:54:00,579 INFO L280 TraceCheckUtils]: 31: Hoare triple {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:54:00,580 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} {2043#true} #56#return; {2146#(= (+ (* 2 main_~a~0) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2020-07-17 22:54:00,580 INFO L263 TraceCheckUtils]: 33: Hoare triple {2146#(= (+ (* 2 main_~a~0) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2043#true} is VALID [2020-07-17 22:54:00,580 INFO L280 TraceCheckUtils]: 34: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-17 22:54:00,581 INFO L280 TraceCheckUtils]: 35: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-17 22:54:00,581 INFO L280 TraceCheckUtils]: 36: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-17 22:54:00,582 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2043#true} {2146#(= (+ (* 2 main_~a~0) (* main_~a~0 main_~a~0) 1) main_~s~0)} #58#return; {2146#(= (+ (* 2 main_~a~0) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2020-07-17 22:54:02,612 INFO L280 TraceCheckUtils]: 38: Hoare triple {2146#(= (+ (* 2 main_~a~0) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2165#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is UNKNOWN [2020-07-17 22:54:02,613 INFO L280 TraceCheckUtils]: 39: Hoare triple {2165#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} assume !false; {2165#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} is VALID [2020-07-17 22:54:02,613 INFO L263 TraceCheckUtils]: 40: Hoare triple {2165#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2043#true} is VALID [2020-07-17 22:54:02,614 INFO L280 TraceCheckUtils]: 41: Hoare triple {2043#true} ~cond := #in~cond; {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:54:02,614 INFO L280 TraceCheckUtils]: 42: Hoare triple {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:54:02,615 INFO L280 TraceCheckUtils]: 43: Hoare triple {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:54:02,616 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} {2165#(= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0)))} #54#return; {2184#(and (= (+ (* 2 main_~a~0) 1) main_~t~0) (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))))} is VALID [2020-07-17 22:54:02,616 INFO L263 TraceCheckUtils]: 45: Hoare triple {2184#(and (= (+ (* 2 main_~a~0) 1) main_~t~0) (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2043#true} is VALID [2020-07-17 22:54:02,617 INFO L280 TraceCheckUtils]: 46: Hoare triple {2043#true} ~cond := #in~cond; {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:54:02,617 INFO L280 TraceCheckUtils]: 47: Hoare triple {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:54:02,618 INFO L280 TraceCheckUtils]: 48: Hoare triple {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:54:04,633 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2139#(not (= 0 |__VERIFIER_assert_#in~cond|))} {2184#(and (= (+ (* 2 main_~a~0) 1) main_~t~0) (= main_~s~0 (+ main_~t~0 (* main_~a~0 main_~a~0))))} #56#return; {2200#(and (= main_~s~0 (+ main_~t~0 (* (div (+ main_~t~0 (- 1)) 2) (div (+ main_~t~0 (- 1)) 2)))) (= main_~s~0 (+ (* 2 (div (+ main_~t~0 (- 1)) 2)) (* (div (+ main_~t~0 (- 1)) 2) (div (+ main_~t~0 (- 1)) 2)) 1)))} is UNKNOWN [2020-07-17 22:54:04,663 INFO L263 TraceCheckUtils]: 50: Hoare triple {2200#(and (= main_~s~0 (+ main_~t~0 (* (div (+ main_~t~0 (- 1)) 2) (div (+ main_~t~0 (- 1)) 2)))) (= main_~s~0 (+ (* 2 (div (+ main_~t~0 (- 1)) 2)) (* (div (+ main_~t~0 (- 1)) 2) (div (+ main_~t~0 (- 1)) 2)) 1)))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2204#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~t~0_BEFORE_CALL_21 Int)) (and (= v_main_~t~0_BEFORE_CALL_21 (+ (* 2 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 1)) (not (= (+ (* 4 (* (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2) (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2))) (* 8 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 3) (+ (* 2 v_main_~t~0_BEFORE_CALL_21) (* v_main_~t~0_BEFORE_CALL_21 v_main_~t~0_BEFORE_CALL_21))))))) (<= 1 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:54:04,664 INFO L280 TraceCheckUtils]: 51: Hoare triple {2204#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~t~0_BEFORE_CALL_21 Int)) (and (= v_main_~t~0_BEFORE_CALL_21 (+ (* 2 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 1)) (not (= (+ (* 4 (* (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2) (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2))) (* 8 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 3) (+ (* 2 v_main_~t~0_BEFORE_CALL_21) (* v_main_~t~0_BEFORE_CALL_21 v_main_~t~0_BEFORE_CALL_21))))))) (<= 1 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2208#(or (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~t~0_BEFORE_CALL_21 Int)) (and (= v_main_~t~0_BEFORE_CALL_21 (+ (* 2 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 1)) (not (= (+ (* 4 (* (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2) (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2))) (* 8 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 3) (+ (* 2 v_main_~t~0_BEFORE_CALL_21) (* v_main_~t~0_BEFORE_CALL_21 v_main_~t~0_BEFORE_CALL_21))))))) (<= 1 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:54:04,665 INFO L280 TraceCheckUtils]: 52: Hoare triple {2208#(or (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~t~0_BEFORE_CALL_21 Int)) (and (= v_main_~t~0_BEFORE_CALL_21 (+ (* 2 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 1)) (not (= (+ (* 4 (* (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2) (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2))) (* 8 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 3) (+ (* 2 v_main_~t~0_BEFORE_CALL_21) (* v_main_~t~0_BEFORE_CALL_21 v_main_~t~0_BEFORE_CALL_21))))))) (<= 1 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2212#(exists ((v_main_~t~0_BEFORE_CALL_21 Int)) (and (= v_main_~t~0_BEFORE_CALL_21 (+ (* 2 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 1)) (not (= (+ (* 4 (* (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2) (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2))) (* 8 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 3) (+ (* 2 v_main_~t~0_BEFORE_CALL_21) (* v_main_~t~0_BEFORE_CALL_21 v_main_~t~0_BEFORE_CALL_21))))))} is VALID [2020-07-17 22:54:06,738 INFO L280 TraceCheckUtils]: 53: Hoare triple {2212#(exists ((v_main_~t~0_BEFORE_CALL_21 Int)) (and (= v_main_~t~0_BEFORE_CALL_21 (+ (* 2 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 1)) (not (= (+ (* 4 (* (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2) (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2))) (* 8 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2)) 3) (+ (* 2 v_main_~t~0_BEFORE_CALL_21) (* v_main_~t~0_BEFORE_CALL_21 v_main_~t~0_BEFORE_CALL_21))))))} assume !false; {2044#false} is UNKNOWN [2020-07-17 22:54:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 64 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-07-17 22:54:06,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308994275] [2020-07-17 22:54:06,747 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:54:06,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473513103] [2020-07-17 22:54:06,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:54:06,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 22:54:06,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865882478] [2020-07-17 22:54:06,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2020-07-17 22:54:06,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:54:06,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:54:13,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 29 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-17 22:54:13,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:54:13,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:54:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:54:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=70, Unknown=3, NotChecked=16, Total=110 [2020-07-17 22:54:13,209 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 11 states. [2020-07-17 22:54:30,153 WARN L193 SmtUtils]: Spent 12.53 s on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2020-07-17 22:54:39,825 WARN L193 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 32 DAG size of output: 3 [2020-07-17 22:54:50,347 WARN L193 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 38 DAG size of output: 6 [2020-07-17 22:56:06,930 WARN L193 SmtUtils]: Spent 40.21 s on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-07-17 22:57:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:57:10,692 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2020-07-17 22:57:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:57:10,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2020-07-17 22:57:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:57:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:57:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2020-07-17 22:57:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:57:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2020-07-17 22:57:10,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 35 transitions. [2020-07-17 22:57:17,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 32 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-17 22:57:17,557 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:57:17,557 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:57:17,558 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 109.4s TimeCoverageRelationStatistics Valid=49, Invalid=156, Unknown=9, NotChecked=26, Total=240 [2020-07-17 22:57:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:57:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:57:17,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:57:17,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:17,559 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:17,559 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:57:17,560 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:57:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:17,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:17,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:57:17,560 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:17,561 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:57:17,561 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:57:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:17,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:17,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:57:17,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:57:17,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:57:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:57:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:57:17,562 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2020-07-17 22:57:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:57:17,562 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:57:17,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:57:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:17,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:17,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:57:17,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:57:29,820 WARN L193 SmtUtils]: Spent 11.86 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2020-07-17 22:57:42,836 WARN L193 SmtUtils]: Spent 13.00 s on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2020-07-17 22:57:55,905 WARN L193 SmtUtils]: Spent 13.05 s on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2020-07-17 22:58:09,297 WARN L193 SmtUtils]: Spent 13.15 s on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2020-07-17 22:58:09,330 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:58:09,330 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:58:09,330 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:58:09,330 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:58:09,330 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:58:09,330 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:58:09,330 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2020-07-17 22:58:09,331 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-17 22:58:09,331 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2020-07-17 22:58:09,331 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2020-07-17 22:58:09,331 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 18 45) the Hoare annotation is: true [2020-07-17 22:58:09,331 INFO L268 CegarLoopResult]: For program point L29(lines 26 38) no Hoare annotation was computed. [2020-07-17 22:58:09,331 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (= main_~s~0 (+ (* main_~a~0 main_~a~0) main_~t~0)) (= (+ (* main_~a~0 2) 1) main_~t~0) (= main_~s~0 (let ((.cse0 (div (+ main_~t~0 (- 1)) 2))) (+ (* .cse0 2) (* .cse0 .cse0) 1)))) [2020-07-17 22:58:09,331 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (+ (* 2 main_~a~0) 1))) (and (<= main_~t~0 .cse0) (<= .cse0 main_~t~0) (= main_~s~0 (+ (* main_~a~0 main_~a~0) main_~t~0)))) [2020-07-17 22:58:09,331 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (and (= main_~s~0 (+ (* main_~a~0 main_~a~0) main_~t~0)) (= (+ (* main_~a~0 2) 1) main_~t~0)) [2020-07-17 22:58:09,331 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 18 45) no Hoare annotation was computed. [2020-07-17 22:58:09,331 INFO L264 CegarLoopResult]: At program point L26-2(lines 26 38) the Hoare annotation is: (let ((.cse0 (+ (* 2 main_~a~0) 1))) (and (<= main_~t~0 .cse0) (<= .cse0 main_~t~0) (= main_~s~0 (+ (* main_~a~0 main_~a~0) main_~t~0)))) [2020-07-17 22:58:09,332 INFO L264 CegarLoopResult]: At program point L26-3(lines 26 38) the Hoare annotation is: (and (= main_~s~0 (+ (* main_~a~0 main_~a~0) main_~t~0)) (= (+ (* main_~a~0 2) 1) main_~t~0) (= main_~s~0 (let ((.cse0 (div (+ main_~t~0 (- 1)) 2))) (+ (* .cse0 2) (* .cse0 .cse0) 1)))) [2020-07-17 22:58:09,332 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 18 45) no Hoare annotation was computed. [2020-07-17 22:58:09,332 INFO L268 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2020-07-17 22:58:09,332 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= main_~s~0 (+ (* main_~a~0 main_~a~0) main_~t~0)) (= (+ (* main_~a~0 2) 1) main_~t~0) (= main_~s~0 (let ((.cse0 (div (+ main_~t~0 (- 1)) 2))) (+ (* .cse0 2) (* .cse0 .cse0) 1)))) [2020-07-17 22:58:09,332 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= main_~s~0 (+ (* main_~a~0 main_~a~0) main_~t~0)) (= (+ (* main_~a~0 2) 1) main_~t~0) (= main_~s~0 (let ((.cse0 (div (+ main_~t~0 (- 1)) 2))) (+ (* .cse0 2) (* .cse0 .cse0) 1)))) [2020-07-17 22:58:09,332 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2020-07-17 22:58:09,332 INFO L268 CegarLoopResult]: For program point L11(lines 11 12) no Hoare annotation was computed. [2020-07-17 22:58:09,332 INFO L268 CegarLoopResult]: For program point L10(lines 10 13) no Hoare annotation was computed. [2020-07-17 22:58:09,332 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2020-07-17 22:58:09,332 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2020-07-17 22:58:09,333 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-07-17 22:58:09,336 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:58:09,336 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:58:09,337 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:58:09,337 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:58:09,337 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:58:09,337 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:58:09,337 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:58:09,339 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:58:09,339 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:58:09,339 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:58:09,339 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:58:09,339 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:58:09,340 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:58:09,340 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-17 22:58:09,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:58:09,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:58:09,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:58:09,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:58:09,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:58:09,340 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:58:09,341 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:58:09,341 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:58:09,341 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:58:09,341 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-17 22:58:09,341 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:58:09,341 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:58:09,341 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:58:09,341 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:58:09,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:58:09 BoogieIcfgContainer [2020-07-17 22:58:09,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:58:09,357 INFO L168 Benchmark]: Toolchain (without parser) took 308200.74 ms. Allocated memory was 137.4 MB in the beginning and 298.8 MB in the end (delta: 161.5 MB). Free memory was 100.8 MB in the beginning and 153.0 MB in the end (delta: -52.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:09,361 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:58:09,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.05 ms. Allocated memory is still 137.4 MB. Free memory was 100.6 MB in the beginning and 90.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:09,363 INFO L168 Benchmark]: Boogie Preprocessor took 45.46 ms. Allocated memory is still 137.4 MB. Free memory was 90.5 MB in the beginning and 88.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:09,364 INFO L168 Benchmark]: RCFGBuilder took 501.39 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 88.9 MB in the beginning and 164.0 MB in the end (delta: -75.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:09,365 INFO L168 Benchmark]: TraceAbstraction took 307333.28 ms. Allocated memory was 201.9 MB in the beginning and 298.8 MB in the end (delta: 97.0 MB). Free memory was 163.4 MB in the beginning and 153.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:58:09,373 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 312.05 ms. Allocated memory is still 137.4 MB. Free memory was 100.6 MB in the beginning and 90.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.46 ms. Allocated memory is still 137.4 MB. Free memory was 90.5 MB in the beginning and 88.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 501.39 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 88.9 MB in the beginning and 164.0 MB in the end (delta: -75.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 307333.28 ms. Allocated memory was 201.9 MB in the beginning and 298.8 MB in the end (delta: 97.0 MB). Free memory was 163.4 MB in the beginning and 153.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (t <= 2 * a + 1 && 2 * a + 1 <= t) && s == a * a + t - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 255.6s, OverallIterations: 8, TraceHistogramMax: 9, AutomataDifference: 187.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 51.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 205 SDtfs, 58 SDslu, 567 SDs, 0 SdLazy, 324 SolverSat, 51 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 22.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 109.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 40 PreInvPairs, 67 NumberOfFragments, 212 HoareAnnotationTreeSize, 40 FomulaSimplifications, 976 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 409 FormulaSimplificationTreeSizeReductionInter, 51.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 58.4s InterpolantComputationTime, 227 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 219 ConstructedInterpolants, 3 QuantifiedInterpolants, 32794 SizeOfPredicates, 18 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 324/349 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...