/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/recursive-simple/id_b3_o2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:58:35,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:58:35,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:58:35,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:58:35,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:58:35,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:58:35,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:58:35,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:58:35,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:58:35,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:58:35,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:58:35,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:58:35,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:58:35,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:58:35,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:58:35,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:58:35,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:58:35,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:58:35,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:58:35,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:58:35,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:58:35,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:58:35,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:58:35,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:58:35,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:58:35,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:58:35,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:58:35,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:58:35,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:58:35,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:58:35,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:58:35,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:58:35,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:58:35,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:58:35,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:58:35,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:58:35,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:58:35,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:58:35,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:58:35,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:58:35,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:58:35,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:58:35,461 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:58:35,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:58:35,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:58:35,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:58:35,467 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:58:35,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:58:35,468 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:58:35,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:58:35,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:58:35,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:58:35,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:58:35,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:58:35,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:58:35,469 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:58:35,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:58:35,470 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:58:35,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:58:35,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:58:35,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:58:35,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:58:35,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:58:35,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:58:35,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:58:35,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:58:35,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:58:35,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:58:35,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:58:35,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:58:35,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:58:35,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:58:35,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:58:35,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:58:35,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:58:35,771 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:58:35,771 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:58:35,772 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c [2020-07-10 14:58:35,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4808021/cfa17325abc4478a8c3cf3a478124a9b/FLAG173667f5a [2020-07-10 14:58:36,269 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:58:36,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c [2020-07-10 14:58:36,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4808021/cfa17325abc4478a8c3cf3a478124a9b/FLAG173667f5a [2020-07-10 14:58:36,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4808021/cfa17325abc4478a8c3cf3a478124a9b [2020-07-10 14:58:36,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:58:36,671 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:58:36,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:58:36,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:58:36,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:58:36,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d456c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36, skipping insertion in model container [2020-07-10 14:58:36,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:58:36,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:58:36,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:58:36,906 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:58:36,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:58:36,937 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:58:36,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36 WrapperNode [2020-07-10 14:58:36,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:58:36,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:58:36,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:58:36,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:58:36,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (1/1) ... [2020-07-10 14:58:36,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:58:36,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:58:36,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:58:36,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:58:36,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:58:37,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:58:37,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:58:37,106 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-10 14:58:37,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-10 14:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:58:37,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:58:37,331 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:58:37,331 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:58:37,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:58:37 BoogieIcfgContainer [2020-07-10 14:58:37,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:58:37,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:58:37,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:58:37,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:58:37,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:58:36" (1/3) ... [2020-07-10 14:58:37,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbf16a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:58:37, skipping insertion in model container [2020-07-10 14:58:37,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:36" (2/3) ... [2020-07-10 14:58:37,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbf16a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:58:37, skipping insertion in model container [2020-07-10 14:58:37,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:58:37" (3/3) ... [2020-07-10 14:58:37,343 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o2-2.c [2020-07-10 14:58:37,373 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:58:37,393 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:58:37,424 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:58:37,462 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:58:37,462 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:58:37,462 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:58:37,463 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:58:37,463 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:58:37,463 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:58:37,463 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:58:37,463 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:58:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 14:58:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:58:37,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:37,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:37,489 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1250208381, now seen corresponding path program 1 times [2020-07-10 14:58:37,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:37,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700860830] [2020-07-10 14:58:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:37,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:58:37,706 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:58:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:37,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-10 14:58:37,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:37,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:37,744 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 14:58:37,744 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 14:58:37,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:58:37,745 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:58:37,745 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-10 14:58:37,746 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2020-07-10 14:58:37,746 INFO L263 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~ret2 := id(~input~0); {24#true} is VALID [2020-07-10 14:58:37,747 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-10 14:58:37,748 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:37,749 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:37,750 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 14:58:37,752 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {33#(<= main_~result~0 0)} is VALID [2020-07-10 14:58:37,754 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#(<= main_~result~0 0)} assume 2 == ~result~0; {25#false} is VALID [2020-07-10 14:58:37,754 INFO L280 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 14:58:37,756 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-10 14:58:37,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700860830] [2020-07-10 14:58:37,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:37,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:58:37,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658062258] [2020-07-10 14:58:37,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:58:37,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:37,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:58:37,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:37,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:58:37,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:58:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:37,812 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-10 14:58:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:37,994 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 14:58:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:37,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:58:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-10 14:58:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-10 14:58:38,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-10 14:58:38,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:38,080 INFO L225 Difference]: With dead ends: 33 [2020-07-10 14:58:38,081 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 14:58:38,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 14:58:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 14:58:38,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:38,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:38,129 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:38,129 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:38,134 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 14:58:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:38,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:38,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:38,136 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:38,136 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:38,140 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 14:58:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:38,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:38,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:38,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:38,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:58:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-10 14:58:38,146 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2020-07-10 14:58:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:38,146 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-10 14:58:38,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:58:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 14:58:38,148 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:38,149 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:38,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:58:38,149 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1951994857, now seen corresponding path program 1 times [2020-07-10 14:58:38,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:38,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467543967] [2020-07-10 14:58:38,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:58:38,227 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:58:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:38,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,353 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:38,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:38,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-10 14:58:38,354 INFO L263 TraceCheckUtils]: 2: Hoare triple {141#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {141#true} is VALID [2020-07-10 14:58:38,355 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:38,356 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,357 INFO L280 TraceCheckUtils]: 5: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,359 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:38,361 INFO L280 TraceCheckUtils]: 7: Hoare triple {162#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {163#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:38,362 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {142#false} is VALID [2020-07-10 14:58:38,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-10 14:58:38,363 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= 3 |main_#t~ret2|)} is VALID [2020-07-10 14:58:38,364 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-10 14:58:38,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:58:38,365 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:58:38,365 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-10 14:58:38,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {141#true} is VALID [2020-07-10 14:58:38,366 INFO L263 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~ret2 := id(~input~0); {141#true} is VALID [2020-07-10 14:58:38,366 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:38,367 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-10 14:58:38,367 INFO L263 TraceCheckUtils]: 8: Hoare triple {141#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {141#true} is VALID [2020-07-10 14:58:38,368 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:38,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,370 INFO L280 TraceCheckUtils]: 11: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,372 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:38,373 INFO L280 TraceCheckUtils]: 13: Hoare triple {162#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {163#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:38,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {142#false} is VALID [2020-07-10 14:58:38,374 INFO L280 TraceCheckUtils]: 15: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-10 14:58:38,375 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= 3 |main_#t~ret2|)} is VALID [2020-07-10 14:58:38,376 INFO L280 TraceCheckUtils]: 17: Hoare triple {156#(<= 3 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {157#(<= 3 main_~result~0)} is VALID [2020-07-10 14:58:38,377 INFO L280 TraceCheckUtils]: 18: Hoare triple {157#(<= 3 main_~result~0)} assume 2 == ~result~0; {142#false} is VALID [2020-07-10 14:58:38,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-10 14:58:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:58:38,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467543967] [2020-07-10 14:58:38,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:38,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:58:38,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138100537] [2020-07-10 14:58:38,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 14:58:38,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:38,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:58:38,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:38,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:58:38,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:38,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:58:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:58:38,428 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2020-07-10 14:58:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:38,574 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 14:58:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:38,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 14:58:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:58:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 14:58:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:58:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 14:58:38,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-10 14:58:38,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:38,645 INFO L225 Difference]: With dead ends: 31 [2020-07-10 14:58:38,645 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 14:58:38,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:58:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 14:58:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-10 14:58:38,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:38,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:38,655 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:38,655 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:38,659 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 14:58:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 14:58:38,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:38,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:38,660 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-10 14:58:38,660 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-10 14:58:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:38,663 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 14:58:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 14:58:38,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:38,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:38,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:38,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 14:58:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-10 14:58:38,667 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2020-07-10 14:58:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:38,667 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-10 14:58:38,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:58:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-10 14:58:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 14:58:38,668 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:38,668 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:38,669 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:58:38,669 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1923365706, now seen corresponding path program 1 times [2020-07-10 14:58:38,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:38,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532566495] [2020-07-10 14:58:38,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:38,727 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:38,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,825 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:38,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:38,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:38,826 INFO L263 TraceCheckUtils]: 2: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-10 14:58:38,826 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:38,827 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,828 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,830 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:38,831 INFO L280 TraceCheckUtils]: 7: Hoare triple {300#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:38,831 INFO L280 TraceCheckUtils]: 8: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:38,832 INFO L280 TraceCheckUtils]: 9: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:38,833 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:38,834 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 14:58:38,834 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:38,835 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:38,835 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-10 14:58:38,835 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {279#true} is VALID [2020-07-10 14:58:38,836 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-10 14:58:38,836 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:38,836 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:38,836 INFO L263 TraceCheckUtils]: 8: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-10 14:58:38,837 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:38,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,840 INFO L280 TraceCheckUtils]: 11: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:38,842 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:38,843 INFO L280 TraceCheckUtils]: 13: Hoare triple {300#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:38,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:38,845 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:38,846 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:38,847 INFO L280 TraceCheckUtils]: 17: Hoare triple {294#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {295#(<= main_~result~0 1)} is VALID [2020-07-10 14:58:38,848 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 2 == ~result~0; {280#false} is VALID [2020-07-10 14:58:38,848 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 14:58:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:58:38,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532566495] [2020-07-10 14:58:38,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642879168] [2020-07-10 14:58:38,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 14:58:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:39,031 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 14:58:39,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:39,032 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:39,032 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-10 14:58:39,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {279#true} is VALID [2020-07-10 14:58:39,033 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-10 14:58:39,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:39,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:39,034 INFO L263 TraceCheckUtils]: 8: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-10 14:58:39,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:39,035 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {337#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:39,036 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#(<= |id_#res| 0)} assume true; {337#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:39,037 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {337#(<= |id_#res| 0)} {279#true} #36#return; {344#(<= |id_#t~ret0| 0)} is VALID [2020-07-10 14:58:39,038 INFO L280 TraceCheckUtils]: 13: Hoare triple {344#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:39,039 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,040 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,041 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:39,042 INFO L280 TraceCheckUtils]: 17: Hoare triple {294#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {295#(<= main_~result~0 1)} is VALID [2020-07-10 14:58:39,043 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 2 == ~result~0; {280#false} is VALID [2020-07-10 14:58:39,043 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 14:58:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:58:39,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:39,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-10 14:58:39,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520763497] [2020-07-10 14:58:39,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-10 14:58:39,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:39,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:58:39,078 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-10 14:58:39,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:58:39,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:58:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:58:39,079 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2020-07-10 14:58:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,257 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:58:39,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-10 14:58:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 14:58:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 14:58:39,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-10 14:58:39,303 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-10 14:58:39,305 INFO L225 Difference]: With dead ends: 27 [2020-07-10 14:58:39,305 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 14:58:39,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:58:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 14:58:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-10 14:58:39,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:39,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:39,314 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:39,314 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,317 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 14:58:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:39,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:39,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:39,318 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:39,318 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,321 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 14:58:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:39,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:39,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:39,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:39,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 14:58:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-10 14:58:39,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2020-07-10 14:58:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:39,325 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-10 14:58:39,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:58:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:58:39,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:39,327 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:39,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:58:39,543 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:39,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash 376843494, now seen corresponding path program 1 times [2020-07-10 14:58:39,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:39,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174276138] [2020-07-10 14:58:39,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:39,605 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:39,799 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:39,801 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:39,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:39,802 INFO L263 TraceCheckUtils]: 2: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:39,802 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,814 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:39,815 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:39,819 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:39,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:39,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,826 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,827 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:39,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:39,829 INFO L263 TraceCheckUtils]: 2: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:39,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:39,832 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:39,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,835 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:39,836 INFO L280 TraceCheckUtils]: 8: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:39,837 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:39,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:39,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,840 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,844 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:39,845 INFO L280 TraceCheckUtils]: 14: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:39,846 INFO L280 TraceCheckUtils]: 15: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-10 14:58:39,846 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:39,847 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:39,848 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-10 14:58:39,848 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:39,848 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:39,848 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-10 14:58:39,849 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {477#true} is VALID [2020-07-10 14:58:39,849 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-10 14:58:39,850 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,850 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:39,850 INFO L263 TraceCheckUtils]: 8: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:39,850 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,851 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:39,851 INFO L263 TraceCheckUtils]: 11: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:39,851 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,852 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:39,853 INFO L280 TraceCheckUtils]: 14: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:39,855 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:39,856 INFO L280 TraceCheckUtils]: 16: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:39,857 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,858 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,859 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:39,860 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:39,865 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-10 14:58:39,866 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:39,866 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:39,866 INFO L280 TraceCheckUtils]: 24: Hoare triple {478#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {478#false} is VALID [2020-07-10 14:58:39,866 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 2 == ~result~0; {478#false} is VALID [2020-07-10 14:58:39,867 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-10 14:58:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:58:39,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174276138] [2020-07-10 14:58:39,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251840497] [2020-07-10 14:58:39,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,907 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 14:58:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:39,997 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-10 14:58:39,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:39,998 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:39,998 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-10 14:58:39,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {477#true} is VALID [2020-07-10 14:58:39,999 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-10 14:58:39,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:39,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:39,999 INFO L263 TraceCheckUtils]: 8: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:40,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,000 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:40,000 INFO L263 TraceCheckUtils]: 11: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:40,001 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,001 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {562#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:40,002 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#(<= |id_#res| 0)} assume true; {562#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:40,003 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {562#(<= |id_#res| 0)} {477#true} #36#return; {569#(<= |id_#t~ret0| 0)} is VALID [2020-07-10 14:58:40,004 INFO L280 TraceCheckUtils]: 16: Hoare triple {569#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:40,005 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,006 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,007 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:40,008 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:40,009 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-10 14:58:40,009 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:40,009 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:40,010 INFO L280 TraceCheckUtils]: 24: Hoare triple {478#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {478#false} is VALID [2020-07-10 14:58:40,010 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 2 == ~result~0; {478#false} is VALID [2020-07-10 14:58:40,010 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-10 14:58:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:58:40,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:40,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-10 14:58:40,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753115724] [2020-07-10 14:58:40,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-10 14:58:40,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:40,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:58:40,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:40,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:58:40,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:58:40,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:58:40,045 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2020-07-10 14:58:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:40,221 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 14:58:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:58:40,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-10 14:58:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 14:58:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 14:58:40,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-10 14:58:40,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:40,272 INFO L225 Difference]: With dead ends: 35 [2020-07-10 14:58:40,272 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:58:40,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:58:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:58:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-10 14:58:40,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:40,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:40,285 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:40,285 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:40,287 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-10 14:58:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 14:58:40,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:40,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:40,288 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-10 14:58:40,289 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-10 14:58:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:40,291 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-10 14:58:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 14:58:40,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:40,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:40,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:40,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 14:58:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 14:58:40,294 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2020-07-10 14:58:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:40,294 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 14:58:40,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:58:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 14:58:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:58:40,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:40,296 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:40,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:40,497 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash 405472645, now seen corresponding path program 2 times [2020-07-10 14:58:40,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:40,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166313063] [2020-07-10 14:58:40,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:40,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 14:58:40,543 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1012) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1159) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 14:58:40,552 INFO L168 Benchmark]: Toolchain (without parser) took 3880.20 ms. Allocated memory was 145.2 MB in the beginning and 247.5 MB in the end (delta: 102.2 MB). Free memory was 102.5 MB in the beginning and 113.2 MB in the end (delta: -10.7 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:40,553 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:58:40,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.38 ms. Allocated memory is still 145.2 MB. Free memory was 102.3 MB in the beginning and 92.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:40,555 INFO L168 Benchmark]: Boogie Preprocessor took 28.02 ms. Allocated memory is still 145.2 MB. Free memory was 92.7 MB in the beginning and 91.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:40,557 INFO L168 Benchmark]: RCFGBuilder took 368.52 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 91.4 MB in the beginning and 166.0 MB in the end (delta: -74.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:40,559 INFO L168 Benchmark]: TraceAbstraction took 3212.76 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 166.0 MB in the beginning and 113.2 MB in the end (delta: 52.8 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:40,567 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 265.38 ms. Allocated memory is still 145.2 MB. Free memory was 102.3 MB in the beginning and 92.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.02 ms. Allocated memory is still 145.2 MB. Free memory was 92.7 MB in the beginning and 91.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.52 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 91.4 MB in the beginning and 166.0 MB in the end (delta: -74.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3212.76 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 166.0 MB in the beginning and 113.2 MB in the end (delta: 52.8 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...