/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_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:51:36,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:51:36,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:51:36,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:51:36,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:51:36,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:51:36,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:51:36,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:51:36,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:51:36,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:51:36,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:51:36,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:51:36,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:51:36,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:51:36,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:51:36,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:51:36,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:51:36,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:51:36,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:51:36,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:51:36,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:51:36,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:51:36,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:51:36,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:51:36,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:51:36,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:51:36,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:51:36,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:51:36,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:51:36,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:51:36,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:51:36,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:51:36,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:51:36,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:51:36,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:51:36,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:51:36,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:51:36,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:51:36,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:51:36,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:51:36,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:51:36,446 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,455 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:51:36,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:51:36,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:51:36,457 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:51:36,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:51:36,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:51:36,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:51:36,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:51:36,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:51:36,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:51:36,458 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:51:36,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:51:36,458 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:51:36,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:51:36,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:51:36,459 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:51:36,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:51:36,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:51:36,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:51:36,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:51:36,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:51:36,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:51:36,460 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,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:51:36,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:51:36,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:51:36,755 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:51:36,756 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:51:36,757 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-11 00:51:36,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ccedb27/040c6a0ec978427f8622b7091598a4df/FLAGe589c331c [2020-07-11 00:51:37,305 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:51:37,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-11 00:51:37,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ccedb27/040c6a0ec978427f8622b7091598a4df/FLAGe589c331c [2020-07-11 00:51:37,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ccedb27/040c6a0ec978427f8622b7091598a4df [2020-07-11 00:51:37,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:51:37,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:51:37,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:37,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:51:37,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:51:37,701 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,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b757e7f 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,705 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,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:51:37,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:51:37,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:37,912 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:51:37,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:51:37,946 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:51:37,946 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,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:51:37,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:51:37,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:51:37,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:51:37,962 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,962 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,968 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,968 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,973 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,976 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,977 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,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:51:37,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:51:37,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:51:37,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:51:37,980 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:38,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:51:38,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:51:38,133 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-11 00:51:38,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:51:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:51:38,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:51:38,134 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-11 00:51:38,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:51:38,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:51:38,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:51:38,504 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:51:38,505 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:51:38,509 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,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:51:38,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:51:38,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:51:38,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:51:38,514 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,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739eb12c 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,515 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,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739eb12c 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,516 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,518 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o5-2.c [2020-07-11 00:51:38,529 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:51:38,538 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:51:38,552 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:51:38,573 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:51:38,573 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:51:38,573 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:51:38,574 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:51:38,574 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:51:38,574 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:51:38,574 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:51:38,574 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:51:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-11 00:51:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-11 00:51:38,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:38,601 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,602 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:38,609 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-11 00:51:38,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:38,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658034293] [2020-07-11 00:51:38,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:38,827 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 00:51:38,828 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-11 00:51:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:38,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-11 00:51:38,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-11 00:51:38,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:38,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:38,890 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,891 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-11 00:51:38,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 00:51:38,892 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-11 00:51:38,892 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-11 00:51:38,892 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,893 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-11 00:51:38,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-11 00:51:38,894 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-11 00:51:38,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-11 00:51:38,894 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-11 00:51:38,896 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:38,901 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:38,906 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,907 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,908 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,911 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,912 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 5 == ~result~0; {34#false} is VALID [2020-07-11 00:51:38,913 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-11 00:51:38,916 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,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658034293] [2020-07-11 00:51:38,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:38,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:38,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049056997] [2020-07-11 00:51:38,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:51:38,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:38,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:38,981 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,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:38,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:38,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:38,996 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-11 00:51:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:39,237 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-11 00:51:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:39,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:51:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-11 00:51:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-11 00:51:39,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-11 00:51:39,354 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:39,367 INFO L225 Difference]: With dead ends: 44 [2020-07-11 00:51:39,368 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 00:51:39,372 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:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 00:51:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 00:51:39,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:39,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:39,433 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:39,433 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:39,440 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-11 00:51:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:39,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:39,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:39,441 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:39,442 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:51:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:39,447 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-11 00:51:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:39,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:39,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:39,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:39,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 00:51:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-11 00:51:39,454 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-11 00:51:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:39,455 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-11 00:51:39,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:39,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-11 00:51:39,500 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,500 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 00:51:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-11 00:51:39,501 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:39,502 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,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:51:39,503 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-11 00:51:39,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:39,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [411842513] [2020-07-11 00:51:39,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-11 00:51:39,606 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-11 00:51:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:39,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:39,719 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,721 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,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-11 00:51:39,723 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,723 INFO L280 TraceCheckUtils]: 3: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:39,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,727 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,728 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,729 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,730 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,731 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,732 INFO L280 TraceCheckUtils]: 12: Hoare triple {250#false} #res := 3; {250#false} is VALID [2020-07-11 00:51:39,732 INFO L280 TraceCheckUtils]: 13: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-11 00:51:39,732 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-11 00:51:39,733 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-11 00:51:39,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-11 00:51:39,734 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-11 00:51:39,734 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-11 00:51:39,735 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,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-11 00:51:39,735 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-11 00:51:39,735 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-11 00:51:39,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,736 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-11 00:51:39,736 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,737 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-11 00:51:39,737 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-11 00:51:39,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:39,741 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,743 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,743 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,744 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,745 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,745 INFO L280 TraceCheckUtils]: 20: Hoare triple {250#false} #res := 3; {250#false} is VALID [2020-07-11 00:51:39,746 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-11 00:51:39,746 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-11 00:51:39,746 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,746 INFO L280 TraceCheckUtils]: 24: Hoare triple {250#false} ~result~0 := #t~ret2; {250#false} is VALID [2020-07-11 00:51:39,747 INFO L280 TraceCheckUtils]: 25: Hoare triple {250#false} havoc #t~ret2; {250#false} is VALID [2020-07-11 00:51:39,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {250#false} assume 5 == ~result~0; {250#false} is VALID [2020-07-11 00:51:39,747 INFO L280 TraceCheckUtils]: 27: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-11 00:51:39,749 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,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [411842513] [2020-07-11 00:51:39,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:39,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:39,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846234668] [2020-07-11 00:51:39,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-11 00:51:39,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:39,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:39,786 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,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:39,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:39,787 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2020-07-11 00:51:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:39,949 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-11 00:51:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:39,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-11 00:51:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-11 00:51:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-11 00:51:39,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-11 00:51:40,029 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:40,033 INFO L225 Difference]: With dead ends: 49 [2020-07-11 00:51:40,034 INFO L226 Difference]: Without dead ends: 35 [2020-07-11 00:51:40,036 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:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-11 00:51:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-11 00:51:40,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:40,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:40,078 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:40,078 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-11 00:51:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,087 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-11 00:51:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-11 00:51:40,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:40,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:40,089 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-11 00:51:40,090 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-11 00:51:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,098 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-11 00:51:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-11 00:51:40,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:40,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:40,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:40,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 00:51:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-11 00:51:40,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2020-07-11 00:51:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:40,111 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-11 00:51:40,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:40,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-11 00:51:40,157 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:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 00:51:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-11 00:51:40,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:40,160 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:40,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:51:40,161 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-11 00:51:40,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:40,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2030389914] [2020-07-11 00:51:40,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-11 00:51:40,258 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-11 00:51:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:40,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:40,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:40,384 INFO L280 TraceCheckUtils]: 3: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:40,386 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:40,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:40,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-11 00:51:40,387 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:40,387 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:40,388 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:40,388 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:40,389 INFO L280 TraceCheckUtils]: 6: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:40,391 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:40,391 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:40,392 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:40,393 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:40,394 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:40,394 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:40,395 INFO L280 TraceCheckUtils]: 13: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:40,396 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:40,397 INFO L263 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2020-07-11 00:51:40,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-11 00:51:40,397 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-11 00:51:40,398 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#true} call #t~ret3 := main(); {512#true} is VALID [2020-07-11 00:51:40,398 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {512#true} is VALID [2020-07-11 00:51:40,398 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} ~input~0 := #t~nondet1; {512#true} is VALID [2020-07-11 00:51:40,399 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#true} havoc #t~nondet1; {512#true} is VALID [2020-07-11 00:51:40,399 INFO L263 TraceCheckUtils]: 7: Hoare triple {512#true} call #t~ret2 := id(~input~0); {512#true} is VALID [2020-07-11 00:51:40,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:40,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-11 00:51:40,400 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:40,400 INFO L280 TraceCheckUtils]: 11: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-11 00:51:40,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-11 00:51:40,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:40,402 INFO L280 TraceCheckUtils]: 14: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:40,403 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:40,404 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:40,405 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:40,405 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:40,406 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:40,407 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:40,407 INFO L280 TraceCheckUtils]: 21: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:40,408 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:40,409 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:40,410 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:40,411 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:40,411 INFO L280 TraceCheckUtils]: 26: Hoare triple {532#(<= main_~result~0 1)} assume 5 == ~result~0; {513#false} is VALID [2020-07-11 00:51:40,412 INFO L280 TraceCheckUtils]: 27: Hoare triple {513#false} assume !false; {513#false} is VALID [2020-07-11 00:51:40,413 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:40,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2030389914] [2020-07-11 00:51:40,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:40,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:51:40,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211623361] [2020-07-11 00:51:40,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-11 00:51:40,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:40,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:51:40,458 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:40,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:51:40,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:51:40,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:51:40,460 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2020-07-11 00:51:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,791 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-11 00:51:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:51:40,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-11 00:51:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-11 00:51:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:51:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-11 00:51:40,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-11 00:51:40,845 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,847 INFO L225 Difference]: With dead ends: 41 [2020-07-11 00:51:40,848 INFO L226 Difference]: Without dead ends: 35 [2020-07-11 00:51:40,848 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,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-11 00:51:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-11 00:51:40,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:40,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,874 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,874 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,877 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 00:51:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:40,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:40,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:40,878 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,878 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-11 00:51:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:40,881 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 00:51:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:40,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:40,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:40,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:40,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 00:51:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-11 00:51:40,885 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-11 00:51:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:40,885 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-11 00:51:40,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:51:40,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-11 00:51:40,933 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,933 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 00:51:40,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:40,936 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,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:51:40,936 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash 170302224, now seen corresponding path program 1 times [2020-07-11 00:51:40,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:40,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [383541140] [2020-07-11 00:51:40,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:40,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:40,988 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-11 00:51:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:41,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:41,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:41,033 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:41,033 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:41,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:41,034 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:41,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:41,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:41,035 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:41,036 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:41,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:41,036 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,036 INFO L280 TraceCheckUtils]: 10: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,037 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-11 00:51:41,037 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:41,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:41,038 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:41,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:41,039 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:41,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,039 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:41,039 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:41,040 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,040 INFO L280 TraceCheckUtils]: 7: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:41,040 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:41,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:41,041 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:41,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:41,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,042 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-11 00:51:41,042 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:41,042 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:41,042 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:41,043 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:41,043 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,043 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} assume ~ret~0 > 3; {772#true} is VALID [2020-07-11 00:51:41,048 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} #res := 3; {818#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:41,049 INFO L280 TraceCheckUtils]: 23: Hoare triple {818#(<= |id_#res| 3)} assume true; {818#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:41,051 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {818#(<= |id_#res| 3)} {772#true} #43#return; {801#(<= |main_#t~ret2| 3)} is VALID [2020-07-11 00:51:41,052 INFO L263 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2020-07-11 00:51:41,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:41,053 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-11 00:51:41,053 INFO L263 TraceCheckUtils]: 3: Hoare triple {772#true} call #t~ret3 := main(); {772#true} is VALID [2020-07-11 00:51:41,053 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:41,053 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} ~input~0 := #t~nondet1; {772#true} is VALID [2020-07-11 00:51:41,054 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} havoc #t~nondet1; {772#true} is VALID [2020-07-11 00:51:41,054 INFO L263 TraceCheckUtils]: 7: Hoare triple {772#true} call #t~ret2 := id(~input~0); {772#true} is VALID [2020-07-11 00:51:41,054 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,054 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:41,055 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:41,055 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-11 00:51:41,056 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:41,056 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-11 00:51:41,056 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-11 00:51:41,056 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-11 00:51:41,057 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:41,057 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:41,057 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:41,057 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,058 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,058 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-11 00:51:41,058 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-11 00:51:41,058 INFO L280 TraceCheckUtils]: 24: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-11 00:51:41,059 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-11 00:51:41,059 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-11 00:51:41,059 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,059 INFO L280 TraceCheckUtils]: 28: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-11 00:51:41,060 INFO L280 TraceCheckUtils]: 29: Hoare triple {772#true} assume ~ret~0 > 3; {772#true} is VALID [2020-07-11 00:51:41,061 INFO L280 TraceCheckUtils]: 30: Hoare triple {772#true} #res := 3; {818#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:41,062 INFO L280 TraceCheckUtils]: 31: Hoare triple {818#(<= |id_#res| 3)} assume true; {818#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:41,065 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {818#(<= |id_#res| 3)} {772#true} #43#return; {801#(<= |main_#t~ret2| 3)} is VALID [2020-07-11 00:51:41,068 INFO L280 TraceCheckUtils]: 33: Hoare triple {801#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {801#(<= |main_#t~ret2| 3)} is VALID [2020-07-11 00:51:41,068 INFO L280 TraceCheckUtils]: 34: Hoare triple {801#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {802#(<= main_~result~0 3)} is VALID [2020-07-11 00:51:41,069 INFO L280 TraceCheckUtils]: 35: Hoare triple {802#(<= main_~result~0 3)} havoc #t~ret2; {802#(<= main_~result~0 3)} is VALID [2020-07-11 00:51:41,070 INFO L280 TraceCheckUtils]: 36: Hoare triple {802#(<= main_~result~0 3)} assume 5 == ~result~0; {773#false} is VALID [2020-07-11 00:51:41,070 INFO L280 TraceCheckUtils]: 37: Hoare triple {773#false} assume !false; {773#false} is VALID [2020-07-11 00:51:41,072 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:41,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [383541140] [2020-07-11 00:51:41,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:51:41,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:51:41,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72349916] [2020-07-11 00:51:41,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-11 00:51:41,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:41,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:51:41,103 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:41,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:51:41,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:51:41,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:51:41,105 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2020-07-11 00:51:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:41,229 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 00:51:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:51:41,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-11 00:51:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-11 00:51:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:51:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-11 00:51:41,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-11 00:51:41,282 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:41,284 INFO L225 Difference]: With dead ends: 43 [2020-07-11 00:51:41,285 INFO L226 Difference]: Without dead ends: 37 [2020-07-11 00:51:41,285 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:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-11 00:51:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-11 00:51:41,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:41,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:41,324 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:41,324 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-11 00:51:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:41,327 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-11 00:51:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-11 00:51:41,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:41,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:41,328 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-11 00:51:41,328 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-11 00:51:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:41,331 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-11 00:51:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-11 00:51:41,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:41,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:41,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:41,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 00:51:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-11 00:51:41,334 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 38 [2020-07-11 00:51:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:41,335 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-11 00:51:41,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:51:41,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-11 00:51:41,377 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,378 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 00:51:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 00:51:41,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:41,379 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,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:51:41,380 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 2 times [2020-07-11 00:51:41,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:41,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [80012310] [2020-07-11 00:51:41,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:41,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-11 00:51:41,456 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-11 00:51:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:41,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-11 00:51:41,641 INFO L280 TraceCheckUtils]: 2: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:41,642 INFO L280 TraceCheckUtils]: 3: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:41,643 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:41,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:41,644 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-11 00:51:41,645 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,645 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-11 00:51:41,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:41,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:41,648 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:41,648 INFO L280 TraceCheckUtils]: 8: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:41,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,663 INFO L280 TraceCheckUtils]: 10: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,666 INFO L280 TraceCheckUtils]: 11: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,669 INFO L280 TraceCheckUtils]: 12: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:41,672 INFO L280 TraceCheckUtils]: 13: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:41,673 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:41,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:41,675 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-11 00:51:41,675 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,676 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:41,676 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-11 00:51:41,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-11 00:51:41,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:41,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:41,679 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:41,680 INFO L280 TraceCheckUtils]: 11: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:41,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,682 INFO L280 TraceCheckUtils]: 13: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,683 INFO L280 TraceCheckUtils]: 14: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:41,684 INFO L280 TraceCheckUtils]: 16: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:41,686 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:41,687 INFO L280 TraceCheckUtils]: 18: Hoare triple {1104#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:41,688 INFO L280 TraceCheckUtils]: 19: Hoare triple {1104#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:41,688 INFO L280 TraceCheckUtils]: 20: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:41,689 INFO L280 TraceCheckUtils]: 21: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:41,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:41,691 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:41,692 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-11 00:51:41,693 INFO L263 TraceCheckUtils]: 0: Hoare triple {1058#true} call ULTIMATE.init(); {1058#true} is VALID [2020-07-11 00:51:41,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-11 00:51:41,694 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-11 00:51:41,694 INFO L263 TraceCheckUtils]: 3: Hoare triple {1058#true} call #t~ret3 := main(); {1058#true} is VALID [2020-07-11 00:51:41,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1058#true} is VALID [2020-07-11 00:51:41,694 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} ~input~0 := #t~nondet1; {1058#true} is VALID [2020-07-11 00:51:41,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} havoc #t~nondet1; {1058#true} is VALID [2020-07-11 00:51:41,695 INFO L263 TraceCheckUtils]: 7: Hoare triple {1058#true} call #t~ret2 := id(~input~0); {1058#true} is VALID [2020-07-11 00:51:41,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:41,696 INFO L263 TraceCheckUtils]: 10: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-11 00:51:41,696 INFO L280 TraceCheckUtils]: 11: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-11 00:51:41,696 INFO L263 TraceCheckUtils]: 13: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-11 00:51:41,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-11 00:51:41,697 INFO L280 TraceCheckUtils]: 15: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-11 00:51:41,698 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:41,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:41,700 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:41,701 INFO L280 TraceCheckUtils]: 19: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:41,701 INFO L280 TraceCheckUtils]: 20: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,702 INFO L280 TraceCheckUtils]: 21: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,703 INFO L280 TraceCheckUtils]: 22: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:41,703 INFO L280 TraceCheckUtils]: 23: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:41,704 INFO L280 TraceCheckUtils]: 24: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:41,705 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:41,706 INFO L280 TraceCheckUtils]: 26: Hoare triple {1104#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:41,707 INFO L280 TraceCheckUtils]: 27: Hoare triple {1104#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:41,707 INFO L280 TraceCheckUtils]: 28: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:41,708 INFO L280 TraceCheckUtils]: 29: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1105#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:41,709 INFO L280 TraceCheckUtils]: 30: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:41,709 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:41,710 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-11 00:51:41,711 INFO L280 TraceCheckUtils]: 33: Hoare triple {1087#(<= |main_#t~ret2| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-11 00:51:41,712 INFO L280 TraceCheckUtils]: 34: Hoare triple {1087#(<= |main_#t~ret2| 2)} ~result~0 := #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-11 00:51:41,712 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= main_~result~0 2)} havoc #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-11 00:51:41,713 INFO L280 TraceCheckUtils]: 36: Hoare triple {1088#(<= main_~result~0 2)} assume 5 == ~result~0; {1059#false} is VALID [2020-07-11 00:51:41,713 INFO L280 TraceCheckUtils]: 37: Hoare triple {1059#false} assume !false; {1059#false} is VALID [2020-07-11 00:51:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-11 00:51:41,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [80012310] [2020-07-11 00:51:41,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:41,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 00:51:41,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357849254] [2020-07-11 00:51:41,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-11 00:51:41,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:41,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 00:51:41,755 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:41,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 00:51:41,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 00:51:41,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:51:41,757 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 11 states. [2020-07-11 00:51:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:42,055 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2020-07-11 00:51:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 00:51:42,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-11 00:51:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:51:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-11 00:51:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:51:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-11 00:51:42,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2020-07-11 00:51:42,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:42,141 INFO L225 Difference]: With dead ends: 64 [2020-07-11 00:51:42,141 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 00:51:42,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-11 00:51:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 00:51:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-11 00:51:42,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:42,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-11 00:51:42,191 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-11 00:51:42,191 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-11 00:51:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:42,198 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 00:51:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 00:51:42,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:42,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:42,199 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-11 00:51:42,199 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-11 00:51:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:42,203 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 00:51:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 00:51:42,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:42,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:42,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:42,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 00:51:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-11 00:51:42,212 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 38 [2020-07-11 00:51:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:42,213 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-11 00:51:42,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 00:51:42,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-11 00:51:42,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-11 00:51:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 00:51:42,262 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:51:42,262 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:51:42,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:51:42,263 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:51:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:51:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1045014785, now seen corresponding path program 3 times [2020-07-11 00:51:42,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:51:42,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [52234666] [2020-07-11 00:51:42,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:51:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:42,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-11 00:51:42,353 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-11 00:51:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:51:42,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:42,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,574 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,575 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,576 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:42,577 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,577 INFO L280 TraceCheckUtils]: 6: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,579 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,581 INFO L280 TraceCheckUtils]: 10: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,582 INFO L280 TraceCheckUtils]: 12: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:42,583 INFO L280 TraceCheckUtils]: 13: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:42,584 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:42,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,585 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,585 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,586 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,586 INFO L263 TraceCheckUtils]: 5: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:42,587 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,588 INFO L280 TraceCheckUtils]: 9: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,589 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,590 INFO L280 TraceCheckUtils]: 11: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,591 INFO L280 TraceCheckUtils]: 13: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,592 INFO L280 TraceCheckUtils]: 14: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,592 INFO L280 TraceCheckUtils]: 15: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:42,593 INFO L280 TraceCheckUtils]: 16: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:42,594 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:42,595 INFO L280 TraceCheckUtils]: 18: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:42,596 INFO L280 TraceCheckUtils]: 19: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,597 INFO L280 TraceCheckUtils]: 20: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,597 INFO L280 TraceCheckUtils]: 21: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,598 INFO L280 TraceCheckUtils]: 22: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:42,599 INFO L280 TraceCheckUtils]: 23: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:42,600 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:42,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,602 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,602 INFO L263 TraceCheckUtils]: 5: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,603 INFO L263 TraceCheckUtils]: 8: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,603 INFO L280 TraceCheckUtils]: 10: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:42,604 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,606 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,607 INFO L280 TraceCheckUtils]: 14: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,609 INFO L280 TraceCheckUtils]: 17: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:42,611 INFO L280 TraceCheckUtils]: 19: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:42,612 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:42,613 INFO L280 TraceCheckUtils]: 21: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:42,614 INFO L280 TraceCheckUtils]: 22: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,614 INFO L280 TraceCheckUtils]: 23: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,615 INFO L280 TraceCheckUtils]: 24: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,616 INFO L280 TraceCheckUtils]: 25: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:42,616 INFO L280 TraceCheckUtils]: 26: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:42,617 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:42,618 INFO L280 TraceCheckUtils]: 28: Hoare triple {1494#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:42,619 INFO L280 TraceCheckUtils]: 29: Hoare triple {1494#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:42,620 INFO L280 TraceCheckUtils]: 30: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:42,620 INFO L280 TraceCheckUtils]: 31: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 3); {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:42,621 INFO L280 TraceCheckUtils]: 32: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:42,622 INFO L280 TraceCheckUtils]: 33: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:42,623 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-11 00:51:42,625 INFO L263 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2020-07-11 00:51:42,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-11 00:51:42,625 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-11 00:51:42,626 INFO L263 TraceCheckUtils]: 3: Hoare triple {1428#true} call #t~ret3 := main(); {1428#true} is VALID [2020-07-11 00:51:42,626 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1428#true} is VALID [2020-07-11 00:51:42,626 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} ~input~0 := #t~nondet1; {1428#true} is VALID [2020-07-11 00:51:42,626 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} havoc #t~nondet1; {1428#true} is VALID [2020-07-11 00:51:42,627 INFO L263 TraceCheckUtils]: 7: Hoare triple {1428#true} call #t~ret2 := id(~input~0); {1428#true} is VALID [2020-07-11 00:51:42,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,627 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,627 INFO L263 TraceCheckUtils]: 10: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,627 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,628 INFO L280 TraceCheckUtils]: 12: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,628 INFO L263 TraceCheckUtils]: 13: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,628 INFO L280 TraceCheckUtils]: 14: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,628 INFO L280 TraceCheckUtils]: 15: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-11 00:51:42,629 INFO L263 TraceCheckUtils]: 16: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-11 00:51:42,629 INFO L280 TraceCheckUtils]: 17: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-11 00:51:42,629 INFO L280 TraceCheckUtils]: 18: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-11 00:51:42,630 INFO L280 TraceCheckUtils]: 19: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,631 INFO L280 TraceCheckUtils]: 20: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-11 00:51:42,632 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,633 INFO L280 TraceCheckUtils]: 22: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-11 00:51:42,634 INFO L280 TraceCheckUtils]: 23: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,634 INFO L280 TraceCheckUtils]: 24: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,635 INFO L280 TraceCheckUtils]: 25: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-11 00:51:42,635 INFO L280 TraceCheckUtils]: 26: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:42,636 INFO L280 TraceCheckUtils]: 27: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-11 00:51:42,637 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:42,638 INFO L280 TraceCheckUtils]: 29: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-11 00:51:42,639 INFO L280 TraceCheckUtils]: 30: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,639 INFO L280 TraceCheckUtils]: 31: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,640 INFO L280 TraceCheckUtils]: 32: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-11 00:51:42,641 INFO L280 TraceCheckUtils]: 33: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:42,641 INFO L280 TraceCheckUtils]: 34: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-11 00:51:42,643 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:42,643 INFO L280 TraceCheckUtils]: 36: Hoare triple {1494#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-11 00:51:42,644 INFO L280 TraceCheckUtils]: 37: Hoare triple {1494#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:42,645 INFO L280 TraceCheckUtils]: 38: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:42,645 INFO L280 TraceCheckUtils]: 39: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 3); {1495#(<= id_~ret~0 3)} is VALID [2020-07-11 00:51:42,646 INFO L280 TraceCheckUtils]: 40: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:42,647 INFO L280 TraceCheckUtils]: 41: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-11 00:51:42,648 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-11 00:51:42,649 INFO L280 TraceCheckUtils]: 43: Hoare triple {1467#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-11 00:51:42,649 INFO L280 TraceCheckUtils]: 44: Hoare triple {1467#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-11 00:51:42,650 INFO L280 TraceCheckUtils]: 45: Hoare triple {1468#(<= main_~result~0 3)} havoc #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-11 00:51:42,651 INFO L280 TraceCheckUtils]: 46: Hoare triple {1468#(<= main_~result~0 3)} assume 5 == ~result~0; {1429#false} is VALID [2020-07-11 00:51:42,651 INFO L280 TraceCheckUtils]: 47: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2020-07-11 00:51:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-11 00:51:42,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [52234666] [2020-07-11 00:51:42,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:51:42,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-11 00:51:42,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637996949] [2020-07-11 00:51:42,655 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-11 00:51:42,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:51:42,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 00:51:42,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:42,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 00:51:42,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:51:42,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 00:51:42,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-11 00:51:42,704 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 14 states. [2020-07-11 00:51:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:43,107 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2020-07-11 00:51:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-11 00:51:43,107 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-11 00:51:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:51:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 00:51:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2020-07-11 00:51:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 00:51:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2020-07-11 00:51:43,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2020-07-11 00:51:43,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:43,194 INFO L225 Difference]: With dead ends: 62 [2020-07-11 00:51:43,194 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:51:43,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2020-07-11 00:51:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:51:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:51:43,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:51:43,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:43,196 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:43,196 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:43,197 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:51:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:43,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:43,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:43,197 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:43,197 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:51:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:51:43,198 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:51:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:43,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:43,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:51:43,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:51:43,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:51:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:51:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:51:43,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-11 00:51:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:51:43,199 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:51:43,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 00:51:43,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:51:43,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:51:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:51:43,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:51:43,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:51:43,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:51:43,472 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:51:43,472 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:51:43,472 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:51:43,473 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:51:43,473 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:51:43,473 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:51:43,473 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) the Hoare annotation is: false [2020-07-11 00:51:43,473 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-11 00:51:43,474 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-11 00:51:43,474 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-07-11 00:51:43,474 INFO L264 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (<= main_~result~0 3) [2020-07-11 00:51:43,474 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-11 00:51:43,474 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 00:51:43,474 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (<= |main_#t~ret2| 3) [2020-07-11 00:51:43,475 INFO L271 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: true [2020-07-11 00:51:43,475 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-11 00:51:43,475 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (<= |main_#t~ret2| 3) [2020-07-11 00:51:43,476 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret2| 3) (<= main_~result~0 3)) [2020-07-11 00:51:43,476 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 9) the Hoare annotation is: (<= |id_#res| 3) [2020-07-11 00:51:43,477 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 9) the Hoare annotation is: (<= |id_#res| 3) [2020-07-11 00:51:43,477 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-11 00:51:43,477 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (<= id_~ret~0 3) [2020-07-11 00:51:43,478 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-11 00:51:43,478 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-11 00:51:43,478 INFO L271 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: true [2020-07-11 00:51:43,478 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-11 00:51:43,478 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-11 00:51:43,478 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-11 00:51:43,479 INFO L271 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: true [2020-07-11 00:51:43,479 INFO L271 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: true [2020-07-11 00:51:43,489 INFO L163 areAnnotationChecker]: CFG has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:51:43,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:51:43 BoogieIcfgContainer [2020-07-11 00:51:43,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:51:43,507 INFO L168 Benchmark]: Toolchain (without parser) took 5812.85 ms. Allocated memory was 142.6 MB in the beginning and 289.9 MB in the end (delta: 147.3 MB). Free memory was 101.1 MB in the beginning and 108.2 MB in the end (delta: -7.2 MB). Peak memory consumption was 140.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:43,508 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 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:43,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.25 ms. Allocated memory is still 142.6 MB. Free memory was 100.8 MB in the beginning and 91.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:43,515 INFO L168 Benchmark]: Boogie Preprocessor took 31.62 ms. Allocated memory is still 142.6 MB. Free memory was 91.3 MB in the beginning and 90.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:43,516 INFO L168 Benchmark]: RCFGBuilder took 529.91 ms. Allocated memory was 142.6 MB in the beginning and 199.2 MB in the end (delta: 56.6 MB). Free memory was 89.8 MB in the beginning and 161.7 MB in the end (delta: -71.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:43,516 INFO L168 Benchmark]: TraceAbstraction took 4992.41 ms. Allocated memory was 199.2 MB in the beginning and 289.9 MB in the end (delta: 90.7 MB). Free memory was 161.0 MB in the beginning and 108.2 MB in the end (delta: 52.8 MB). Peak memory consumption was 143.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:51:43,525 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.22 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 251.25 ms. Allocated memory is still 142.6 MB. Free memory was 100.8 MB in the beginning and 91.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.62 ms. Allocated memory is still 142.6 MB. Free memory was 91.3 MB in the beginning and 90.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 529.91 ms. Allocated memory was 142.6 MB in the beginning and 199.2 MB in the end (delta: 56.6 MB). Free memory was 89.8 MB in the beginning and 161.7 MB in the end (delta: -71.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4992.41 ms. Allocated memory was 199.2 MB in the beginning and 289.9 MB in the end (delta: 90.7 MB). Free memory was 161.0 MB in the beginning and 108.2 MB in the end (delta: 52.8 MB). Peak memory consumption was 143.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: \result <= 3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 151 SDtfs, 35 SDslu, 612 SDs, 0 SdLazy, 204 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 42 PreInvPairs, 134 NumberOfFragments, 48 HoareAnnotationTreeSize, 42 FomulaSimplifications, 282 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 30 FomulaSimplificationsInter, 133 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 12386 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 45/85 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...