/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:51:35,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:51:35,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:51:35,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:51:35,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:51:35,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:51:35,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:51:35,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:51:35,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:51:35,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:51:35,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:51:35,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:51:35,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:51:35,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:51:35,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:51:35,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:51:35,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:51:35,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:51:35,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:51:36,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:51:36,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:51:36,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:51:36,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:51:36,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:51:36,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:51:36,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:51:36,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:51:36,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:51:36,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:51:36,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:51:36,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:51:36,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:51:36,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:51:36,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:51:36,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:51:36,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:51:36,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:51:36,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:51:36,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:51:36,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:51:36,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:51:36,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:51:36,028 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:51:36,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:51:36,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:51:36,030 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:51:36,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:51:36,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:51:36,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:51:36,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:51:36,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:51:36,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:51:36,032 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:51:36,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:51:36,032 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:51:36,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:51:36,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:51:36,033 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:51:36,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:51:36,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:51:36,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:51:36,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:51:36,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:51:36,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:51:36,034 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:51:36,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:51:36,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:51:36,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:51:36,344 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:51:36,344 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:51:36,345 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-11 00:51:36,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67ee578a/06271b8a73f54dc799b30bb4017fc4b4/FLAG8956adeeb [2020-07-11 00:51:36,927 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:51:36,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o2-2.c [2020-07-11 00:51:36,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67ee578a/06271b8a73f54dc799b30bb4017fc4b4/FLAG8956adeeb [2020-07-11 00:51:37,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67ee578a/06271b8a73f54dc799b30bb4017fc4b4 [2020-07-11 00:51:37,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:51:37,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:51:37,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:37,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:51:37,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:51:37,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7406a98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37, skipping insertion in model container [2020-07-11 00:51:37,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:51:37,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:51:37,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:37,517 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:51:37,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:37,549 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:51:37,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37 WrapperNode [2020-07-11 00:51:37,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:37,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:51:37,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:51:37,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:51:37,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (1/1) ... [2020-07-11 00:51:37,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:51:37,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:51:37,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:51:37,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:51:37,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (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-11 00:51:37,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:51:37,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:51:37,744 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-11 00:51:37,744 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:51:37,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:51:37,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:51:37,744 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-11 00:51:37,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:51:37,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:51:37,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:51:38,021 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:51:38,022 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:51:38,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:51:38 BoogieIcfgContainer [2020-07-11 00:51:38,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:51:38,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:51:38,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:51:38,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:51:38,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:51:37" (1/3) ... [2020-07-11 00:51:38,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1ddcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:51:38, skipping insertion in model container [2020-07-11 00:51:38,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:51:37" (2/3) ... [2020-07-11 00:51:38,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1ddcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:51:38, skipping insertion in model container [2020-07-11 00:51:38,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:51:38" (3/3) ... [2020-07-11 00:51:38,041 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o2-2.c [2020-07-11 00:51:38,056 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:51:38,064 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:51:38,082 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:51:38,108 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:51:38,109 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:51:38,109 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:51:38,109 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:51:38,109 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:51:38,109 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:51:38,110 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:51:38,110 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:51:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-11 00:51:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-11 00:51:38,139 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:38,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:38,141 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-11 00:51:38,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:38,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425239763] [2020-07-11 00:51:38,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:38,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 00:51:38,392 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-11 00:51:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:38,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-11 00:51:38,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-11 00:51:38,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:38,442 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:38,444 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-11 00:51:38,445 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-11 00:51:38,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 00:51:38,446 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-11 00:51:38,446 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-11 00:51:38,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-11 00:51:38,447 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-11 00:51:38,448 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-11 00:51:38,448 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-11 00:51:38,448 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-11 00:51:38,449 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-11 00:51:38,452 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:38,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:38,458 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-11 00:51:38,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-11 00:51:38,465 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= |main_#t~ret2| 0)} ~result~0 := #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-11 00:51:38,467 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-11 00:51:38,470 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 2 == ~result~0; {34#false} is VALID [2020-07-11 00:51:38,471 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-11 00:51:38,473 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-11 00:51:38,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425239763] [2020-07-11 00:51:38,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:38,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:38,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855059812] [2020-07-11 00:51:38,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:51:38,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:38,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:38,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:38,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:38,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:38,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:38,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:38,549 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-11 00:51:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:38,798 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-11 00:51:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:38,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:51:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-11 00:51:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-11 00:51:38,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-11 00:51:38,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:38,911 INFO L225 Difference]: With dead ends: 44 [2020-07-11 00:51:38,911 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 00:51:38,916 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:51:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 00:51:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 00:51:38,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:38,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:38,980 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:38,981 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:38,987 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-11 00:51:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:38,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:38,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:38,989 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:38,989 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:38,994 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-11 00:51:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:38,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:38,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:38,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:38,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 00:51:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-11 00:51:39,002 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-11 00:51:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:39,003 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-11 00:51:39,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:39,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-11 00:51:39,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-11 00:51:39,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:39,059 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:39,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:51:39,059 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-11 00:51:39,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:39,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [712116751] [2020-07-11 00:51:39,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-11 00:51:39,141 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-11 00:51:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:39,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,272 INFO L280 TraceCheckUtils]: 3: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,274 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-11 00:51:39,275 INFO L263 TraceCheckUtils]: 2: Hoare triple {249#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {249#true} is VALID [2020-07-11 00:51:39,275 INFO L280 TraceCheckUtils]: 3: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,276 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:39,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,279 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {273#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,281 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,282 INFO L280 TraceCheckUtils]: 10: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 3; {250#false} is VALID [2020-07-11 00:51:39,283 INFO L280 TraceCheckUtils]: 12: Hoare triple {250#false} #res := 3; {250#false} is VALID [2020-07-11 00:51:39,283 INFO L280 TraceCheckUtils]: 13: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-11 00:51:39,284 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-11 00:51:39,285 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-11 00:51:39,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-11 00:51:39,285 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-11 00:51:39,286 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-11 00:51:39,286 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-11 00:51:39,286 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-11 00:51:39,287 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-11 00:51:39,287 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-11 00:51:39,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-11 00:51:39,288 INFO L263 TraceCheckUtils]: 10: Hoare triple {249#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {249#true} is VALID [2020-07-11 00:51:39,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:39,290 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,290 INFO L280 TraceCheckUtils]: 14: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,292 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,293 INFO L280 TraceCheckUtils]: 16: Hoare triple {273#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,294 INFO L280 TraceCheckUtils]: 17: Hoare triple {273#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,295 INFO L280 TraceCheckUtils]: 18: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,296 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 3; {250#false} is VALID [2020-07-11 00:51:39,296 INFO L280 TraceCheckUtils]: 20: Hoare triple {250#false} #res := 3; {250#false} is VALID [2020-07-11 00:51:39,297 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-11 00:51:39,297 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-11 00:51:39,297 INFO L280 TraceCheckUtils]: 23: Hoare triple {250#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {250#false} is VALID [2020-07-11 00:51:39,298 INFO L280 TraceCheckUtils]: 24: Hoare triple {250#false} ~result~0 := #t~ret2; {250#false} is VALID [2020-07-11 00:51:39,298 INFO L280 TraceCheckUtils]: 25: Hoare triple {250#false} havoc #t~ret2; {250#false} is VALID [2020-07-11 00:51:39,298 INFO L280 TraceCheckUtils]: 26: Hoare triple {250#false} assume 2 == ~result~0; {250#false} is VALID [2020-07-11 00:51:39,299 INFO L280 TraceCheckUtils]: 27: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-11 00:51:39,300 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-11 00:51:39,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [712116751] [2020-07-11 00:51:39,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:39,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:39,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739479352] [2020-07-11 00:51:39,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-11 00:51:39,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:39,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:39,340 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-11 00:51:39,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:39,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:39,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:39,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:39,342 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2020-07-11 00:51:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:39,512 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-11 00:51:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:39,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-11 00:51:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-11 00:51:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-11 00:51:39,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-11 00:51:39,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:39,596 INFO L225 Difference]: With dead ends: 49 [2020-07-11 00:51:39,596 INFO L226 Difference]: Without dead ends: 35 [2020-07-11 00:51:39,597 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:51:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-11 00:51:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-11 00:51:39,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:39,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:39,625 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:39,625 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:39,629 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-11 00:51:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-11 00:51:39,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:39,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:39,631 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-11 00:51:39,631 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-11 00:51:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:39,635 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-11 00:51:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-11 00:51:39,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:39,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:39,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:39,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 00:51:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-11 00:51:39,641 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2020-07-11 00:51:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:39,641 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-11 00:51:39,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:39,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-11 00:51:39,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-11 00:51:39,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:39,689 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:39,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:51:39,690 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-11 00:51:39,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:39,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223654814] [2020-07-11 00:51:39,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-11 00:51:39,754 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-11 00:51:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:39,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:39,883 INFO L280 TraceCheckUtils]: 2: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,884 INFO L280 TraceCheckUtils]: 3: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,886 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:39,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-11 00:51:39,888 INFO L263 TraceCheckUtils]: 2: Hoare triple {512#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {512#true} is VALID [2020-07-11 00:51:39,888 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:39,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:39,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,894 INFO L280 TraceCheckUtils]: 6: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,903 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,904 INFO L280 TraceCheckUtils]: 8: Hoare triple {538#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,906 INFO L280 TraceCheckUtils]: 9: Hoare triple {538#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,908 INFO L280 TraceCheckUtils]: 10: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,912 INFO L280 TraceCheckUtils]: 11: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,913 INFO L280 TraceCheckUtils]: 12: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:39,914 INFO L280 TraceCheckUtils]: 13: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:39,916 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-11 00:51:39,916 INFO L263 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2020-07-11 00:51:39,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-11 00:51:39,917 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-11 00:51:39,917 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#true} call #t~ret3 := main(); {512#true} is VALID [2020-07-11 00:51:39,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {512#true} is VALID [2020-07-11 00:51:39,918 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} ~input~0 := #t~nondet1; {512#true} is VALID [2020-07-11 00:51:39,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#true} havoc #t~nondet1; {512#true} is VALID [2020-07-11 00:51:39,919 INFO L263 TraceCheckUtils]: 7: Hoare triple {512#true} call #t~ret2 := id(~input~0); {512#true} is VALID [2020-07-11 00:51:39,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:39,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-11 00:51:39,920 INFO L263 TraceCheckUtils]: 10: Hoare triple {512#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {512#true} is VALID [2020-07-11 00:51:39,920 INFO L280 TraceCheckUtils]: 11: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:39,920 INFO L280 TraceCheckUtils]: 12: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:39,923 INFO L280 TraceCheckUtils]: 13: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,923 INFO L280 TraceCheckUtils]: 14: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,925 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,926 INFO L280 TraceCheckUtils]: 16: Hoare triple {538#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:39,928 INFO L280 TraceCheckUtils]: 17: Hoare triple {538#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,928 INFO L280 TraceCheckUtils]: 18: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,929 INFO L280 TraceCheckUtils]: 19: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {539#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:39,930 INFO L280 TraceCheckUtils]: 20: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:39,930 INFO L280 TraceCheckUtils]: 21: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:39,932 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-11 00:51:39,933 INFO L280 TraceCheckUtils]: 23: Hoare triple {531#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-11 00:51:39,937 INFO L280 TraceCheckUtils]: 24: Hoare triple {531#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-11 00:51:39,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {532#(<= main_~result~0 1)} havoc #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-11 00:51:39,943 INFO L280 TraceCheckUtils]: 26: Hoare triple {532#(<= main_~result~0 1)} assume 2 == ~result~0; {513#false} is VALID [2020-07-11 00:51:39,944 INFO L280 TraceCheckUtils]: 27: Hoare triple {513#false} assume !false; {513#false} is VALID [2020-07-11 00:51:39,945 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-11 00:51:39,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223654814] [2020-07-11 00:51:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:39,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:51:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127581771] [2020-07-11 00:51:39,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-11 00:51:39,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:39,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:51:39,993 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-11 00:51:39,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:51:39,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:39,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:51:39,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:51:39,995 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2020-07-11 00:51:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,323 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-11 00:51:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:51:40,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-11 00:51:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-11 00:51:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-11 00:51:40,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-11 00:51:40,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:40,379 INFO L225 Difference]: With dead ends: 41 [2020-07-11 00:51:40,379 INFO L226 Difference]: Without dead ends: 35 [2020-07-11 00:51:40,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:51:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-11 00:51:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-11 00:51:40,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:40,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,408 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,408 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,411 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 00:51:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:40,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:40,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:40,413 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,413 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,416 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 00:51:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:40,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:40,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:40,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:40,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 00:51:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-11 00:51:40,420 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-11 00:51:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:40,420 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-11 00:51:40,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:51:40,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-11 00:51:40,483 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-11 00:51:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 00:51:40,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:40,485 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:40,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:51:40,485 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:40,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:40,486 INFO L82 PathProgramCache]: Analyzing trace with hash 170302224, now seen corresponding path program 1 times [2020-07-11 00:51:40,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:40,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [278313231] [2020-07-11 00:51:40,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,590 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-11 00:51:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:40,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:40,675 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,676 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:40,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:40,677 INFO L263 TraceCheckUtils]: 2: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-11 00:51:40,677 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:40,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:40,678 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,678 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:40,678 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:40,679 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,679 INFO L280 TraceCheckUtils]: 10: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,679 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-11 00:51:40,680 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:40,680 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,680 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:40,681 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:40,681 INFO L263 TraceCheckUtils]: 2: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-11 00:51:40,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,682 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:40,682 INFO L263 TraceCheckUtils]: 5: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-11 00:51:40,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:40,683 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:40,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,683 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:40,684 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:40,684 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,684 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-11 00:51:40,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:40,685 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,685 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:40,685 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:40,685 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,686 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,686 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} assume ~ret~0 > 3; {772#true} is VALID [2020-07-11 00:51:40,687 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} #res := 3; {818#(<= 3 |id_#res|)} is VALID [2020-07-11 00:51:40,688 INFO L280 TraceCheckUtils]: 23: Hoare triple {818#(<= 3 |id_#res|)} assume true; {818#(<= 3 |id_#res|)} is VALID [2020-07-11 00:51:40,689 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {818#(<= 3 |id_#res|)} {772#true} #43#return; {801#(<= 3 |main_#t~ret2|)} is VALID [2020-07-11 00:51:40,689 INFO L263 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2020-07-11 00:51:40,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,690 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-11 00:51:40,690 INFO L263 TraceCheckUtils]: 3: Hoare triple {772#true} call #t~ret3 := main(); {772#true} is VALID [2020-07-11 00:51:40,690 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:40,690 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} ~input~0 := #t~nondet1; {772#true} is VALID [2020-07-11 00:51:40,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} havoc #t~nondet1; {772#true} is VALID [2020-07-11 00:51:40,691 INFO L263 TraceCheckUtils]: 7: Hoare triple {772#true} call #t~ret2 := id(~input~0); {772#true} is VALID [2020-07-11 00:51:40,691 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:40,691 INFO L263 TraceCheckUtils]: 10: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-11 00:51:40,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:40,692 INFO L263 TraceCheckUtils]: 13: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-11 00:51:40,692 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:40,693 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:40,693 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:40,693 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,693 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:40,694 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:40,694 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,694 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,694 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-11 00:51:40,695 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:40,695 INFO L280 TraceCheckUtils]: 24: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,695 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:40,695 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:40,696 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,696 INFO L280 TraceCheckUtils]: 28: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:40,696 INFO L280 TraceCheckUtils]: 29: Hoare triple {772#true} assume ~ret~0 > 3; {772#true} is VALID [2020-07-11 00:51:40,697 INFO L280 TraceCheckUtils]: 30: Hoare triple {772#true} #res := 3; {818#(<= 3 |id_#res|)} is VALID [2020-07-11 00:51:40,698 INFO L280 TraceCheckUtils]: 31: Hoare triple {818#(<= 3 |id_#res|)} assume true; {818#(<= 3 |id_#res|)} is VALID [2020-07-11 00:51:40,699 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {818#(<= 3 |id_#res|)} {772#true} #43#return; {801#(<= 3 |main_#t~ret2|)} is VALID [2020-07-11 00:51:40,700 INFO L280 TraceCheckUtils]: 33: Hoare triple {801#(<= 3 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {801#(<= 3 |main_#t~ret2|)} is VALID [2020-07-11 00:51:40,700 INFO L280 TraceCheckUtils]: 34: Hoare triple {801#(<= 3 |main_#t~ret2|)} ~result~0 := #t~ret2; {802#(<= 3 main_~result~0)} is VALID [2020-07-11 00:51:40,701 INFO L280 TraceCheckUtils]: 35: Hoare triple {802#(<= 3 main_~result~0)} havoc #t~ret2; {802#(<= 3 main_~result~0)} is VALID [2020-07-11 00:51:40,702 INFO L280 TraceCheckUtils]: 36: Hoare triple {802#(<= 3 main_~result~0)} assume 2 == ~result~0; {773#false} is VALID [2020-07-11 00:51:40,702 INFO L280 TraceCheckUtils]: 37: Hoare triple {773#false} assume !false; {773#false} is VALID [2020-07-11 00:51:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-11 00:51:40,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [278313231] [2020-07-11 00:51:40,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:40,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:40,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848526917] [2020-07-11 00:51:40,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-11 00:51:40,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:40,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:40,736 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-11 00:51:40,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:40,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:40,737 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2020-07-11 00:51:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,873 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 00:51:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:40,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-11 00:51:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-11 00:51:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-11 00:51:40,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-11 00:51:40,931 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-11 00:51:40,933 INFO L225 Difference]: With dead ends: 43 [2020-07-11 00:51:40,933 INFO L226 Difference]: Without dead ends: 37 [2020-07-11 00:51:40,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:51:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-11 00:51:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-11 00:51:40,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:40,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:40,974 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:40,974 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,978 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-11 00:51:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-11 00:51:40,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:40,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:40,982 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-11 00:51:40,982 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-11 00:51:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,990 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-11 00:51:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-11 00:51:40,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:40,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:40,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:40,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 00:51:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-11 00:51:40,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 38 [2020-07-11 00:51:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:41,001 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-11 00:51:41,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:41,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-11 00:51:41,040 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-11 00:51:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 00:51:41,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:41,042 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:41,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:51:41,042 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 2 times [2020-07-11 00:51:41,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:41,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272074878] [2020-07-11 00:51:41,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:41,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:51:41,083 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.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) 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-11 00:51:41,090 INFO L168 Benchmark]: Toolchain (without parser) took 3779.12 ms. Allocated memory was 134.2 MB in the beginning and 256.9 MB in the end (delta: 122.7 MB). Free memory was 99.8 MB in the beginning and 120.9 MB in the end (delta: -21.1 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:41,091 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 117.7 MB in the beginning and 117.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:51:41,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.93 ms. Allocated memory is still 134.2 MB. Free memory was 99.5 MB in the beginning and 89.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:41,092 INFO L168 Benchmark]: Boogie Preprocessor took 120.87 ms. Allocated memory was 134.2 MB in the beginning and 198.7 MB in the end (delta: 64.5 MB). Free memory was 89.8 MB in the beginning and 177.9 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:41,093 INFO L168 Benchmark]: RCFGBuilder took 356.56 ms. Allocated memory is still 198.7 MB. Free memory was 177.9 MB in the beginning and 160.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:41,094 INFO L168 Benchmark]: TraceAbstraction took 3056.40 ms. Allocated memory was 198.7 MB in the beginning and 256.9 MB in the end (delta: 58.2 MB). Free memory was 160.0 MB in the beginning and 120.9 MB in the end (delta: 39.1 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:41,101 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.24 ms. Allocated memory is still 134.2 MB. Free memory was 117.7 MB in the beginning and 117.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.93 ms. Allocated memory is still 134.2 MB. Free memory was 99.5 MB in the beginning and 89.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.87 ms. Allocated memory was 134.2 MB in the beginning and 198.7 MB in the end (delta: 64.5 MB). Free memory was 89.8 MB in the beginning and 177.9 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.56 ms. Allocated memory is still 198.7 MB. Free memory was 177.9 MB in the beginning and 160.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3056.40 ms. Allocated memory was 198.7 MB in the beginning and 256.9 MB in the end (delta: 58.2 MB). Free memory was 160.0 MB in the beginning and 120.9 MB in the end (delta: 39.1 MB). Peak memory consumption was 97.3 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...