/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-46f3038-m [2020-07-08 12:48:32,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:48:32,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:48:32,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:48:32,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:48:32,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:48:32,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:48:32,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:48:32,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:48:32,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:48:32,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:48:32,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:48:32,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:48:32,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:48:32,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:48:32,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:48:32,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:48:32,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:48:32,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:48:32,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:48:32,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:48:32,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:48:32,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:48:32,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:48:32,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:48:32,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:48:32,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:48:32,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:48:32,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:48:32,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:48:32,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:48:32,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:48:32,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:48:32,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:48:32,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:48:32,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:48:32,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:48:32,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:48:32,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:48:32,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:48:32,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:48:32,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:48:32,092 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:48:32,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:48:32,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:48:32,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:48:32,094 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:48:32,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:48:32,095 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:48:32,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:48:32,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:48:32,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:48:32,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:48:32,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:48:32,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:48:32,096 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:48:32,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:48:32,096 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:48:32,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:48:32,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:48:32,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:48:32,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:48:32,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:48:32,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:48:32,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:48:32,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:48:32,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:48:32,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:48:32,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:48:32,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:48:32,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:48:32,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:48:32,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:48:32,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:48:32,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:48:32,489 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:48:32,490 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:48:32,491 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-08 12:48:32,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f99aae85/5fb7e05ef2d747f686714b65bcdb16f0/FLAG837953661 [2020-07-08 12:48:33,185 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:48:33,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/sqrt1.c [2020-07-08 12:48:33,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f99aae85/5fb7e05ef2d747f686714b65bcdb16f0/FLAG837953661 [2020-07-08 12:48:33,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f99aae85/5fb7e05ef2d747f686714b65bcdb16f0 [2020-07-08 12:48:33,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:48:33,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:48:33,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:33,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:48:33,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:48:33,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22288803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33, skipping insertion in model container [2020-07-08 12:48:33,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:48:33,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:48:33,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:33,742 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:48:33,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:48:33,786 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:48:33,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33 WrapperNode [2020-07-08 12:48:33,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:48:33,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:48:33,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:48:33,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:48:33,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (1/1) ... [2020-07-08 12:48:33,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:48:33,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:48:33,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:48:33,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:48:33,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:48:34,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:48:34,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:48:34,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:48:34,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:48:34,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:48:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:48:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:48:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:48:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:48:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:48:34,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:48:34,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:48:34,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:48:34,401 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:48:34,401 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:48:34,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:34 BoogieIcfgContainer [2020-07-08 12:48:34,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:48:34,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:48:34,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:48:34,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:48:34,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:48:33" (1/3) ... [2020-07-08 12:48:34,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315eaf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:34, skipping insertion in model container [2020-07-08 12:48:34,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:48:33" (2/3) ... [2020-07-08 12:48:34,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315eaf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:48:34, skipping insertion in model container [2020-07-08 12:48:34,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:48:34" (3/3) ... [2020-07-08 12:48:34,421 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt1.c [2020-07-08 12:48:34,432 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:48:34,440 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:48:34,453 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:48:34,479 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:48:34,479 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:48:34,480 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:48:34,480 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:48:34,480 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:48:34,480 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:48:34,480 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:48:34,480 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:48:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-08 12:48:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:48:34,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:34,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:34,512 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1080899301, now seen corresponding path program 1 times [2020-07-08 12:48:34,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:34,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497452646] [2020-07-08 12:48:34,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:34,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 12:48:34,673 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #50#return; {27#true} is VALID [2020-07-08 12:48:34,675 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-08 12:48:34,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 12:48:34,676 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #50#return; {27#true} is VALID [2020-07-08 12:48:34,676 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret1 := main(); {27#true} is VALID [2020-07-08 12:48:34,677 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-08 12:48:34,680 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} assume false; {28#false} is VALID [2020-07-08 12:48:34,681 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-08 12:48:34,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-08 12:48:34,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-08 12:48:34,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-08 12:48:34,684 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-08 12:48:34,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497452646] [2020-07-08 12:48:34,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:34,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:48:34,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760200647] [2020-07-08 12:48:34,706 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:48:34,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:34,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:48:34,756 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-08 12:48:34,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:48:34,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:48:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:48:34,768 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-08 12:48:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:34,924 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2020-07-08 12:48:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:48:34,924 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:48:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:48:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2020-07-08 12:48:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:48:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2020-07-08 12:48:34,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2020-07-08 12:48:35,137 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-08 12:48:35,151 INFO L225 Difference]: With dead ends: 43 [2020-07-08 12:48:35,152 INFO L226 Difference]: Without dead ends: 19 [2020-07-08 12:48:35,160 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-08 12:48:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-08 12:48:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-08 12:48:35,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:35,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-08 12:48:35,222 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 12:48:35,223 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 12:48:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,230 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-08 12:48:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-07-08 12:48:35,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:35,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:35,232 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 12:48:35,233 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 12:48:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,239 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-08 12:48:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-07-08 12:48:35,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:35,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:35,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:35,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:48:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-07-08 12:48:35,247 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2020-07-08 12:48:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:35,248 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-08 12:48:35,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:48:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-07-08 12:48:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:48:35,249 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:35,249 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:35,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:48:35,250 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1082567597, now seen corresponding path program 1 times [2020-07-08 12:48:35,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:35,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767347727] [2020-07-08 12:48:35,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:35,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {165#true} assume true; {165#true} is VALID [2020-07-08 12:48:35,432 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {165#true} {165#true} #50#return; {165#true} is VALID [2020-07-08 12:48:35,433 INFO L263 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {165#true} is VALID [2020-07-08 12:48:35,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2020-07-08 12:48:35,434 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #50#return; {165#true} is VALID [2020-07-08 12:48:35,434 INFO L263 TraceCheckUtils]: 3: Hoare triple {165#true} call #t~ret1 := main(); {165#true} is VALID [2020-07-08 12:48:35,436 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-08 12:48:35,438 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-08 12:48:35,441 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-08 12:48:35,442 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-08 12:48:35,444 INFO L280 TraceCheckUtils]: 8: Hoare triple {171#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {166#false} is VALID [2020-07-08 12:48:35,444 INFO L280 TraceCheckUtils]: 9: Hoare triple {166#false} assume !false; {166#false} is VALID [2020-07-08 12:48:35,446 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-08 12:48:35,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767347727] [2020-07-08 12:48:35,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:35,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:48:35,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086358882] [2020-07-08 12:48:35,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-08 12:48:35,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:35,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:48:35,470 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-08 12:48:35,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:48:35,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:35,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:48:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:48:35,472 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-07-08 12:48:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,770 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-08 12:48:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:48:35,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-08 12:48:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-08 12:48:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-08 12:48:35,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2020-07-08 12:48:35,837 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-08 12:48:35,839 INFO L225 Difference]: With dead ends: 25 [2020-07-08 12:48:35,840 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 12:48:35,841 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-08 12:48:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 12:48:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-08 12:48:35,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:35,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:35,869 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:35,869 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,873 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-08 12:48:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-08 12:48:35,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:35,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:35,875 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:35,875 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:48:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:35,879 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-08 12:48:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-08 12:48:35,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:35,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:35,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:35,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:48:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-08 12:48:35,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2020-07-08 12:48:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:35,885 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-08 12:48:35,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:48:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-08 12:48:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 12:48:35,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:35,886 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:35,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:48:35,887 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash 725386554, now seen corresponding path program 1 times [2020-07-08 12:48:35,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:35,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765655471] [2020-07-08 12:48:35,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:35,900 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:35,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690090650] [2020-07-08 12:48:35,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:35,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:48:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:35,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:36,071 INFO L263 TraceCheckUtils]: 0: Hoare triple {296#true} call ULTIMATE.init(); {296#true} is VALID [2020-07-08 12:48:36,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {296#true} assume true; {296#true} is VALID [2020-07-08 12:48:36,072 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {296#true} {296#true} #50#return; {296#true} is VALID [2020-07-08 12:48:36,072 INFO L263 TraceCheckUtils]: 3: Hoare triple {296#true} call #t~ret1 := main(); {296#true} is VALID [2020-07-08 12:48:36,074 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-08 12:48:36,075 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-08 12:48:36,075 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-08 12:48:36,075 INFO L280 TraceCheckUtils]: 7: Hoare triple {296#true} ~cond := #in~cond; {296#true} is VALID [2020-07-08 12:48:36,076 INFO L280 TraceCheckUtils]: 8: Hoare triple {296#true} assume !(0 == ~cond); {296#true} is VALID [2020-07-08 12:48:36,076 INFO L280 TraceCheckUtils]: 9: Hoare triple {296#true} assume true; {296#true} is VALID [2020-07-08 12:48:36,078 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-08 12:48:36,079 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-08 12:48:36,081 INFO L280 TraceCheckUtils]: 12: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:36,082 INFO L280 TraceCheckUtils]: 13: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {297#false} is VALID [2020-07-08 12:48:36,083 INFO L280 TraceCheckUtils]: 14: Hoare triple {297#false} assume !false; {297#false} is VALID [2020-07-08 12:48:36,084 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-08 12:48:36,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765655471] [2020-07-08 12:48:36,085 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:36,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690090650] [2020-07-08 12:48:36,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:36,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:48:36,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452343024] [2020-07-08 12:48:36,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-08 12:48:36,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:36,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:48:36,107 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-08 12:48:36,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:48:36,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:48:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:48:36,108 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2020-07-08 12:48:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:36,444 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-07-08 12:48:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:48:36,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-08 12:48:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-08 12:48:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-08 12:48:36,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-08 12:48:36,543 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-08 12:48:36,545 INFO L225 Difference]: With dead ends: 37 [2020-07-08 12:48:36,546 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:48:36,548 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-08 12:48:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:48:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-08 12:48:36,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:36,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-08 12:48:36,630 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-08 12:48:36,630 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-08 12:48:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:36,637 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-07-08 12:48:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2020-07-08 12:48:36,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:36,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:36,643 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-08 12:48:36,643 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-08 12:48:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:36,654 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-07-08 12:48:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2020-07-08 12:48:36,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:36,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:36,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:36,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 12:48:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-07-08 12:48:36,661 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 15 [2020-07-08 12:48:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:36,661 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-07-08 12:48:36,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:48:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-08 12:48:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:48:36,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:36,662 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:48:36,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:48:36,878 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:36,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash -436292723, now seen corresponding path program 1 times [2020-07-08 12:48:36,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:36,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500521700] [2020-07-08 12:48:36,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:36,893 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:36,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639130641] [2020-07-08 12:48:36,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:48:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:36,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:48:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:36,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:37,043 INFO L263 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {529#true} is VALID [2020-07-08 12:48:37,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {529#true} assume true; {529#true} is VALID [2020-07-08 12:48:37,045 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {529#true} {529#true} #50#return; {529#true} is VALID [2020-07-08 12:48:37,045 INFO L263 TraceCheckUtils]: 3: Hoare triple {529#true} call #t~ret1 := main(); {529#true} is VALID [2020-07-08 12:48:37,047 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-08 12:48:37,048 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-08 12:48:37,049 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-08 12:48:37,049 INFO L280 TraceCheckUtils]: 7: Hoare triple {529#true} ~cond := #in~cond; {529#true} is VALID [2020-07-08 12:48:37,050 INFO L280 TraceCheckUtils]: 8: Hoare triple {529#true} assume !(0 == ~cond); {529#true} is VALID [2020-07-08 12:48:37,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {529#true} assume true; {529#true} is VALID [2020-07-08 12:48:37,053 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-08 12:48:37,053 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-08 12:48:37,053 INFO L280 TraceCheckUtils]: 12: Hoare triple {529#true} ~cond := #in~cond; {529#true} is VALID [2020-07-08 12:48:37,054 INFO L280 TraceCheckUtils]: 13: Hoare triple {529#true} assume !(0 == ~cond); {529#true} is VALID [2020-07-08 12:48:37,054 INFO L280 TraceCheckUtils]: 14: Hoare triple {529#true} assume true; {529#true} is VALID [2020-07-08 12:48:37,064 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-08 12:48:37,066 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-08 12:48:37,066 INFO L280 TraceCheckUtils]: 17: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:37,068 INFO L280 TraceCheckUtils]: 18: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {530#false} is VALID [2020-07-08 12:48:37,068 INFO L280 TraceCheckUtils]: 19: Hoare triple {530#false} assume !false; {530#false} is VALID [2020-07-08 12:48:37,069 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-08 12:48:37,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500521700] [2020-07-08 12:48:37,071 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:37,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639130641] [2020-07-08 12:48:37,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:48:37,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:48:37,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430737841] [2020-07-08 12:48:37,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 12:48:37,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:37,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:48:37,115 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-08 12:48:37,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:48:37,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:48:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:48:37,116 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 5 states. [2020-07-08 12:48:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:37,450 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-08 12:48:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:48:37,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 12:48:37,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-08 12:48:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:48:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-08 12:48:37,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-08 12:48:37,534 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-08 12:48:37,537 INFO L225 Difference]: With dead ends: 41 [2020-07-08 12:48:37,537 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 12:48:37,539 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-08 12:48:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 12:48:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-08 12:48:37,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:37,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-08 12:48:37,591 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-08 12:48:37,591 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-08 12:48:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:37,595 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-08 12:48:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:48:37,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:37,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:37,597 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-08 12:48:37,597 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-08 12:48:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:37,606 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-08 12:48:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:48:37,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:37,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:37,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:37,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:48:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-08 12:48:37,615 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2020-07-08 12:48:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:37,615 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-08 12:48:37,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:48:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:48:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 12:48:37,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:37,616 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-08 12:48:37,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:37,818 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:37,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2135406385, now seen corresponding path program 1 times [2020-07-08 12:48:37,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:37,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844931811] [2020-07-08 12:48:37,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:37,834 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:37,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650195394] [2020-07-08 12:48:37,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:37,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-08 12:48:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:37,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:38,007 INFO L263 TraceCheckUtils]: 0: Hoare triple {785#true} call ULTIMATE.init(); {785#true} is VALID [2020-07-08 12:48:38,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-08 12:48:38,008 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {785#true} {785#true} #50#return; {785#true} is VALID [2020-07-08 12:48:38,008 INFO L263 TraceCheckUtils]: 3: Hoare triple {785#true} call #t~ret1 := main(); {785#true} is VALID [2020-07-08 12:48:38,023 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-08 12:48:38,024 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-08 12:48:38,024 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-08 12:48:38,025 INFO L280 TraceCheckUtils]: 7: Hoare triple {785#true} ~cond := #in~cond; {785#true} is VALID [2020-07-08 12:48:38,025 INFO L280 TraceCheckUtils]: 8: Hoare triple {785#true} assume !(0 == ~cond); {785#true} is VALID [2020-07-08 12:48:38,025 INFO L280 TraceCheckUtils]: 9: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-08 12:48:38,027 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-08 12:48:38,028 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-08 12:48:38,028 INFO L280 TraceCheckUtils]: 12: Hoare triple {785#true} ~cond := #in~cond; {785#true} is VALID [2020-07-08 12:48:38,029 INFO L280 TraceCheckUtils]: 13: Hoare triple {785#true} assume !(0 == ~cond); {785#true} is VALID [2020-07-08 12:48:38,029 INFO L280 TraceCheckUtils]: 14: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-08 12:48:38,030 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-08 12:48:38,030 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-08 12:48:38,031 INFO L280 TraceCheckUtils]: 17: Hoare triple {785#true} ~cond := #in~cond; {785#true} is VALID [2020-07-08 12:48:38,031 INFO L280 TraceCheckUtils]: 18: Hoare triple {785#true} assume !(0 == ~cond); {785#true} is VALID [2020-07-08 12:48:38,031 INFO L280 TraceCheckUtils]: 19: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-08 12:48:38,033 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-08 12:48:38,035 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-08 12:48:38,035 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-08 12:48:38,036 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-08 12:48:38,036 INFO L280 TraceCheckUtils]: 24: Hoare triple {785#true} ~cond := #in~cond; {785#true} is VALID [2020-07-08 12:48:38,036 INFO L280 TraceCheckUtils]: 25: Hoare triple {785#true} assume !(0 == ~cond); {785#true} is VALID [2020-07-08 12:48:38,036 INFO L280 TraceCheckUtils]: 26: Hoare triple {785#true} assume true; {785#true} is VALID [2020-07-08 12:48:38,041 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-08 12:48:38,042 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-08 12:48:38,043 INFO L280 TraceCheckUtils]: 29: Hoare triple {876#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:38,043 INFO L280 TraceCheckUtils]: 30: Hoare triple {880#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {786#false} is VALID [2020-07-08 12:48:38,043 INFO L280 TraceCheckUtils]: 31: Hoare triple {786#false} assume !false; {786#false} is VALID [2020-07-08 12:48:38,046 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-08 12:48:38,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844931811] [2020-07-08 12:48:38,047 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:38,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650195394] [2020-07-08 12:48:38,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:38,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 12:48:38,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522934044] [2020-07-08 12:48:38,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-08 12:48:38,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:38,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:48:38,093 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-08 12:48:38,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:48:38,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:48:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:48:38,094 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 6 states. [2020-07-08 12:48:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:38,573 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-08 12:48:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:48:38,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-08 12:48:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:48:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-08 12:48:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:48:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-08 12:48:38,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-08 12:48:38,702 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-08 12:48:38,705 INFO L225 Difference]: With dead ends: 54 [2020-07-08 12:48:38,705 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 12:48:38,706 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-08 12:48:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 12:48:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-08 12:48:38,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:38,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-08 12:48:38,773 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-08 12:48:38,773 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-08 12:48:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:38,778 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2020-07-08 12:48:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2020-07-08 12:48:38,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:38,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:38,779 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-08 12:48:38,779 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-08 12:48:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:38,784 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2020-07-08 12:48:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2020-07-08 12:48:38,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:38,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:38,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:38,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-08 12:48:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2020-07-08 12:48:38,789 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 32 [2020-07-08 12:48:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:38,789 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2020-07-08 12:48:38,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:48:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2020-07-08 12:48:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:48:38,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:38,791 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-08 12:48:39,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:39,006 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:39,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:39,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2069437160, now seen corresponding path program 2 times [2020-07-08 12:48:39,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:39,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305125965] [2020-07-08 12:48:39,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:39,023 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:39,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523594109] [2020-07-08 12:48:39,024 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-08 12:48:39,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:48:39,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:48:39,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-08 12:48:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:39,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:39,225 INFO L263 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2020-07-08 12:48:39,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-08 12:48:39,226 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1152#true} {1152#true} #50#return; {1152#true} is VALID [2020-07-08 12:48:39,226 INFO L263 TraceCheckUtils]: 3: Hoare triple {1152#true} call #t~ret1 := main(); {1152#true} is VALID [2020-07-08 12:48:39,227 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-08 12:48:39,228 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-08 12:48:39,228 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-08 12:48:39,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-08 12:48:39,229 INFO L280 TraceCheckUtils]: 8: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-08 12:48:39,229 INFO L280 TraceCheckUtils]: 9: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-08 12:48:39,230 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-08 12:48:39,230 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-08 12:48:39,230 INFO L280 TraceCheckUtils]: 12: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-08 12:48:39,231 INFO L280 TraceCheckUtils]: 13: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-08 12:48:39,231 INFO L280 TraceCheckUtils]: 14: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-08 12:48:39,233 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-08 12:48:39,234 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-08 12:48:39,234 INFO L280 TraceCheckUtils]: 17: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-08 12:48:39,234 INFO L280 TraceCheckUtils]: 18: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-08 12:48:39,235 INFO L280 TraceCheckUtils]: 19: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-08 12:48:39,236 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-08 12:48:39,236 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-08 12:48:39,237 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-08 12:48:39,237 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-08 12:48:39,238 INFO L280 TraceCheckUtils]: 24: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-08 12:48:39,238 INFO L280 TraceCheckUtils]: 25: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-08 12:48:39,238 INFO L280 TraceCheckUtils]: 26: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-08 12:48:39,240 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-08 12:48:39,241 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-08 12:48:39,241 INFO L280 TraceCheckUtils]: 29: Hoare triple {1152#true} ~cond := #in~cond; {1152#true} is VALID [2020-07-08 12:48:39,241 INFO L280 TraceCheckUtils]: 30: Hoare triple {1152#true} assume !(0 == ~cond); {1152#true} is VALID [2020-07-08 12:48:39,242 INFO L280 TraceCheckUtils]: 31: Hoare triple {1152#true} assume true; {1152#true} is VALID [2020-07-08 12:48:39,243 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-08 12:48:39,245 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-08 12:48:39,247 INFO L280 TraceCheckUtils]: 34: Hoare triple {1258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:39,249 INFO L280 TraceCheckUtils]: 35: Hoare triple {1262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1153#false} is VALID [2020-07-08 12:48:39,249 INFO L280 TraceCheckUtils]: 36: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2020-07-08 12:48:39,252 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-08 12:48:39,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305125965] [2020-07-08 12:48:39,253 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:39,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523594109] [2020-07-08 12:48:39,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:39,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 12:48:39,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664220170] [2020-07-08 12:48:39,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-08 12:48:39,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:39,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:48:39,297 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-08 12:48:39,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:48:39,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:39,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:48:39,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:48:39,298 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 6 states. [2020-07-08 12:48:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:39,730 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2020-07-08 12:48:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:48:39,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-08 12:48:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:48:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-08 12:48:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:48:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-08 12:48:39,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-08 12:48:39,828 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-08 12:48:39,830 INFO L225 Difference]: With dead ends: 58 [2020-07-08 12:48:39,830 INFO L226 Difference]: Without dead ends: 53 [2020-07-08 12:48:39,831 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-08 12:48:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-08 12:48:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-08 12:48:39,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:39,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-08 12:48:39,889 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-08 12:48:39,889 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-08 12:48:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:39,893 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-08 12:48:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-08 12:48:39,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:39,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:39,894 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-08 12:48:39,894 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-08 12:48:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:39,898 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-07-08 12:48:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-08 12:48:39,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:39,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:39,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:39,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-08 12:48:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-07-08 12:48:39,903 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 37 [2020-07-08 12:48:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:39,903 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-07-08 12:48:39,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:48:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-08 12:48:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 12:48:39,905 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:39,905 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-08 12:48:40,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:48:40,120 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash -121404966, now seen corresponding path program 3 times [2020-07-08 12:48:40,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:40,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933171998] [2020-07-08 12:48:40,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:40,132 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:40,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033464109] [2020-07-08 12:48:40,133 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-08 12:48:40,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-08 12:48:40,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:48:40,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-08 12:48:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:48:40,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:40,398 INFO L263 TraceCheckUtils]: 0: Hoare triple {1542#true} call ULTIMATE.init(); {1542#true} is VALID [2020-07-08 12:48:40,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-08 12:48:40,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1542#true} {1542#true} #50#return; {1542#true} is VALID [2020-07-08 12:48:40,399 INFO L263 TraceCheckUtils]: 3: Hoare triple {1542#true} call #t~ret1 := main(); {1542#true} is VALID [2020-07-08 12:48:40,401 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-08 12:48:40,402 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-08 12:48:40,402 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-08 12:48:40,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-08 12:48:40,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-08 12:48:40,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-08 12:48:40,403 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-08 12:48:40,403 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-08 12:48:40,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-08 12:48:40,404 INFO L280 TraceCheckUtils]: 13: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-08 12:48:40,404 INFO L280 TraceCheckUtils]: 14: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-08 12:48:40,409 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-08 12:48:40,409 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-08 12:48:40,410 INFO L280 TraceCheckUtils]: 17: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-08 12:48:40,410 INFO L280 TraceCheckUtils]: 18: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-08 12:48:40,410 INFO L280 TraceCheckUtils]: 19: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-08 12:48:40,411 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-08 12:48:40,412 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-08 12:48:40,413 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-08 12:48:40,413 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-08 12:48:40,413 INFO L280 TraceCheckUtils]: 24: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-08 12:48:40,413 INFO L280 TraceCheckUtils]: 25: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-08 12:48:40,414 INFO L280 TraceCheckUtils]: 26: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-08 12:48:40,414 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-08 12:48:40,414 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-08 12:48:40,415 INFO L280 TraceCheckUtils]: 29: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-08 12:48:40,415 INFO L280 TraceCheckUtils]: 30: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-08 12:48:40,415 INFO L280 TraceCheckUtils]: 31: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-08 12:48:40,416 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-08 12:48:40,416 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-08 12:48:40,416 INFO L280 TraceCheckUtils]: 34: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-08 12:48:40,416 INFO L280 TraceCheckUtils]: 35: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-08 12:48:40,417 INFO L280 TraceCheckUtils]: 36: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-08 12:48:40,417 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-08 12:48:40,418 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-08 12:48:40,419 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-08 12:48:40,419 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-08 12:48:40,419 INFO L280 TraceCheckUtils]: 41: Hoare triple {1542#true} ~cond := #in~cond; {1542#true} is VALID [2020-07-08 12:48:40,420 INFO L280 TraceCheckUtils]: 42: Hoare triple {1542#true} assume !(0 == ~cond); {1542#true} is VALID [2020-07-08 12:48:40,420 INFO L280 TraceCheckUtils]: 43: Hoare triple {1542#true} assume true; {1542#true} is VALID [2020-07-08 12:48:40,421 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-08 12:48:40,422 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-08 12:48:40,422 INFO L280 TraceCheckUtils]: 46: Hoare triple {1685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:48:40,423 INFO L280 TraceCheckUtils]: 47: Hoare triple {1689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1543#false} is VALID [2020-07-08 12:48:40,423 INFO L280 TraceCheckUtils]: 48: Hoare triple {1543#false} assume !false; {1543#false} is VALID [2020-07-08 12:48:40,428 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-08 12:48:40,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933171998] [2020-07-08 12:48:40,429 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:48:40,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033464109] [2020-07-08 12:48:40,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:48:40,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 12:48:40,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066347216] [2020-07-08 12:48:40,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2020-07-08 12:48:40,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:48:40,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:48:40,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:48:40,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:48:40,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:48:40,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:48:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:48:40,494 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 7 states. [2020-07-08 12:48:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:41,263 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2020-07-08 12:48:41,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:48:41,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2020-07-08 12:48:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:48:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:48:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-07-08 12:48:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:48:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2020-07-08 12:48:41,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2020-07-08 12:48:41,379 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-08 12:48:41,382 INFO L225 Difference]: With dead ends: 71 [2020-07-08 12:48:41,383 INFO L226 Difference]: Without dead ends: 69 [2020-07-08 12:48:41,383 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-08 12:48:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-08 12:48:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2020-07-08 12:48:41,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:48:41,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2020-07-08 12:48:41,465 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2020-07-08 12:48:41,465 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2020-07-08 12:48:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:41,470 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2020-07-08 12:48:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2020-07-08 12:48:41,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:41,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:41,471 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2020-07-08 12:48:41,472 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2020-07-08 12:48:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:48:41,476 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2020-07-08 12:48:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2020-07-08 12:48:41,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:48:41,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:48:41,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:48:41,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:48:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-08 12:48:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2020-07-08 12:48:41,482 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 49 [2020-07-08 12:48:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:48:41,482 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2020-07-08 12:48:41,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:48:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2020-07-08 12:48:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 12:48:41,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:48:41,484 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-08 12:48:41,698 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-08 12:48:41,698 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:48:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:48:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1300456723, now seen corresponding path program 4 times [2020-07-08 12:48:41,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:48:41,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349200478] [2020-07-08 12:48:41,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:48:41,710 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:48:41,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056138607] [2020-07-08 12:48:41,711 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-08 12:48:41,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:48:41,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:48:41,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-08 12:48:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-08 12:48:43,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:48:46,136 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:49:02,013 WARN L193 SmtUtils]: Spent 8.23 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-08 12:49:02,031 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:49:21,616 WARN L193 SmtUtils]: Spent 8.28 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-08 12:49:23,673 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:49:31,997 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-08 12:49:32,033 INFO L263 TraceCheckUtils]: 0: Hoare triple {2043#true} call ULTIMATE.init(); {2043#true} is VALID [2020-07-08 12:49:32,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-08 12:49:32,034 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2043#true} {2043#true} #50#return; {2043#true} is VALID [2020-07-08 12:49:32,034 INFO L263 TraceCheckUtils]: 3: Hoare triple {2043#true} call #t~ret1 := main(); {2043#true} is VALID [2020-07-08 12:49:32,034 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-08 12:49:32,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {2043#true} assume !false; {2043#true} is VALID [2020-07-08 12:49:32,035 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-08 12:49:32,035 INFO L280 TraceCheckUtils]: 7: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-08 12:49:32,035 INFO L280 TraceCheckUtils]: 8: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-08 12:49:32,036 INFO L280 TraceCheckUtils]: 9: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-08 12:49:32,036 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2043#true} {2043#true} #54#return; {2043#true} is VALID [2020-07-08 12:49:32,036 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-08 12:49:32,037 INFO L280 TraceCheckUtils]: 12: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-08 12:49:32,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-08 12:49:32,037 INFO L280 TraceCheckUtils]: 14: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-08 12:49:32,037 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2043#true} {2043#true} #56#return; {2043#true} is VALID [2020-07-08 12:49:32,037 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-08 12:49:32,038 INFO L280 TraceCheckUtils]: 17: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-08 12:49:32,038 INFO L280 TraceCheckUtils]: 18: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-08 12:49:32,038 INFO L280 TraceCheckUtils]: 19: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-08 12:49:32,039 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2043#true} {2043#true} #58#return; {2043#true} is VALID [2020-07-08 12:49:32,039 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-08 12:49:32,039 INFO L280 TraceCheckUtils]: 22: Hoare triple {2043#true} assume !false; {2043#true} is VALID [2020-07-08 12:49:32,039 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-08 12:49:32,040 INFO L280 TraceCheckUtils]: 24: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-08 12:49:32,040 INFO L280 TraceCheckUtils]: 25: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-08 12:49:32,040 INFO L280 TraceCheckUtils]: 26: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-08 12:49:32,040 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2043#true} {2043#true} #54#return; {2043#true} is VALID [2020-07-08 12:49:32,041 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-08 12:49:32,046 INFO L280 TraceCheckUtils]: 29: Hoare triple {2043#true} ~cond := #in~cond; {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:49:32,047 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-08 12:49:32,051 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-08 12:49:32,052 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-08 12:49:32,052 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-08 12:49:32,052 INFO L280 TraceCheckUtils]: 34: Hoare triple {2043#true} ~cond := #in~cond; {2043#true} is VALID [2020-07-08 12:49:32,053 INFO L280 TraceCheckUtils]: 35: Hoare triple {2043#true} assume !(0 == ~cond); {2043#true} is VALID [2020-07-08 12:49:32,053 INFO L280 TraceCheckUtils]: 36: Hoare triple {2043#true} assume true; {2043#true} is VALID [2020-07-08 12:49:32,054 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-08 12:49:34,105 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-08 12:49:34,106 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-08 12:49:34,107 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-08 12:49:34,107 INFO L280 TraceCheckUtils]: 41: Hoare triple {2043#true} ~cond := #in~cond; {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:49:34,108 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-08 12:49:34,109 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-08 12:49:34,110 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-08 12:49:34,110 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-08 12:49:34,110 INFO L280 TraceCheckUtils]: 46: Hoare triple {2043#true} ~cond := #in~cond; {2135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:49:34,111 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-08 12:49:34,111 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-08 12:49:36,189 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-08 12:49:36,212 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-08 12:49:36,214 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-08 12:49:36,215 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-08 12:49:38,290 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-08 12:49:38,298 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-08 12:49:38,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349200478] [2020-07-08 12:49:38,299 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-08 12:49:38,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056138607] [2020-07-08 12:49:38,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:49:38,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 12:49:38,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077185401] [2020-07-08 12:49:38,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2020-07-08 12:49:38,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:49:38,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:49:44,766 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-08 12:49:44,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:49:44,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:49:44,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:49:44,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=4, NotChecked=16, Total=110 [2020-07-08 12:49:44,768 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 11 states. [2020-07-08 12:49:53,671 WARN L193 SmtUtils]: Spent 8.63 s on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2020-07-08 12:50:02,534 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 32 DAG size of output: 3 [2020-07-08 12:50:10,990 WARN L193 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 38 DAG size of output: 6 [2020-07-08 12:50:38,571 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_main_~t~0_BEFORE_CALL_21 Int)) (let ((.cse1 (div (+ v_main_~t~0_BEFORE_CALL_21 (- 1)) 2))) (and (= v_main_~t~0_BEFORE_CALL_21 (+ (* 2 .cse1) 1)) (not (= (+ (* 4 (* .cse1 .cse1)) (* 8 .cse1) 3) (+ (* 2 v_main_~t~0_BEFORE_CALL_21) (* v_main_~t~0_BEFORE_CALL_21 v_main_~t~0_BEFORE_CALL_21))))))))) (and (or (and (<= 0 c___VERIFIER_assert_~cond) .cse0) (<= 1 c___VERIFIER_assert_~cond)) (or (and (<= 0 |c___VERIFIER_assert_#in~cond|) .cse0) (<= 1 |c___VERIFIER_assert_#in~cond|)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2020-07-08 12:51:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:49,277 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-08 12:51:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 12:51:49,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2020-07-08 12:51:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:51:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:51:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2020-07-08 12:51:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:51:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2020-07-08 12:51:49,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2020-07-08 12:51:55,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 34 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-08 12:51:55,825 INFO L225 Difference]: With dead ends: 77 [2020-07-08 12:51:55,825 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:51:55,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=45, Invalid=139, Unknown=6, NotChecked=50, Total=240 [2020-07-08 12:51:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:51:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:51:55,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:51:55,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:51:55,827 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:51:55,827 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:51:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:55,828 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:51:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:51:55,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:51:55,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:51:55,828 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:51:55,829 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:51:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:51:55,829 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:51:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:51:55,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:51:55,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:51:55,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:51:55,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:51:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:51:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:51:55,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2020-07-08 12:51:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:51:55,830 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:51:55,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:51:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:51:55,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:51:56,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:51:56,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:52:07,432 WARN L193 SmtUtils]: Spent 11.22 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2020-07-08 12:52:17,433 WARN L193 SmtUtils]: Spent 9.99 s on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2020-07-08 12:52:30,273 WARN L193 SmtUtils]: Spent 12.82 s on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2020-07-08 12:52:42,717 WARN L193 SmtUtils]: Spent 12.24 s on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2020-07-08 12:52:42,844 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2020-07-08 12:52:42,847 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:52:42,848 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:52:42,848 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:52:42,848 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:52:42,848 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:52:42,848 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:52:42,848 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2020-07-08 12:52:42,848 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-08 12:52:42,848 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2020-07-08 12:52:42,848 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2020-07-08 12:52:42,848 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 18 45) the Hoare annotation is: true [2020-07-08 12:52:42,848 INFO L268 CegarLoopResult]: For program point L29(lines 26 38) no Hoare annotation was computed. [2020-07-08 12:52:42,849 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-08 12:52:42,849 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-08 12:52:42,849 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-08 12:52:42,849 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 18 45) no Hoare annotation was computed. [2020-07-08 12:52:42,849 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-08 12:52:42,849 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-08 12:52:42,849 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 18 45) no Hoare annotation was computed. [2020-07-08 12:52:42,849 INFO L268 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2020-07-08 12:52:42,849 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-08 12:52:42,850 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-08 12:52:42,850 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2020-07-08 12:52:42,850 INFO L268 CegarLoopResult]: For program point L11(lines 11 12) no Hoare annotation was computed. [2020-07-08 12:52:42,850 INFO L268 CegarLoopResult]: For program point L10(lines 10 13) no Hoare annotation was computed. [2020-07-08 12:52:42,850 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2020-07-08 12:52:42,850 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2020-07-08 12:52:42,850 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-07-08 12:52:42,853 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:52:42,854 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:52:42,855 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:52:42,855 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:52:42,855 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:52:42,855 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:52:42,855 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:52:42,856 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:52:42,856 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-08 12:52:42,856 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:52:42,856 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-08 12:52:42,856 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 12:52:42,857 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 12:52:42,858 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:52:42,858 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:52:42,858 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-08 12:52:42,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:52:42 BoogieIcfgContainer [2020-07-08 12:52:42,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:52:42,871 INFO L168 Benchmark]: Toolchain (without parser) took 249374.72 ms. Allocated memory was 141.6 MB in the beginning and 320.9 MB in the end (delta: 179.3 MB). Free memory was 98.3 MB in the beginning and 266.9 MB in the end (delta: -168.6 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:42,872 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 141.6 MB. Free memory was 116.5 MB in the beginning and 116.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-08 12:52:42,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.55 ms. Allocated memory is still 141.6 MB. Free memory was 98.1 MB in the beginning and 88.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:42,873 INFO L168 Benchmark]: Boogie Preprocessor took 43.15 ms. Allocated memory is still 141.6 MB. Free memory was 88.0 MB in the beginning and 86.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:42,874 INFO L168 Benchmark]: RCFGBuilder took 578.15 ms. Allocated memory was 141.6 MB in the beginning and 199.8 MB in the end (delta: 58.2 MB). Free memory was 86.4 MB in the beginning and 161.7 MB in the end (delta: -75.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:42,875 INFO L168 Benchmark]: TraceAbstraction took 248458.09 ms. Allocated memory was 199.8 MB in the beginning and 320.9 MB in the end (delta: 121.1 MB). Free memory was 161.0 MB in the beginning and 266.9 MB in the end (delta: -105.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:52:42,877 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.72 ms. Allocated memory is still 141.6 MB. Free memory was 116.5 MB in the beginning and 116.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.55 ms. Allocated memory is still 141.6 MB. Free memory was 98.1 MB in the beginning and 88.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.15 ms. Allocated memory is still 141.6 MB. Free memory was 88.0 MB in the beginning and 86.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 578.15 ms. Allocated memory was 141.6 MB in the beginning and 199.8 MB in the end (delta: 58.2 MB). Free memory was 86.4 MB in the beginning and 161.7 MB in the end (delta: -75.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248458.09 ms. Allocated memory was 199.8 MB in the beginning and 320.9 MB in the end (delta: 121.1 MB). Free memory was 161.0 MB in the beginning and 266.9 MB in the end (delta: -105.9 MB). Peak memory consumption was 15.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: 201.5s, OverallIterations: 8, TraceHistogramMax: 9, AutomataDifference: 134.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 205 SDtfs, 55 SDslu, 570 SDs, 0 SdLazy, 324 SolverSat, 52 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 51.5s 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, 46.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 57.6s 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...