/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/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:59:56,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:59:56,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:59:56,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:59:56,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:59:56,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:59:56,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:59:56,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:59:56,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:59:56,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:59:56,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:59:56,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:59:56,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:59:56,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:59:56,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:59:56,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:59:56,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:59:56,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:59:56,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:59:56,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:59:56,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:59:56,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:59:56,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:59:56,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:59:56,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:59:56,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:59:56,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:59:56,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:59:56,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:59:56,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:59:56,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:59:56,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:59:56,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:59:56,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:59:56,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:59:56,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:59:56,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:59:56,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:59:56,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:59:56,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:59:56,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:59:56,983 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:59:56,993 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:59:56,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:59:56,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:59:56,995 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:59:56,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:59:56,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:59:56,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:59:56,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:59:56,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:59:56,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:59:56,996 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:59:56,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:59:56,997 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:59:56,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:59:56,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:59:56,997 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:59:56,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:59:56,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:59:56,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:59:56,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:59:56,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:59:56,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:59:56,999 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:59:57,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:59:57,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:59:57,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:59:57,327 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:59:57,328 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:59:57,329 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-07-11 00:59:57,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed3b064bb/929f1d5b2b0b47e086862d5cceabc4b4/FLAG09a89f9e4 [2020-07-11 00:59:57,906 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:59:57,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-07-11 00:59:57,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed3b064bb/929f1d5b2b0b47e086862d5cceabc4b4/FLAG09a89f9e4 [2020-07-11 00:59:58,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed3b064bb/929f1d5b2b0b47e086862d5cceabc4b4 [2020-07-11 00:59:58,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:59:58,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:59:58,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:59:58,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:59:58,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:59:58,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4536ee98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58, skipping insertion in model container [2020-07-11 00:59:58,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:59:58,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:59:58,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:59:58,526 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:59:58,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:59:58,563 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:59:58,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58 WrapperNode [2020-07-11 00:59:58,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:59:58,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:59:58,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:59:58,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:59:58,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (1/1) ... [2020-07-11 00:59:58,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:59:58,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:59:58,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:59:58,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:59:58,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (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:59:58,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:59:58,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:59:58,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:59:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:59:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:59:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:59:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:59:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:59:59,228 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:59:59,228 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 00:59:59,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:59:59 BoogieIcfgContainer [2020-07-11 00:59:59,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:59:59,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:59:59,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:59:59,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:59:59,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:59:58" (1/3) ... [2020-07-11 00:59:59,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a11312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:59:59, skipping insertion in model container [2020-07-11 00:59:59,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:59:58" (2/3) ... [2020-07-11 00:59:59,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a11312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:59:59, skipping insertion in model container [2020-07-11 00:59:59,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:59:59" (3/3) ... [2020-07-11 00:59:59,246 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-07-11 00:59:59,257 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:59:59,265 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:59:59,277 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:59:59,298 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:59:59,298 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:59:59,298 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:59:59,298 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:59:59,298 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:59:59,299 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:59:59,299 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:59:59,299 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:59:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-07-11 00:59:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 00:59:59,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:59:59,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:59,324 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:59:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:59:59,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1222569836, now seen corresponding path program 1 times [2020-07-11 00:59:59,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:59:59,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [210788399] [2020-07-11 00:59:59,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:59:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:59:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:59:59,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-11 00:59:59,562 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {71#true} {71#true} #151#return; {71#true} is VALID [2020-07-11 00:59:59,564 INFO L263 TraceCheckUtils]: 0: Hoare triple {71#true} call ULTIMATE.init(); {71#true} is VALID [2020-07-11 00:59:59,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-11 00:59:59,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {71#true} {71#true} #151#return; {71#true} is VALID [2020-07-11 00:59:59,565 INFO L263 TraceCheckUtils]: 3: Hoare triple {71#true} call #t~ret6 := main(); {71#true} is VALID [2020-07-11 00:59:59,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {71#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {71#true} is VALID [2020-07-11 00:59:59,567 INFO L280 TraceCheckUtils]: 5: Hoare triple {71#true} ~p1~0 := #t~nondet0; {71#true} is VALID [2020-07-11 00:59:59,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {71#true} havoc #t~nondet0; {71#true} is VALID [2020-07-11 00:59:59,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {71#true} havoc ~lk1~0; {71#true} is VALID [2020-07-11 00:59:59,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {71#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {71#true} is VALID [2020-07-11 00:59:59,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {71#true} ~p2~0 := #t~nondet1; {71#true} is VALID [2020-07-11 00:59:59,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {71#true} havoc #t~nondet1; {71#true} is VALID [2020-07-11 00:59:59,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {71#true} havoc ~lk2~0; {71#true} is VALID [2020-07-11 00:59:59,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {71#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {71#true} is VALID [2020-07-11 00:59:59,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {71#true} ~p3~0 := #t~nondet2; {71#true} is VALID [2020-07-11 00:59:59,570 INFO L280 TraceCheckUtils]: 14: Hoare triple {71#true} havoc #t~nondet2; {71#true} is VALID [2020-07-11 00:59:59,570 INFO L280 TraceCheckUtils]: 15: Hoare triple {71#true} havoc ~lk3~0; {71#true} is VALID [2020-07-11 00:59:59,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {71#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {71#true} is VALID [2020-07-11 00:59:59,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {71#true} ~p4~0 := #t~nondet3; {71#true} is VALID [2020-07-11 00:59:59,571 INFO L280 TraceCheckUtils]: 18: Hoare triple {71#true} havoc #t~nondet3; {71#true} is VALID [2020-07-11 00:59:59,571 INFO L280 TraceCheckUtils]: 19: Hoare triple {71#true} havoc ~lk4~0; {71#true} is VALID [2020-07-11 00:59:59,572 INFO L280 TraceCheckUtils]: 20: Hoare triple {71#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {71#true} is VALID [2020-07-11 00:59:59,572 INFO L280 TraceCheckUtils]: 21: Hoare triple {71#true} ~p5~0 := #t~nondet4; {71#true} is VALID [2020-07-11 00:59:59,572 INFO L280 TraceCheckUtils]: 22: Hoare triple {71#true} havoc #t~nondet4; {71#true} is VALID [2020-07-11 00:59:59,573 INFO L280 TraceCheckUtils]: 23: Hoare triple {71#true} havoc ~lk5~0; {71#true} is VALID [2020-07-11 00:59:59,573 INFO L280 TraceCheckUtils]: 24: Hoare triple {71#true} havoc ~cond~0; {71#true} is VALID [2020-07-11 00:59:59,574 INFO L280 TraceCheckUtils]: 25: Hoare triple {71#true} assume !false; {71#true} is VALID [2020-07-11 00:59:59,574 INFO L280 TraceCheckUtils]: 26: Hoare triple {71#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {71#true} is VALID [2020-07-11 00:59:59,574 INFO L280 TraceCheckUtils]: 27: Hoare triple {71#true} ~cond~0 := #t~nondet5; {71#true} is VALID [2020-07-11 00:59:59,575 INFO L280 TraceCheckUtils]: 28: Hoare triple {71#true} havoc #t~nondet5; {71#true} is VALID [2020-07-11 00:59:59,575 INFO L280 TraceCheckUtils]: 29: Hoare triple {71#true} assume !(0 == ~cond~0); {71#true} is VALID [2020-07-11 00:59:59,575 INFO L280 TraceCheckUtils]: 30: Hoare triple {71#true} ~lk1~0 := 0; {71#true} is VALID [2020-07-11 00:59:59,575 INFO L280 TraceCheckUtils]: 31: Hoare triple {71#true} ~lk2~0 := 0; {71#true} is VALID [2020-07-11 00:59:59,576 INFO L280 TraceCheckUtils]: 32: Hoare triple {71#true} ~lk3~0 := 0; {71#true} is VALID [2020-07-11 00:59:59,576 INFO L280 TraceCheckUtils]: 33: Hoare triple {71#true} ~lk4~0 := 0; {71#true} is VALID [2020-07-11 00:59:59,576 INFO L280 TraceCheckUtils]: 34: Hoare triple {71#true} ~lk5~0 := 0; {71#true} is VALID [2020-07-11 00:59:59,580 INFO L280 TraceCheckUtils]: 35: Hoare triple {71#true} assume !(0 != ~p1~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-11 00:59:59,581 INFO L280 TraceCheckUtils]: 36: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-11 00:59:59,583 INFO L280 TraceCheckUtils]: 37: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-11 00:59:59,585 INFO L280 TraceCheckUtils]: 38: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-11 00:59:59,587 INFO L280 TraceCheckUtils]: 39: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-11 00:59:59,588 INFO L280 TraceCheckUtils]: 40: Hoare triple {75#(= 0 main_~p1~0)} assume 0 != ~p1~0; {72#false} is VALID [2020-07-11 00:59:59,589 INFO L280 TraceCheckUtils]: 41: Hoare triple {72#false} assume 1 != ~lk1~0; {72#false} is VALID [2020-07-11 00:59:59,589 INFO L280 TraceCheckUtils]: 42: Hoare triple {72#false} assume !false; {72#false} is VALID [2020-07-11 00:59:59,596 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:59:59,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [210788399] [2020-07-11 00:59:59,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:59:59,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 00:59:59,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737116152] [2020-07-11 00:59:59,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-11 00:59:59,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:59:59,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 00:59:59,740 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:59:59,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 00:59:59,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:59:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 00:59:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 00:59:59,755 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-07-11 01:00:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:00,228 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2020-07-11 01:00:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:00,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-11 01:00:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-11 01:00:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-11 01:00:00,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2020-07-11 01:00:00,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:00,514 INFO L225 Difference]: With dead ends: 147 [2020-07-11 01:00:00,515 INFO L226 Difference]: Without dead ends: 96 [2020-07-11 01:00:00,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-11 01:00:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2020-07-11 01:00:00,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:00,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2020-07-11 01:00:00,688 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2020-07-11 01:00:00,688 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2020-07-11 01:00:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:00,698 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-07-11 01:00:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-11 01:00:00,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:00,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:00,701 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2020-07-11 01:00:00,701 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2020-07-11 01:00:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:00,710 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-07-11 01:00:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-11 01:00:00,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:00,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:00,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:00,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-11 01:00:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-07-11 01:00:00,720 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2020-07-11 01:00:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:00,721 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-07-11 01:00:00,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:00,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 120 transitions. [2020-07-11 01:00:00,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-07-11 01:00:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-11 01:00:00,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:00,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:00,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:00:00,866 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:00,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1252462105, now seen corresponding path program 1 times [2020-07-11 01:00:00,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:00,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545709013] [2020-07-11 01:00:00,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:00,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-11 01:00:00,947 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-11 01:00:00,948 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2020-07-11 01:00:00,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-11 01:00:00,949 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-11 01:00:00,950 INFO L263 TraceCheckUtils]: 3: Hoare triple {752#true} call #t~ret6 := main(); {752#true} is VALID [2020-07-11 01:00:00,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {752#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {752#true} is VALID [2020-07-11 01:00:00,954 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} ~p1~0 := #t~nondet0; {752#true} is VALID [2020-07-11 01:00:00,954 INFO L280 TraceCheckUtils]: 6: Hoare triple {752#true} havoc #t~nondet0; {752#true} is VALID [2020-07-11 01:00:00,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {752#true} havoc ~lk1~0; {752#true} is VALID [2020-07-11 01:00:00,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {752#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {752#true} is VALID [2020-07-11 01:00:00,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {752#true} ~p2~0 := #t~nondet1; {752#true} is VALID [2020-07-11 01:00:00,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {752#true} havoc #t~nondet1; {752#true} is VALID [2020-07-11 01:00:00,957 INFO L280 TraceCheckUtils]: 11: Hoare triple {752#true} havoc ~lk2~0; {752#true} is VALID [2020-07-11 01:00:00,958 INFO L280 TraceCheckUtils]: 12: Hoare triple {752#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {752#true} is VALID [2020-07-11 01:00:00,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {752#true} ~p3~0 := #t~nondet2; {752#true} is VALID [2020-07-11 01:00:00,959 INFO L280 TraceCheckUtils]: 14: Hoare triple {752#true} havoc #t~nondet2; {752#true} is VALID [2020-07-11 01:00:00,960 INFO L280 TraceCheckUtils]: 15: Hoare triple {752#true} havoc ~lk3~0; {752#true} is VALID [2020-07-11 01:00:00,960 INFO L280 TraceCheckUtils]: 16: Hoare triple {752#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {752#true} is VALID [2020-07-11 01:00:00,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {752#true} ~p4~0 := #t~nondet3; {752#true} is VALID [2020-07-11 01:00:00,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {752#true} havoc #t~nondet3; {752#true} is VALID [2020-07-11 01:00:00,964 INFO L280 TraceCheckUtils]: 19: Hoare triple {752#true} havoc ~lk4~0; {752#true} is VALID [2020-07-11 01:00:00,964 INFO L280 TraceCheckUtils]: 20: Hoare triple {752#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {752#true} is VALID [2020-07-11 01:00:00,965 INFO L280 TraceCheckUtils]: 21: Hoare triple {752#true} ~p5~0 := #t~nondet4; {752#true} is VALID [2020-07-11 01:00:00,965 INFO L280 TraceCheckUtils]: 22: Hoare triple {752#true} havoc #t~nondet4; {752#true} is VALID [2020-07-11 01:00:00,966 INFO L280 TraceCheckUtils]: 23: Hoare triple {752#true} havoc ~lk5~0; {752#true} is VALID [2020-07-11 01:00:00,966 INFO L280 TraceCheckUtils]: 24: Hoare triple {752#true} havoc ~cond~0; {752#true} is VALID [2020-07-11 01:00:00,966 INFO L280 TraceCheckUtils]: 25: Hoare triple {752#true} assume !false; {752#true} is VALID [2020-07-11 01:00:00,967 INFO L280 TraceCheckUtils]: 26: Hoare triple {752#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {752#true} is VALID [2020-07-11 01:00:00,968 INFO L280 TraceCheckUtils]: 27: Hoare triple {752#true} ~cond~0 := #t~nondet5; {752#true} is VALID [2020-07-11 01:00:00,968 INFO L280 TraceCheckUtils]: 28: Hoare triple {752#true} havoc #t~nondet5; {752#true} is VALID [2020-07-11 01:00:00,968 INFO L280 TraceCheckUtils]: 29: Hoare triple {752#true} assume !(0 == ~cond~0); {752#true} is VALID [2020-07-11 01:00:00,969 INFO L280 TraceCheckUtils]: 30: Hoare triple {752#true} ~lk1~0 := 0; {752#true} is VALID [2020-07-11 01:00:00,969 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#true} ~lk2~0 := 0; {752#true} is VALID [2020-07-11 01:00:00,969 INFO L280 TraceCheckUtils]: 32: Hoare triple {752#true} ~lk3~0 := 0; {752#true} is VALID [2020-07-11 01:00:00,970 INFO L280 TraceCheckUtils]: 33: Hoare triple {752#true} ~lk4~0 := 0; {752#true} is VALID [2020-07-11 01:00:00,970 INFO L280 TraceCheckUtils]: 34: Hoare triple {752#true} ~lk5~0 := 0; {752#true} is VALID [2020-07-11 01:00:00,970 INFO L280 TraceCheckUtils]: 35: Hoare triple {752#true} assume 0 != ~p1~0; {752#true} is VALID [2020-07-11 01:00:00,971 INFO L280 TraceCheckUtils]: 36: Hoare triple {752#true} ~lk1~0 := 1; {756#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:00,972 INFO L280 TraceCheckUtils]: 37: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:00,973 INFO L280 TraceCheckUtils]: 38: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:00,974 INFO L280 TraceCheckUtils]: 39: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:00,975 INFO L280 TraceCheckUtils]: 40: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:00,977 INFO L280 TraceCheckUtils]: 41: Hoare triple {756#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {756#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:00,977 INFO L280 TraceCheckUtils]: 42: Hoare triple {756#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {753#false} is VALID [2020-07-11 01:00:00,978 INFO L280 TraceCheckUtils]: 43: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-11 01:00:00,983 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 01:00:00,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545709013] [2020-07-11 01:00:00,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:00,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:00,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179956680] [2020-07-11 01:00:00,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-11 01:00:00,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:00,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:01,056 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 01:00:01,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:01,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:01,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:01,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:01,058 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 3 states. [2020-07-11 01:00:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:01,394 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2020-07-11 01:00:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:01,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-11 01:00:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-11 01:00:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-11 01:00:01,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2020-07-11 01:00:01,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:01,526 INFO L225 Difference]: With dead ends: 116 [2020-07-11 01:00:01,526 INFO L226 Difference]: Without dead ends: 114 [2020-07-11 01:00:01,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-11 01:00:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-07-11 01:00:01,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:01,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 94 states. [2020-07-11 01:00:01,612 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 94 states. [2020-07-11 01:00:01,613 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 94 states. [2020-07-11 01:00:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:01,619 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2020-07-11 01:00:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2020-07-11 01:00:01,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:01,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:01,621 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 114 states. [2020-07-11 01:00:01,621 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 114 states. [2020-07-11 01:00:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:01,627 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2020-07-11 01:00:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2020-07-11 01:00:01,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:01,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:01,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:01,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-11 01:00:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-07-11 01:00:01,634 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 44 [2020-07-11 01:00:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:01,635 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-07-11 01:00:01,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:01,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 119 transitions. [2020-07-11 01:00:01,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-07-11 01:00:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-11 01:00:01,768 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:01,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:01,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:00:01,768 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:01,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash 755286414, now seen corresponding path program 1 times [2020-07-11 01:00:01,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:01,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [54302430] [2020-07-11 01:00:01,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:01,853 INFO L280 TraceCheckUtils]: 0: Hoare triple {1407#true} assume true; {1407#true} is VALID [2020-07-11 01:00:01,853 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1407#true} {1407#true} #151#return; {1407#true} is VALID [2020-07-11 01:00:01,854 INFO L263 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2020-07-11 01:00:01,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2020-07-11 01:00:01,854 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1407#true} #151#return; {1407#true} is VALID [2020-07-11 01:00:01,855 INFO L263 TraceCheckUtils]: 3: Hoare triple {1407#true} call #t~ret6 := main(); {1407#true} is VALID [2020-07-11 01:00:01,855 INFO L280 TraceCheckUtils]: 4: Hoare triple {1407#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1407#true} is VALID [2020-07-11 01:00:01,855 INFO L280 TraceCheckUtils]: 5: Hoare triple {1407#true} ~p1~0 := #t~nondet0; {1407#true} is VALID [2020-07-11 01:00:01,856 INFO L280 TraceCheckUtils]: 6: Hoare triple {1407#true} havoc #t~nondet0; {1407#true} is VALID [2020-07-11 01:00:01,856 INFO L280 TraceCheckUtils]: 7: Hoare triple {1407#true} havoc ~lk1~0; {1407#true} is VALID [2020-07-11 01:00:01,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {1407#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1407#true} is VALID [2020-07-11 01:00:01,862 INFO L280 TraceCheckUtils]: 9: Hoare triple {1407#true} ~p2~0 := #t~nondet1; {1407#true} is VALID [2020-07-11 01:00:01,863 INFO L280 TraceCheckUtils]: 10: Hoare triple {1407#true} havoc #t~nondet1; {1407#true} is VALID [2020-07-11 01:00:01,863 INFO L280 TraceCheckUtils]: 11: Hoare triple {1407#true} havoc ~lk2~0; {1407#true} is VALID [2020-07-11 01:00:01,863 INFO L280 TraceCheckUtils]: 12: Hoare triple {1407#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1407#true} is VALID [2020-07-11 01:00:01,864 INFO L280 TraceCheckUtils]: 13: Hoare triple {1407#true} ~p3~0 := #t~nondet2; {1407#true} is VALID [2020-07-11 01:00:01,864 INFO L280 TraceCheckUtils]: 14: Hoare triple {1407#true} havoc #t~nondet2; {1407#true} is VALID [2020-07-11 01:00:01,864 INFO L280 TraceCheckUtils]: 15: Hoare triple {1407#true} havoc ~lk3~0; {1407#true} is VALID [2020-07-11 01:00:01,865 INFO L280 TraceCheckUtils]: 16: Hoare triple {1407#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1407#true} is VALID [2020-07-11 01:00:01,865 INFO L280 TraceCheckUtils]: 17: Hoare triple {1407#true} ~p4~0 := #t~nondet3; {1407#true} is VALID [2020-07-11 01:00:01,865 INFO L280 TraceCheckUtils]: 18: Hoare triple {1407#true} havoc #t~nondet3; {1407#true} is VALID [2020-07-11 01:00:01,865 INFO L280 TraceCheckUtils]: 19: Hoare triple {1407#true} havoc ~lk4~0; {1407#true} is VALID [2020-07-11 01:00:01,866 INFO L280 TraceCheckUtils]: 20: Hoare triple {1407#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1407#true} is VALID [2020-07-11 01:00:01,866 INFO L280 TraceCheckUtils]: 21: Hoare triple {1407#true} ~p5~0 := #t~nondet4; {1407#true} is VALID [2020-07-11 01:00:01,866 INFO L280 TraceCheckUtils]: 22: Hoare triple {1407#true} havoc #t~nondet4; {1407#true} is VALID [2020-07-11 01:00:01,866 INFO L280 TraceCheckUtils]: 23: Hoare triple {1407#true} havoc ~lk5~0; {1407#true} is VALID [2020-07-11 01:00:01,867 INFO L280 TraceCheckUtils]: 24: Hoare triple {1407#true} havoc ~cond~0; {1407#true} is VALID [2020-07-11 01:00:01,867 INFO L280 TraceCheckUtils]: 25: Hoare triple {1407#true} assume !false; {1407#true} is VALID [2020-07-11 01:00:01,867 INFO L280 TraceCheckUtils]: 26: Hoare triple {1407#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1407#true} is VALID [2020-07-11 01:00:01,868 INFO L280 TraceCheckUtils]: 27: Hoare triple {1407#true} ~cond~0 := #t~nondet5; {1407#true} is VALID [2020-07-11 01:00:01,868 INFO L280 TraceCheckUtils]: 28: Hoare triple {1407#true} havoc #t~nondet5; {1407#true} is VALID [2020-07-11 01:00:01,868 INFO L280 TraceCheckUtils]: 29: Hoare triple {1407#true} assume !(0 == ~cond~0); {1407#true} is VALID [2020-07-11 01:00:01,868 INFO L280 TraceCheckUtils]: 30: Hoare triple {1407#true} ~lk1~0 := 0; {1407#true} is VALID [2020-07-11 01:00:01,869 INFO L280 TraceCheckUtils]: 31: Hoare triple {1407#true} ~lk2~0 := 0; {1407#true} is VALID [2020-07-11 01:00:01,869 INFO L280 TraceCheckUtils]: 32: Hoare triple {1407#true} ~lk3~0 := 0; {1407#true} is VALID [2020-07-11 01:00:01,869 INFO L280 TraceCheckUtils]: 33: Hoare triple {1407#true} ~lk4~0 := 0; {1407#true} is VALID [2020-07-11 01:00:01,869 INFO L280 TraceCheckUtils]: 34: Hoare triple {1407#true} ~lk5~0 := 0; {1407#true} is VALID [2020-07-11 01:00:01,870 INFO L280 TraceCheckUtils]: 35: Hoare triple {1407#true} assume !(0 != ~p1~0); {1407#true} is VALID [2020-07-11 01:00:01,871 INFO L280 TraceCheckUtils]: 36: Hoare triple {1407#true} assume !(0 != ~p2~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:01,871 INFO L280 TraceCheckUtils]: 37: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:01,872 INFO L280 TraceCheckUtils]: 38: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:01,873 INFO L280 TraceCheckUtils]: 39: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:01,873 INFO L280 TraceCheckUtils]: 40: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:01,874 INFO L280 TraceCheckUtils]: 41: Hoare triple {1411#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1408#false} is VALID [2020-07-11 01:00:01,874 INFO L280 TraceCheckUtils]: 42: Hoare triple {1408#false} assume 1 != ~lk2~0; {1408#false} is VALID [2020-07-11 01:00:01,875 INFO L280 TraceCheckUtils]: 43: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2020-07-11 01:00:01,877 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 01:00:01,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [54302430] [2020-07-11 01:00:01,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:01,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:01,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656061284] [2020-07-11 01:00:01,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-11 01:00:01,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:01,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:01,921 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 01:00:01,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:01,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:01,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:01,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:01,922 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 3 states. [2020-07-11 01:00:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:02,245 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2020-07-11 01:00:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:02,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-11 01:00:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-11 01:00:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-11 01:00:02,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-11 01:00:02,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:02,446 INFO L225 Difference]: With dead ends: 226 [2020-07-11 01:00:02,447 INFO L226 Difference]: Without dead ends: 157 [2020-07-11 01:00:02,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-07-11 01:00:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2020-07-11 01:00:02,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:02,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 155 states. [2020-07-11 01:00:02,641 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 155 states. [2020-07-11 01:00:02,641 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 155 states. [2020-07-11 01:00:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:02,649 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2020-07-11 01:00:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2020-07-11 01:00:02,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:02,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:02,650 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 157 states. [2020-07-11 01:00:02,650 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 157 states. [2020-07-11 01:00:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:02,658 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2020-07-11 01:00:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2020-07-11 01:00:02,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:02,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:02,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:02,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-11 01:00:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2020-07-11 01:00:02,666 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 44 [2020-07-11 01:00:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:02,667 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2020-07-11 01:00:02,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:02,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 200 transitions. [2020-07-11 01:00:02,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2020-07-11 01:00:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-11 01:00:02,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:02,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:02,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:00:02,895 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1863120818, now seen corresponding path program 1 times [2020-07-11 01:00:02,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:02,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791245840] [2020-07-11 01:00:02,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:02,962 INFO L280 TraceCheckUtils]: 0: Hoare triple {2490#true} assume true; {2490#true} is VALID [2020-07-11 01:00:02,963 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2490#true} {2490#true} #151#return; {2490#true} is VALID [2020-07-11 01:00:02,963 INFO L263 TraceCheckUtils]: 0: Hoare triple {2490#true} call ULTIMATE.init(); {2490#true} is VALID [2020-07-11 01:00:02,963 INFO L280 TraceCheckUtils]: 1: Hoare triple {2490#true} assume true; {2490#true} is VALID [2020-07-11 01:00:02,964 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2490#true} {2490#true} #151#return; {2490#true} is VALID [2020-07-11 01:00:02,964 INFO L263 TraceCheckUtils]: 3: Hoare triple {2490#true} call #t~ret6 := main(); {2490#true} is VALID [2020-07-11 01:00:02,964 INFO L280 TraceCheckUtils]: 4: Hoare triple {2490#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2490#true} is VALID [2020-07-11 01:00:02,964 INFO L280 TraceCheckUtils]: 5: Hoare triple {2490#true} ~p1~0 := #t~nondet0; {2490#true} is VALID [2020-07-11 01:00:02,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {2490#true} havoc #t~nondet0; {2490#true} is VALID [2020-07-11 01:00:02,965 INFO L280 TraceCheckUtils]: 7: Hoare triple {2490#true} havoc ~lk1~0; {2490#true} is VALID [2020-07-11 01:00:02,965 INFO L280 TraceCheckUtils]: 8: Hoare triple {2490#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2490#true} is VALID [2020-07-11 01:00:02,965 INFO L280 TraceCheckUtils]: 9: Hoare triple {2490#true} ~p2~0 := #t~nondet1; {2490#true} is VALID [2020-07-11 01:00:02,966 INFO L280 TraceCheckUtils]: 10: Hoare triple {2490#true} havoc #t~nondet1; {2490#true} is VALID [2020-07-11 01:00:02,966 INFO L280 TraceCheckUtils]: 11: Hoare triple {2490#true} havoc ~lk2~0; {2490#true} is VALID [2020-07-11 01:00:02,966 INFO L280 TraceCheckUtils]: 12: Hoare triple {2490#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2490#true} is VALID [2020-07-11 01:00:02,968 INFO L280 TraceCheckUtils]: 13: Hoare triple {2490#true} ~p3~0 := #t~nondet2; {2490#true} is VALID [2020-07-11 01:00:02,969 INFO L280 TraceCheckUtils]: 14: Hoare triple {2490#true} havoc #t~nondet2; {2490#true} is VALID [2020-07-11 01:00:02,969 INFO L280 TraceCheckUtils]: 15: Hoare triple {2490#true} havoc ~lk3~0; {2490#true} is VALID [2020-07-11 01:00:02,970 INFO L280 TraceCheckUtils]: 16: Hoare triple {2490#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2490#true} is VALID [2020-07-11 01:00:02,970 INFO L280 TraceCheckUtils]: 17: Hoare triple {2490#true} ~p4~0 := #t~nondet3; {2490#true} is VALID [2020-07-11 01:00:02,970 INFO L280 TraceCheckUtils]: 18: Hoare triple {2490#true} havoc #t~nondet3; {2490#true} is VALID [2020-07-11 01:00:02,970 INFO L280 TraceCheckUtils]: 19: Hoare triple {2490#true} havoc ~lk4~0; {2490#true} is VALID [2020-07-11 01:00:02,971 INFO L280 TraceCheckUtils]: 20: Hoare triple {2490#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2490#true} is VALID [2020-07-11 01:00:02,971 INFO L280 TraceCheckUtils]: 21: Hoare triple {2490#true} ~p5~0 := #t~nondet4; {2490#true} is VALID [2020-07-11 01:00:02,971 INFO L280 TraceCheckUtils]: 22: Hoare triple {2490#true} havoc #t~nondet4; {2490#true} is VALID [2020-07-11 01:00:02,971 INFO L280 TraceCheckUtils]: 23: Hoare triple {2490#true} havoc ~lk5~0; {2490#true} is VALID [2020-07-11 01:00:02,971 INFO L280 TraceCheckUtils]: 24: Hoare triple {2490#true} havoc ~cond~0; {2490#true} is VALID [2020-07-11 01:00:02,972 INFO L280 TraceCheckUtils]: 25: Hoare triple {2490#true} assume !false; {2490#true} is VALID [2020-07-11 01:00:02,972 INFO L280 TraceCheckUtils]: 26: Hoare triple {2490#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2490#true} is VALID [2020-07-11 01:00:02,972 INFO L280 TraceCheckUtils]: 27: Hoare triple {2490#true} ~cond~0 := #t~nondet5; {2490#true} is VALID [2020-07-11 01:00:02,973 INFO L280 TraceCheckUtils]: 28: Hoare triple {2490#true} havoc #t~nondet5; {2490#true} is VALID [2020-07-11 01:00:02,973 INFO L280 TraceCheckUtils]: 29: Hoare triple {2490#true} assume !(0 == ~cond~0); {2490#true} is VALID [2020-07-11 01:00:02,973 INFO L280 TraceCheckUtils]: 30: Hoare triple {2490#true} ~lk1~0 := 0; {2490#true} is VALID [2020-07-11 01:00:02,973 INFO L280 TraceCheckUtils]: 31: Hoare triple {2490#true} ~lk2~0 := 0; {2490#true} is VALID [2020-07-11 01:00:02,973 INFO L280 TraceCheckUtils]: 32: Hoare triple {2490#true} ~lk3~0 := 0; {2490#true} is VALID [2020-07-11 01:00:02,974 INFO L280 TraceCheckUtils]: 33: Hoare triple {2490#true} ~lk4~0 := 0; {2490#true} is VALID [2020-07-11 01:00:02,974 INFO L280 TraceCheckUtils]: 34: Hoare triple {2490#true} ~lk5~0 := 0; {2490#true} is VALID [2020-07-11 01:00:02,974 INFO L280 TraceCheckUtils]: 35: Hoare triple {2490#true} assume !(0 != ~p1~0); {2490#true} is VALID [2020-07-11 01:00:02,974 INFO L280 TraceCheckUtils]: 36: Hoare triple {2490#true} assume 0 != ~p2~0; {2490#true} is VALID [2020-07-11 01:00:02,975 INFO L280 TraceCheckUtils]: 37: Hoare triple {2490#true} ~lk2~0 := 1; {2494#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:02,975 INFO L280 TraceCheckUtils]: 38: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:02,976 INFO L280 TraceCheckUtils]: 39: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:02,976 INFO L280 TraceCheckUtils]: 40: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:02,977 INFO L280 TraceCheckUtils]: 41: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:02,977 INFO L280 TraceCheckUtils]: 42: Hoare triple {2494#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {2494#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:02,978 INFO L280 TraceCheckUtils]: 43: Hoare triple {2494#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {2491#false} is VALID [2020-07-11 01:00:02,978 INFO L280 TraceCheckUtils]: 44: Hoare triple {2491#false} assume !false; {2491#false} is VALID [2020-07-11 01:00:02,981 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 01:00:02,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791245840] [2020-07-11 01:00:02,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:02,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:02,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563975528] [2020-07-11 01:00:02,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-11 01:00:02,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:02,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:03,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:03,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:03,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:03,029 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand 3 states. [2020-07-11 01:00:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:03,404 INFO L93 Difference]: Finished difference Result 191 states and 246 transitions. [2020-07-11 01:00:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:03,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-11 01:00:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-11 01:00:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-11 01:00:03,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2020-07-11 01:00:03,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:03,520 INFO L225 Difference]: With dead ends: 191 [2020-07-11 01:00:03,521 INFO L226 Difference]: Without dead ends: 189 [2020-07-11 01:00:03,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-11 01:00:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2020-07-11 01:00:03,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:03,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 155 states. [2020-07-11 01:00:03,734 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 155 states. [2020-07-11 01:00:03,734 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 155 states. [2020-07-11 01:00:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:03,744 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2020-07-11 01:00:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2020-07-11 01:00:03,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:03,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:03,745 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 189 states. [2020-07-11 01:00:03,745 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 189 states. [2020-07-11 01:00:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:03,753 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2020-07-11 01:00:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2020-07-11 01:00:03,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:03,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:03,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:03,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-11 01:00:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2020-07-11 01:00:03,759 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 45 [2020-07-11 01:00:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:03,760 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2020-07-11 01:00:03,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:03,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 198 transitions. [2020-07-11 01:00:04,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2020-07-11 01:00:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-11 01:00:04,005 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:04,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:04,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:00:04,006 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:04,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1939288392, now seen corresponding path program 1 times [2020-07-11 01:00:04,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:04,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1696758791] [2020-07-11 01:00:04,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:04,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {3567#true} assume true; {3567#true} is VALID [2020-07-11 01:00:04,041 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3567#true} {3567#true} #151#return; {3567#true} is VALID [2020-07-11 01:00:04,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {3567#true} call ULTIMATE.init(); {3567#true} is VALID [2020-07-11 01:00:04,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {3567#true} assume true; {3567#true} is VALID [2020-07-11 01:00:04,042 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3567#true} {3567#true} #151#return; {3567#true} is VALID [2020-07-11 01:00:04,042 INFO L263 TraceCheckUtils]: 3: Hoare triple {3567#true} call #t~ret6 := main(); {3567#true} is VALID [2020-07-11 01:00:04,042 INFO L280 TraceCheckUtils]: 4: Hoare triple {3567#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3567#true} is VALID [2020-07-11 01:00:04,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {3567#true} ~p1~0 := #t~nondet0; {3567#true} is VALID [2020-07-11 01:00:04,043 INFO L280 TraceCheckUtils]: 6: Hoare triple {3567#true} havoc #t~nondet0; {3567#true} is VALID [2020-07-11 01:00:04,043 INFO L280 TraceCheckUtils]: 7: Hoare triple {3567#true} havoc ~lk1~0; {3567#true} is VALID [2020-07-11 01:00:04,043 INFO L280 TraceCheckUtils]: 8: Hoare triple {3567#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3567#true} is VALID [2020-07-11 01:00:04,044 INFO L280 TraceCheckUtils]: 9: Hoare triple {3567#true} ~p2~0 := #t~nondet1; {3567#true} is VALID [2020-07-11 01:00:04,044 INFO L280 TraceCheckUtils]: 10: Hoare triple {3567#true} havoc #t~nondet1; {3567#true} is VALID [2020-07-11 01:00:04,044 INFO L280 TraceCheckUtils]: 11: Hoare triple {3567#true} havoc ~lk2~0; {3567#true} is VALID [2020-07-11 01:00:04,044 INFO L280 TraceCheckUtils]: 12: Hoare triple {3567#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3567#true} is VALID [2020-07-11 01:00:04,045 INFO L280 TraceCheckUtils]: 13: Hoare triple {3567#true} ~p3~0 := #t~nondet2; {3567#true} is VALID [2020-07-11 01:00:04,045 INFO L280 TraceCheckUtils]: 14: Hoare triple {3567#true} havoc #t~nondet2; {3567#true} is VALID [2020-07-11 01:00:04,045 INFO L280 TraceCheckUtils]: 15: Hoare triple {3567#true} havoc ~lk3~0; {3567#true} is VALID [2020-07-11 01:00:04,045 INFO L280 TraceCheckUtils]: 16: Hoare triple {3567#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3567#true} is VALID [2020-07-11 01:00:04,045 INFO L280 TraceCheckUtils]: 17: Hoare triple {3567#true} ~p4~0 := #t~nondet3; {3567#true} is VALID [2020-07-11 01:00:04,046 INFO L280 TraceCheckUtils]: 18: Hoare triple {3567#true} havoc #t~nondet3; {3567#true} is VALID [2020-07-11 01:00:04,046 INFO L280 TraceCheckUtils]: 19: Hoare triple {3567#true} havoc ~lk4~0; {3567#true} is VALID [2020-07-11 01:00:04,046 INFO L280 TraceCheckUtils]: 20: Hoare triple {3567#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3567#true} is VALID [2020-07-11 01:00:04,046 INFO L280 TraceCheckUtils]: 21: Hoare triple {3567#true} ~p5~0 := #t~nondet4; {3567#true} is VALID [2020-07-11 01:00:04,047 INFO L280 TraceCheckUtils]: 22: Hoare triple {3567#true} havoc #t~nondet4; {3567#true} is VALID [2020-07-11 01:00:04,047 INFO L280 TraceCheckUtils]: 23: Hoare triple {3567#true} havoc ~lk5~0; {3567#true} is VALID [2020-07-11 01:00:04,047 INFO L280 TraceCheckUtils]: 24: Hoare triple {3567#true} havoc ~cond~0; {3567#true} is VALID [2020-07-11 01:00:04,047 INFO L280 TraceCheckUtils]: 25: Hoare triple {3567#true} assume !false; {3567#true} is VALID [2020-07-11 01:00:04,048 INFO L280 TraceCheckUtils]: 26: Hoare triple {3567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3567#true} is VALID [2020-07-11 01:00:04,048 INFO L280 TraceCheckUtils]: 27: Hoare triple {3567#true} ~cond~0 := #t~nondet5; {3567#true} is VALID [2020-07-11 01:00:04,048 INFO L280 TraceCheckUtils]: 28: Hoare triple {3567#true} havoc #t~nondet5; {3567#true} is VALID [2020-07-11 01:00:04,048 INFO L280 TraceCheckUtils]: 29: Hoare triple {3567#true} assume !(0 == ~cond~0); {3567#true} is VALID [2020-07-11 01:00:04,049 INFO L280 TraceCheckUtils]: 30: Hoare triple {3567#true} ~lk1~0 := 0; {3567#true} is VALID [2020-07-11 01:00:04,049 INFO L280 TraceCheckUtils]: 31: Hoare triple {3567#true} ~lk2~0 := 0; {3567#true} is VALID [2020-07-11 01:00:04,049 INFO L280 TraceCheckUtils]: 32: Hoare triple {3567#true} ~lk3~0 := 0; {3567#true} is VALID [2020-07-11 01:00:04,049 INFO L280 TraceCheckUtils]: 33: Hoare triple {3567#true} ~lk4~0 := 0; {3567#true} is VALID [2020-07-11 01:00:04,050 INFO L280 TraceCheckUtils]: 34: Hoare triple {3567#true} ~lk5~0 := 0; {3567#true} is VALID [2020-07-11 01:00:04,050 INFO L280 TraceCheckUtils]: 35: Hoare triple {3567#true} assume !(0 != ~p1~0); {3567#true} is VALID [2020-07-11 01:00:04,050 INFO L280 TraceCheckUtils]: 36: Hoare triple {3567#true} assume !(0 != ~p2~0); {3567#true} is VALID [2020-07-11 01:00:04,051 INFO L280 TraceCheckUtils]: 37: Hoare triple {3567#true} assume !(0 != ~p3~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:04,051 INFO L280 TraceCheckUtils]: 38: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:04,052 INFO L280 TraceCheckUtils]: 39: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:04,053 INFO L280 TraceCheckUtils]: 40: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:04,053 INFO L280 TraceCheckUtils]: 41: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:04,054 INFO L280 TraceCheckUtils]: 42: Hoare triple {3571#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3568#false} is VALID [2020-07-11 01:00:04,054 INFO L280 TraceCheckUtils]: 43: Hoare triple {3568#false} assume 1 != ~lk3~0; {3568#false} is VALID [2020-07-11 01:00:04,054 INFO L280 TraceCheckUtils]: 44: Hoare triple {3568#false} assume !false; {3568#false} is VALID [2020-07-11 01:00:04,056 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 01:00:04,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1696758791] [2020-07-11 01:00:04,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:04,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:04,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691541015] [2020-07-11 01:00:04,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-11 01:00:04,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:04,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:04,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:04,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:04,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:04,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:04,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:04,118 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand 3 states. [2020-07-11 01:00:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:04,681 INFO L93 Difference]: Finished difference Result 403 states and 528 transitions. [2020-07-11 01:00:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:04,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-11 01:00:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-11 01:00:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-11 01:00:04,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-11 01:00:04,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:04,861 INFO L225 Difference]: With dead ends: 403 [2020-07-11 01:00:04,861 INFO L226 Difference]: Without dead ends: 273 [2020-07-11 01:00:04,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-07-11 01:00:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2020-07-11 01:00:05,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:05,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand 271 states. [2020-07-11 01:00:05,224 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 271 states. [2020-07-11 01:00:05,224 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 271 states. [2020-07-11 01:00:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:05,234 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2020-07-11 01:00:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2020-07-11 01:00:05,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:05,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:05,236 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 273 states. [2020-07-11 01:00:05,236 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 273 states. [2020-07-11 01:00:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:05,246 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2020-07-11 01:00:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2020-07-11 01:00:05,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:05,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:05,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:05,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-07-11 01:00:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2020-07-11 01:00:05,258 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 45 [2020-07-11 01:00:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:05,258 INFO L479 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2020-07-11 01:00:05,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:05,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 271 states and 346 transitions. [2020-07-11 01:00:05,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2020-07-11 01:00:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 01:00:05,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:05,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:05,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:00:05,683 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:05,684 INFO L82 PathProgramCache]: Analyzing trace with hash -11355582, now seen corresponding path program 1 times [2020-07-11 01:00:05,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:05,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1247747086] [2020-07-11 01:00:05,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:05,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {5468#true} assume true; {5468#true} is VALID [2020-07-11 01:00:05,726 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5468#true} {5468#true} #151#return; {5468#true} is VALID [2020-07-11 01:00:05,726 INFO L263 TraceCheckUtils]: 0: Hoare triple {5468#true} call ULTIMATE.init(); {5468#true} is VALID [2020-07-11 01:00:05,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {5468#true} assume true; {5468#true} is VALID [2020-07-11 01:00:05,727 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5468#true} {5468#true} #151#return; {5468#true} is VALID [2020-07-11 01:00:05,727 INFO L263 TraceCheckUtils]: 3: Hoare triple {5468#true} call #t~ret6 := main(); {5468#true} is VALID [2020-07-11 01:00:05,727 INFO L280 TraceCheckUtils]: 4: Hoare triple {5468#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5468#true} is VALID [2020-07-11 01:00:05,727 INFO L280 TraceCheckUtils]: 5: Hoare triple {5468#true} ~p1~0 := #t~nondet0; {5468#true} is VALID [2020-07-11 01:00:05,727 INFO L280 TraceCheckUtils]: 6: Hoare triple {5468#true} havoc #t~nondet0; {5468#true} is VALID [2020-07-11 01:00:05,728 INFO L280 TraceCheckUtils]: 7: Hoare triple {5468#true} havoc ~lk1~0; {5468#true} is VALID [2020-07-11 01:00:05,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {5468#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5468#true} is VALID [2020-07-11 01:00:05,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {5468#true} ~p2~0 := #t~nondet1; {5468#true} is VALID [2020-07-11 01:00:05,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {5468#true} havoc #t~nondet1; {5468#true} is VALID [2020-07-11 01:00:05,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {5468#true} havoc ~lk2~0; {5468#true} is VALID [2020-07-11 01:00:05,729 INFO L280 TraceCheckUtils]: 12: Hoare triple {5468#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5468#true} is VALID [2020-07-11 01:00:05,729 INFO L280 TraceCheckUtils]: 13: Hoare triple {5468#true} ~p3~0 := #t~nondet2; {5468#true} is VALID [2020-07-11 01:00:05,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {5468#true} havoc #t~nondet2; {5468#true} is VALID [2020-07-11 01:00:05,730 INFO L280 TraceCheckUtils]: 15: Hoare triple {5468#true} havoc ~lk3~0; {5468#true} is VALID [2020-07-11 01:00:05,730 INFO L280 TraceCheckUtils]: 16: Hoare triple {5468#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5468#true} is VALID [2020-07-11 01:00:05,730 INFO L280 TraceCheckUtils]: 17: Hoare triple {5468#true} ~p4~0 := #t~nondet3; {5468#true} is VALID [2020-07-11 01:00:05,730 INFO L280 TraceCheckUtils]: 18: Hoare triple {5468#true} havoc #t~nondet3; {5468#true} is VALID [2020-07-11 01:00:05,730 INFO L280 TraceCheckUtils]: 19: Hoare triple {5468#true} havoc ~lk4~0; {5468#true} is VALID [2020-07-11 01:00:05,731 INFO L280 TraceCheckUtils]: 20: Hoare triple {5468#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5468#true} is VALID [2020-07-11 01:00:05,731 INFO L280 TraceCheckUtils]: 21: Hoare triple {5468#true} ~p5~0 := #t~nondet4; {5468#true} is VALID [2020-07-11 01:00:05,731 INFO L280 TraceCheckUtils]: 22: Hoare triple {5468#true} havoc #t~nondet4; {5468#true} is VALID [2020-07-11 01:00:05,731 INFO L280 TraceCheckUtils]: 23: Hoare triple {5468#true} havoc ~lk5~0; {5468#true} is VALID [2020-07-11 01:00:05,732 INFO L280 TraceCheckUtils]: 24: Hoare triple {5468#true} havoc ~cond~0; {5468#true} is VALID [2020-07-11 01:00:05,732 INFO L280 TraceCheckUtils]: 25: Hoare triple {5468#true} assume !false; {5468#true} is VALID [2020-07-11 01:00:05,732 INFO L280 TraceCheckUtils]: 26: Hoare triple {5468#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5468#true} is VALID [2020-07-11 01:00:05,732 INFO L280 TraceCheckUtils]: 27: Hoare triple {5468#true} ~cond~0 := #t~nondet5; {5468#true} is VALID [2020-07-11 01:00:05,732 INFO L280 TraceCheckUtils]: 28: Hoare triple {5468#true} havoc #t~nondet5; {5468#true} is VALID [2020-07-11 01:00:05,733 INFO L280 TraceCheckUtils]: 29: Hoare triple {5468#true} assume !(0 == ~cond~0); {5468#true} is VALID [2020-07-11 01:00:05,733 INFO L280 TraceCheckUtils]: 30: Hoare triple {5468#true} ~lk1~0 := 0; {5468#true} is VALID [2020-07-11 01:00:05,733 INFO L280 TraceCheckUtils]: 31: Hoare triple {5468#true} ~lk2~0 := 0; {5468#true} is VALID [2020-07-11 01:00:05,733 INFO L280 TraceCheckUtils]: 32: Hoare triple {5468#true} ~lk3~0 := 0; {5468#true} is VALID [2020-07-11 01:00:05,734 INFO L280 TraceCheckUtils]: 33: Hoare triple {5468#true} ~lk4~0 := 0; {5468#true} is VALID [2020-07-11 01:00:05,734 INFO L280 TraceCheckUtils]: 34: Hoare triple {5468#true} ~lk5~0 := 0; {5468#true} is VALID [2020-07-11 01:00:05,734 INFO L280 TraceCheckUtils]: 35: Hoare triple {5468#true} assume !(0 != ~p1~0); {5468#true} is VALID [2020-07-11 01:00:05,734 INFO L280 TraceCheckUtils]: 36: Hoare triple {5468#true} assume !(0 != ~p2~0); {5468#true} is VALID [2020-07-11 01:00:05,735 INFO L280 TraceCheckUtils]: 37: Hoare triple {5468#true} assume !(0 != ~p3~0); {5468#true} is VALID [2020-07-11 01:00:05,735 INFO L280 TraceCheckUtils]: 38: Hoare triple {5468#true} assume !(0 != ~p4~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:05,736 INFO L280 TraceCheckUtils]: 39: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:05,737 INFO L280 TraceCheckUtils]: 40: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:05,738 INFO L280 TraceCheckUtils]: 41: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:05,738 INFO L280 TraceCheckUtils]: 42: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:05,739 INFO L280 TraceCheckUtils]: 43: Hoare triple {5472#(= 0 main_~p4~0)} assume 0 != ~p4~0; {5469#false} is VALID [2020-07-11 01:00:05,739 INFO L280 TraceCheckUtils]: 44: Hoare triple {5469#false} assume 1 != ~lk4~0; {5469#false} is VALID [2020-07-11 01:00:05,739 INFO L280 TraceCheckUtils]: 45: Hoare triple {5469#false} assume !false; {5469#false} is VALID [2020-07-11 01:00:05,741 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 01:00:05,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1247747086] [2020-07-11 01:00:05,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:05,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:05,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734184555] [2020-07-11 01:00:05,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-11 01:00:05,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:05,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:05,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:05,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:05,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:05,782 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 3 states. [2020-07-11 01:00:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:06,798 INFO L93 Difference]: Finished difference Result 739 states and 956 transitions. [2020-07-11 01:00:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:06,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-11 01:00:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-11 01:00:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-11 01:00:06,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-11 01:00:06,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:06,988 INFO L225 Difference]: With dead ends: 739 [2020-07-11 01:00:06,988 INFO L226 Difference]: Without dead ends: 493 [2020-07-11 01:00:06,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-07-11 01:00:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2020-07-11 01:00:07,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:07,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 493 states. Second operand 491 states. [2020-07-11 01:00:07,759 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand 491 states. [2020-07-11 01:00:07,759 INFO L87 Difference]: Start difference. First operand 493 states. Second operand 491 states. [2020-07-11 01:00:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:07,778 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2020-07-11 01:00:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2020-07-11 01:00:07,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:07,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:07,780 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 493 states. [2020-07-11 01:00:07,780 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 493 states. [2020-07-11 01:00:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:07,796 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2020-07-11 01:00:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2020-07-11 01:00:07,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:07,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:07,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:07,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-11 01:00:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 618 transitions. [2020-07-11 01:00:07,815 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 618 transitions. Word has length 46 [2020-07-11 01:00:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:07,815 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 618 transitions. [2020-07-11 01:00:07,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:07,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 618 transitions. [2020-07-11 01:00:08,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 618 transitions. [2020-07-11 01:00:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 01:00:08,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:08,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:08,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 01:00:08,485 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:08,485 INFO L82 PathProgramCache]: Analyzing trace with hash 338056749, now seen corresponding path program 1 times [2020-07-11 01:00:08,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:08,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [300522567] [2020-07-11 01:00:08,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:08,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {8921#true} assume true; {8921#true} is VALID [2020-07-11 01:00:08,522 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8921#true} {8921#true} #151#return; {8921#true} is VALID [2020-07-11 01:00:08,522 INFO L263 TraceCheckUtils]: 0: Hoare triple {8921#true} call ULTIMATE.init(); {8921#true} is VALID [2020-07-11 01:00:08,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {8921#true} assume true; {8921#true} is VALID [2020-07-11 01:00:08,522 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8921#true} {8921#true} #151#return; {8921#true} is VALID [2020-07-11 01:00:08,523 INFO L263 TraceCheckUtils]: 3: Hoare triple {8921#true} call #t~ret6 := main(); {8921#true} is VALID [2020-07-11 01:00:08,523 INFO L280 TraceCheckUtils]: 4: Hoare triple {8921#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8921#true} is VALID [2020-07-11 01:00:08,523 INFO L280 TraceCheckUtils]: 5: Hoare triple {8921#true} ~p1~0 := #t~nondet0; {8921#true} is VALID [2020-07-11 01:00:08,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {8921#true} havoc #t~nondet0; {8921#true} is VALID [2020-07-11 01:00:08,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {8921#true} havoc ~lk1~0; {8921#true} is VALID [2020-07-11 01:00:08,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {8921#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8921#true} is VALID [2020-07-11 01:00:08,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {8921#true} ~p2~0 := #t~nondet1; {8921#true} is VALID [2020-07-11 01:00:08,524 INFO L280 TraceCheckUtils]: 10: Hoare triple {8921#true} havoc #t~nondet1; {8921#true} is VALID [2020-07-11 01:00:08,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {8921#true} havoc ~lk2~0; {8921#true} is VALID [2020-07-11 01:00:08,524 INFO L280 TraceCheckUtils]: 12: Hoare triple {8921#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8921#true} is VALID [2020-07-11 01:00:08,525 INFO L280 TraceCheckUtils]: 13: Hoare triple {8921#true} ~p3~0 := #t~nondet2; {8921#true} is VALID [2020-07-11 01:00:08,525 INFO L280 TraceCheckUtils]: 14: Hoare triple {8921#true} havoc #t~nondet2; {8921#true} is VALID [2020-07-11 01:00:08,525 INFO L280 TraceCheckUtils]: 15: Hoare triple {8921#true} havoc ~lk3~0; {8921#true} is VALID [2020-07-11 01:00:08,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {8921#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8921#true} is VALID [2020-07-11 01:00:08,526 INFO L280 TraceCheckUtils]: 17: Hoare triple {8921#true} ~p4~0 := #t~nondet3; {8921#true} is VALID [2020-07-11 01:00:08,526 INFO L280 TraceCheckUtils]: 18: Hoare triple {8921#true} havoc #t~nondet3; {8921#true} is VALID [2020-07-11 01:00:08,526 INFO L280 TraceCheckUtils]: 19: Hoare triple {8921#true} havoc ~lk4~0; {8921#true} is VALID [2020-07-11 01:00:08,526 INFO L280 TraceCheckUtils]: 20: Hoare triple {8921#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {8921#true} is VALID [2020-07-11 01:00:08,527 INFO L280 TraceCheckUtils]: 21: Hoare triple {8921#true} ~p5~0 := #t~nondet4; {8921#true} is VALID [2020-07-11 01:00:08,527 INFO L280 TraceCheckUtils]: 22: Hoare triple {8921#true} havoc #t~nondet4; {8921#true} is VALID [2020-07-11 01:00:08,527 INFO L280 TraceCheckUtils]: 23: Hoare triple {8921#true} havoc ~lk5~0; {8921#true} is VALID [2020-07-11 01:00:08,527 INFO L280 TraceCheckUtils]: 24: Hoare triple {8921#true} havoc ~cond~0; {8921#true} is VALID [2020-07-11 01:00:08,527 INFO L280 TraceCheckUtils]: 25: Hoare triple {8921#true} assume !false; {8921#true} is VALID [2020-07-11 01:00:08,528 INFO L280 TraceCheckUtils]: 26: Hoare triple {8921#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8921#true} is VALID [2020-07-11 01:00:08,528 INFO L280 TraceCheckUtils]: 27: Hoare triple {8921#true} ~cond~0 := #t~nondet5; {8921#true} is VALID [2020-07-11 01:00:08,528 INFO L280 TraceCheckUtils]: 28: Hoare triple {8921#true} havoc #t~nondet5; {8921#true} is VALID [2020-07-11 01:00:08,528 INFO L280 TraceCheckUtils]: 29: Hoare triple {8921#true} assume !(0 == ~cond~0); {8921#true} is VALID [2020-07-11 01:00:08,529 INFO L280 TraceCheckUtils]: 30: Hoare triple {8921#true} ~lk1~0 := 0; {8921#true} is VALID [2020-07-11 01:00:08,529 INFO L280 TraceCheckUtils]: 31: Hoare triple {8921#true} ~lk2~0 := 0; {8921#true} is VALID [2020-07-11 01:00:08,529 INFO L280 TraceCheckUtils]: 32: Hoare triple {8921#true} ~lk3~0 := 0; {8921#true} is VALID [2020-07-11 01:00:08,529 INFO L280 TraceCheckUtils]: 33: Hoare triple {8921#true} ~lk4~0 := 0; {8921#true} is VALID [2020-07-11 01:00:08,530 INFO L280 TraceCheckUtils]: 34: Hoare triple {8921#true} ~lk5~0 := 0; {8921#true} is VALID [2020-07-11 01:00:08,530 INFO L280 TraceCheckUtils]: 35: Hoare triple {8921#true} assume !(0 != ~p1~0); {8921#true} is VALID [2020-07-11 01:00:08,530 INFO L280 TraceCheckUtils]: 36: Hoare triple {8921#true} assume !(0 != ~p2~0); {8921#true} is VALID [2020-07-11 01:00:08,530 INFO L280 TraceCheckUtils]: 37: Hoare triple {8921#true} assume 0 != ~p3~0; {8921#true} is VALID [2020-07-11 01:00:08,531 INFO L280 TraceCheckUtils]: 38: Hoare triple {8921#true} ~lk3~0 := 1; {8925#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:08,531 INFO L280 TraceCheckUtils]: 39: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:08,532 INFO L280 TraceCheckUtils]: 40: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:08,533 INFO L280 TraceCheckUtils]: 41: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:08,533 INFO L280 TraceCheckUtils]: 42: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:08,534 INFO L280 TraceCheckUtils]: 43: Hoare triple {8925#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {8925#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:08,534 INFO L280 TraceCheckUtils]: 44: Hoare triple {8925#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {8922#false} is VALID [2020-07-11 01:00:08,535 INFO L280 TraceCheckUtils]: 45: Hoare triple {8922#false} assume !false; {8922#false} is VALID [2020-07-11 01:00:08,536 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 01:00:08,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [300522567] [2020-07-11 01:00:08,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:08,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:08,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66031965] [2020-07-11 01:00:08,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-11 01:00:08,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:08,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:08,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:08,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:08,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:08,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:08,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:08,575 INFO L87 Difference]: Start difference. First operand 491 states and 618 transitions. Second operand 3 states. [2020-07-11 01:00:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:09,752 INFO L93 Difference]: Finished difference Result 599 states and 748 transitions. [2020-07-11 01:00:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:09,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-11 01:00:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2020-07-11 01:00:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2020-07-11 01:00:09,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2020-07-11 01:00:09,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:09,872 INFO L225 Difference]: With dead ends: 599 [2020-07-11 01:00:09,873 INFO L226 Difference]: Without dead ends: 597 [2020-07-11 01:00:09,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-07-11 01:00:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 491. [2020-07-11 01:00:10,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:10,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand 491 states. [2020-07-11 01:00:10,640 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand 491 states. [2020-07-11 01:00:10,640 INFO L87 Difference]: Start difference. First operand 597 states. Second operand 491 states. [2020-07-11 01:00:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:10,664 INFO L93 Difference]: Finished difference Result 597 states and 739 transitions. [2020-07-11 01:00:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 739 transitions. [2020-07-11 01:00:10,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:10,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:10,666 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 597 states. [2020-07-11 01:00:10,666 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 597 states. [2020-07-11 01:00:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:10,690 INFO L93 Difference]: Finished difference Result 597 states and 739 transitions. [2020-07-11 01:00:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 739 transitions. [2020-07-11 01:00:10,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:10,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:10,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:10,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-11 01:00:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2020-07-11 01:00:10,710 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 46 [2020-07-11 01:00:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:10,710 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2020-07-11 01:00:10,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:10,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 610 transitions. [2020-07-11 01:00:11,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2020-07-11 01:00:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-11 01:00:11,365 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:11,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:11,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 01:00:11,366 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:11,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:11,366 INFO L82 PathProgramCache]: Analyzing trace with hash -144915038, now seen corresponding path program 1 times [2020-07-11 01:00:11,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:11,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [389819571] [2020-07-11 01:00:11,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:11,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {12302#true} assume true; {12302#true} is VALID [2020-07-11 01:00:11,434 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12302#true} {12302#true} #151#return; {12302#true} is VALID [2020-07-11 01:00:11,434 INFO L263 TraceCheckUtils]: 0: Hoare triple {12302#true} call ULTIMATE.init(); {12302#true} is VALID [2020-07-11 01:00:11,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {12302#true} assume true; {12302#true} is VALID [2020-07-11 01:00:11,435 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12302#true} {12302#true} #151#return; {12302#true} is VALID [2020-07-11 01:00:11,435 INFO L263 TraceCheckUtils]: 3: Hoare triple {12302#true} call #t~ret6 := main(); {12302#true} is VALID [2020-07-11 01:00:11,435 INFO L280 TraceCheckUtils]: 4: Hoare triple {12302#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12302#true} is VALID [2020-07-11 01:00:11,435 INFO L280 TraceCheckUtils]: 5: Hoare triple {12302#true} ~p1~0 := #t~nondet0; {12302#true} is VALID [2020-07-11 01:00:11,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {12302#true} havoc #t~nondet0; {12302#true} is VALID [2020-07-11 01:00:11,436 INFO L280 TraceCheckUtils]: 7: Hoare triple {12302#true} havoc ~lk1~0; {12302#true} is VALID [2020-07-11 01:00:11,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {12302#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12302#true} is VALID [2020-07-11 01:00:11,436 INFO L280 TraceCheckUtils]: 9: Hoare triple {12302#true} ~p2~0 := #t~nondet1; {12302#true} is VALID [2020-07-11 01:00:11,437 INFO L280 TraceCheckUtils]: 10: Hoare triple {12302#true} havoc #t~nondet1; {12302#true} is VALID [2020-07-11 01:00:11,437 INFO L280 TraceCheckUtils]: 11: Hoare triple {12302#true} havoc ~lk2~0; {12302#true} is VALID [2020-07-11 01:00:11,437 INFO L280 TraceCheckUtils]: 12: Hoare triple {12302#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {12302#true} is VALID [2020-07-11 01:00:11,437 INFO L280 TraceCheckUtils]: 13: Hoare triple {12302#true} ~p3~0 := #t~nondet2; {12302#true} is VALID [2020-07-11 01:00:11,438 INFO L280 TraceCheckUtils]: 14: Hoare triple {12302#true} havoc #t~nondet2; {12302#true} is VALID [2020-07-11 01:00:11,438 INFO L280 TraceCheckUtils]: 15: Hoare triple {12302#true} havoc ~lk3~0; {12302#true} is VALID [2020-07-11 01:00:11,438 INFO L280 TraceCheckUtils]: 16: Hoare triple {12302#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {12302#true} is VALID [2020-07-11 01:00:11,438 INFO L280 TraceCheckUtils]: 17: Hoare triple {12302#true} ~p4~0 := #t~nondet3; {12302#true} is VALID [2020-07-11 01:00:11,439 INFO L280 TraceCheckUtils]: 18: Hoare triple {12302#true} havoc #t~nondet3; {12302#true} is VALID [2020-07-11 01:00:11,439 INFO L280 TraceCheckUtils]: 19: Hoare triple {12302#true} havoc ~lk4~0; {12302#true} is VALID [2020-07-11 01:00:11,439 INFO L280 TraceCheckUtils]: 20: Hoare triple {12302#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12302#true} is VALID [2020-07-11 01:00:11,439 INFO L280 TraceCheckUtils]: 21: Hoare triple {12302#true} ~p5~0 := #t~nondet4; {12302#true} is VALID [2020-07-11 01:00:11,440 INFO L280 TraceCheckUtils]: 22: Hoare triple {12302#true} havoc #t~nondet4; {12302#true} is VALID [2020-07-11 01:00:11,440 INFO L280 TraceCheckUtils]: 23: Hoare triple {12302#true} havoc ~lk5~0; {12302#true} is VALID [2020-07-11 01:00:11,441 INFO L280 TraceCheckUtils]: 24: Hoare triple {12302#true} havoc ~cond~0; {12302#true} is VALID [2020-07-11 01:00:11,441 INFO L280 TraceCheckUtils]: 25: Hoare triple {12302#true} assume !false; {12302#true} is VALID [2020-07-11 01:00:11,441 INFO L280 TraceCheckUtils]: 26: Hoare triple {12302#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12302#true} is VALID [2020-07-11 01:00:11,441 INFO L280 TraceCheckUtils]: 27: Hoare triple {12302#true} ~cond~0 := #t~nondet5; {12302#true} is VALID [2020-07-11 01:00:11,442 INFO L280 TraceCheckUtils]: 28: Hoare triple {12302#true} havoc #t~nondet5; {12302#true} is VALID [2020-07-11 01:00:11,442 INFO L280 TraceCheckUtils]: 29: Hoare triple {12302#true} assume !(0 == ~cond~0); {12302#true} is VALID [2020-07-11 01:00:11,443 INFO L280 TraceCheckUtils]: 30: Hoare triple {12302#true} ~lk1~0 := 0; {12302#true} is VALID [2020-07-11 01:00:11,443 INFO L280 TraceCheckUtils]: 31: Hoare triple {12302#true} ~lk2~0 := 0; {12302#true} is VALID [2020-07-11 01:00:11,443 INFO L280 TraceCheckUtils]: 32: Hoare triple {12302#true} ~lk3~0 := 0; {12302#true} is VALID [2020-07-11 01:00:11,443 INFO L280 TraceCheckUtils]: 33: Hoare triple {12302#true} ~lk4~0 := 0; {12302#true} is VALID [2020-07-11 01:00:11,444 INFO L280 TraceCheckUtils]: 34: Hoare triple {12302#true} ~lk5~0 := 0; {12302#true} is VALID [2020-07-11 01:00:11,444 INFO L280 TraceCheckUtils]: 35: Hoare triple {12302#true} assume !(0 != ~p1~0); {12302#true} is VALID [2020-07-11 01:00:11,444 INFO L280 TraceCheckUtils]: 36: Hoare triple {12302#true} assume !(0 != ~p2~0); {12302#true} is VALID [2020-07-11 01:00:11,444 INFO L280 TraceCheckUtils]: 37: Hoare triple {12302#true} assume !(0 != ~p3~0); {12302#true} is VALID [2020-07-11 01:00:11,444 INFO L280 TraceCheckUtils]: 38: Hoare triple {12302#true} assume 0 != ~p4~0; {12302#true} is VALID [2020-07-11 01:00:11,445 INFO L280 TraceCheckUtils]: 39: Hoare triple {12302#true} ~lk4~0 := 1; {12306#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:11,446 INFO L280 TraceCheckUtils]: 40: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:11,447 INFO L280 TraceCheckUtils]: 41: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:11,447 INFO L280 TraceCheckUtils]: 42: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:11,448 INFO L280 TraceCheckUtils]: 43: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:11,448 INFO L280 TraceCheckUtils]: 44: Hoare triple {12306#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {12306#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:11,449 INFO L280 TraceCheckUtils]: 45: Hoare triple {12306#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {12303#false} is VALID [2020-07-11 01:00:11,449 INFO L280 TraceCheckUtils]: 46: Hoare triple {12303#false} assume !false; {12303#false} is VALID [2020-07-11 01:00:11,451 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 01:00:11,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [389819571] [2020-07-11 01:00:11,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:11,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:11,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570160845] [2020-07-11 01:00:11,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-11 01:00:11,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:11,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:11,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:11,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:11,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:11,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:11,490 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 3 states. [2020-07-11 01:00:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:12,658 INFO L93 Difference]: Finished difference Result 591 states and 724 transitions. [2020-07-11 01:00:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:12,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-11 01:00:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-11 01:00:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-11 01:00:12,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-11 01:00:12,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:12,778 INFO L225 Difference]: With dead ends: 591 [2020-07-11 01:00:12,778 INFO L226 Difference]: Without dead ends: 589 [2020-07-11 01:00:12,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-07-11 01:00:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 491. [2020-07-11 01:00:13,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:13,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 589 states. Second operand 491 states. [2020-07-11 01:00:13,632 INFO L74 IsIncluded]: Start isIncluded. First operand 589 states. Second operand 491 states. [2020-07-11 01:00:13,633 INFO L87 Difference]: Start difference. First operand 589 states. Second operand 491 states. [2020-07-11 01:00:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:13,657 INFO L93 Difference]: Finished difference Result 589 states and 715 transitions. [2020-07-11 01:00:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 715 transitions. [2020-07-11 01:00:13,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:13,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:13,659 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 589 states. [2020-07-11 01:00:13,659 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 589 states. [2020-07-11 01:00:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:13,685 INFO L93 Difference]: Finished difference Result 589 states and 715 transitions. [2020-07-11 01:00:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 715 transitions. [2020-07-11 01:00:13,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:13,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:13,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:13,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-11 01:00:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 602 transitions. [2020-07-11 01:00:13,705 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 602 transitions. Word has length 47 [2020-07-11 01:00:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:13,706 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 602 transitions. [2020-07-11 01:00:13,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:13,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 602 transitions. [2020-07-11 01:00:14,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 602 transitions. [2020-07-11 01:00:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-11 01:00:14,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:14,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:14,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 01:00:14,403 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -351776260, now seen corresponding path program 1 times [2020-07-11 01:00:14,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:14,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919075176] [2020-07-11 01:00:14,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:14,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {15651#true} assume true; {15651#true} is VALID [2020-07-11 01:00:14,447 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15651#true} {15651#true} #151#return; {15651#true} is VALID [2020-07-11 01:00:14,447 INFO L263 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2020-07-11 01:00:14,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {15651#true} assume true; {15651#true} is VALID [2020-07-11 01:00:14,448 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15651#true} {15651#true} #151#return; {15651#true} is VALID [2020-07-11 01:00:14,448 INFO L263 TraceCheckUtils]: 3: Hoare triple {15651#true} call #t~ret6 := main(); {15651#true} is VALID [2020-07-11 01:00:14,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {15651#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {15651#true} is VALID [2020-07-11 01:00:14,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {15651#true} ~p1~0 := #t~nondet0; {15651#true} is VALID [2020-07-11 01:00:14,449 INFO L280 TraceCheckUtils]: 6: Hoare triple {15651#true} havoc #t~nondet0; {15651#true} is VALID [2020-07-11 01:00:14,449 INFO L280 TraceCheckUtils]: 7: Hoare triple {15651#true} havoc ~lk1~0; {15651#true} is VALID [2020-07-11 01:00:14,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {15651#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {15651#true} is VALID [2020-07-11 01:00:14,449 INFO L280 TraceCheckUtils]: 9: Hoare triple {15651#true} ~p2~0 := #t~nondet1; {15651#true} is VALID [2020-07-11 01:00:14,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {15651#true} havoc #t~nondet1; {15651#true} is VALID [2020-07-11 01:00:14,450 INFO L280 TraceCheckUtils]: 11: Hoare triple {15651#true} havoc ~lk2~0; {15651#true} is VALID [2020-07-11 01:00:14,450 INFO L280 TraceCheckUtils]: 12: Hoare triple {15651#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15651#true} is VALID [2020-07-11 01:00:14,450 INFO L280 TraceCheckUtils]: 13: Hoare triple {15651#true} ~p3~0 := #t~nondet2; {15651#true} is VALID [2020-07-11 01:00:14,450 INFO L280 TraceCheckUtils]: 14: Hoare triple {15651#true} havoc #t~nondet2; {15651#true} is VALID [2020-07-11 01:00:14,451 INFO L280 TraceCheckUtils]: 15: Hoare triple {15651#true} havoc ~lk3~0; {15651#true} is VALID [2020-07-11 01:00:14,451 INFO L280 TraceCheckUtils]: 16: Hoare triple {15651#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {15651#true} is VALID [2020-07-11 01:00:14,452 INFO L280 TraceCheckUtils]: 17: Hoare triple {15651#true} ~p4~0 := #t~nondet3; {15651#true} is VALID [2020-07-11 01:00:14,452 INFO L280 TraceCheckUtils]: 18: Hoare triple {15651#true} havoc #t~nondet3; {15651#true} is VALID [2020-07-11 01:00:14,453 INFO L280 TraceCheckUtils]: 19: Hoare triple {15651#true} havoc ~lk4~0; {15651#true} is VALID [2020-07-11 01:00:14,453 INFO L280 TraceCheckUtils]: 20: Hoare triple {15651#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {15651#true} is VALID [2020-07-11 01:00:14,453 INFO L280 TraceCheckUtils]: 21: Hoare triple {15651#true} ~p5~0 := #t~nondet4; {15651#true} is VALID [2020-07-11 01:00:14,457 INFO L280 TraceCheckUtils]: 22: Hoare triple {15651#true} havoc #t~nondet4; {15651#true} is VALID [2020-07-11 01:00:14,458 INFO L280 TraceCheckUtils]: 23: Hoare triple {15651#true} havoc ~lk5~0; {15651#true} is VALID [2020-07-11 01:00:14,458 INFO L280 TraceCheckUtils]: 24: Hoare triple {15651#true} havoc ~cond~0; {15651#true} is VALID [2020-07-11 01:00:14,458 INFO L280 TraceCheckUtils]: 25: Hoare triple {15651#true} assume !false; {15651#true} is VALID [2020-07-11 01:00:14,458 INFO L280 TraceCheckUtils]: 26: Hoare triple {15651#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15651#true} is VALID [2020-07-11 01:00:14,459 INFO L280 TraceCheckUtils]: 27: Hoare triple {15651#true} ~cond~0 := #t~nondet5; {15651#true} is VALID [2020-07-11 01:00:14,459 INFO L280 TraceCheckUtils]: 28: Hoare triple {15651#true} havoc #t~nondet5; {15651#true} is VALID [2020-07-11 01:00:14,459 INFO L280 TraceCheckUtils]: 29: Hoare triple {15651#true} assume !(0 == ~cond~0); {15651#true} is VALID [2020-07-11 01:00:14,459 INFO L280 TraceCheckUtils]: 30: Hoare triple {15651#true} ~lk1~0 := 0; {15651#true} is VALID [2020-07-11 01:00:14,460 INFO L280 TraceCheckUtils]: 31: Hoare triple {15651#true} ~lk2~0 := 0; {15651#true} is VALID [2020-07-11 01:00:14,460 INFO L280 TraceCheckUtils]: 32: Hoare triple {15651#true} ~lk3~0 := 0; {15651#true} is VALID [2020-07-11 01:00:14,460 INFO L280 TraceCheckUtils]: 33: Hoare triple {15651#true} ~lk4~0 := 0; {15651#true} is VALID [2020-07-11 01:00:14,460 INFO L280 TraceCheckUtils]: 34: Hoare triple {15651#true} ~lk5~0 := 0; {15651#true} is VALID [2020-07-11 01:00:14,460 INFO L280 TraceCheckUtils]: 35: Hoare triple {15651#true} assume !(0 != ~p1~0); {15651#true} is VALID [2020-07-11 01:00:14,461 INFO L280 TraceCheckUtils]: 36: Hoare triple {15651#true} assume !(0 != ~p2~0); {15651#true} is VALID [2020-07-11 01:00:14,461 INFO L280 TraceCheckUtils]: 37: Hoare triple {15651#true} assume !(0 != ~p3~0); {15651#true} is VALID [2020-07-11 01:00:14,461 INFO L280 TraceCheckUtils]: 38: Hoare triple {15651#true} assume !(0 != ~p4~0); {15651#true} is VALID [2020-07-11 01:00:14,477 INFO L280 TraceCheckUtils]: 39: Hoare triple {15651#true} assume !(0 != ~p5~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:14,478 INFO L280 TraceCheckUtils]: 40: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:14,479 INFO L280 TraceCheckUtils]: 41: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:14,483 INFO L280 TraceCheckUtils]: 42: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:14,486 INFO L280 TraceCheckUtils]: 43: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:14,489 INFO L280 TraceCheckUtils]: 44: Hoare triple {15655#(= 0 main_~p5~0)} assume 0 != ~p5~0; {15652#false} is VALID [2020-07-11 01:00:14,489 INFO L280 TraceCheckUtils]: 45: Hoare triple {15652#false} assume 1 != ~lk5~0; {15652#false} is VALID [2020-07-11 01:00:14,489 INFO L280 TraceCheckUtils]: 46: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2020-07-11 01:00:14,492 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 01:00:14,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1919075176] [2020-07-11 01:00:14,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:14,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:14,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558839321] [2020-07-11 01:00:14,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-11 01:00:14,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:14,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:14,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:14,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:14,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:14,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:14,546 INFO L87 Difference]: Start difference. First operand 491 states and 602 transitions. Second operand 3 states. [2020-07-11 01:00:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:16,646 INFO L93 Difference]: Finished difference Result 1373 states and 1691 transitions. [2020-07-11 01:00:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:16,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-11 01:00:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-11 01:00:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-11 01:00:16,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2020-07-11 01:00:16,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:16,839 INFO L225 Difference]: With dead ends: 1373 [2020-07-11 01:00:16,840 INFO L226 Difference]: Without dead ends: 491 [2020-07-11 01:00:16,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-07-11 01:00:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2020-07-11 01:00:17,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:17,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand 491 states. [2020-07-11 01:00:17,695 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 491 states. [2020-07-11 01:00:17,695 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 491 states. [2020-07-11 01:00:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:17,710 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-11 01:00:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-11 01:00:17,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:17,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:17,711 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 491 states. [2020-07-11 01:00:17,711 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 491 states. [2020-07-11 01:00:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:17,726 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-11 01:00:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-11 01:00:17,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:17,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:17,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:17,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-11 01:00:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 570 transitions. [2020-07-11 01:00:17,744 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 570 transitions. Word has length 47 [2020-07-11 01:00:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:17,744 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 570 transitions. [2020-07-11 01:00:17,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:17,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 570 transitions. [2020-07-11 01:00:18,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-11 01:00:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 01:00:18,434 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:18,435 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:18,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 01:00:18,435 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:18,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2062829121, now seen corresponding path program 1 times [2020-07-11 01:00:18,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:18,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206916992] [2020-07-11 01:00:18,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:18,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {20368#true} assume true; {20368#true} is VALID [2020-07-11 01:00:18,473 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20368#true} {20368#true} #151#return; {20368#true} is VALID [2020-07-11 01:00:18,473 INFO L263 TraceCheckUtils]: 0: Hoare triple {20368#true} call ULTIMATE.init(); {20368#true} is VALID [2020-07-11 01:00:18,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {20368#true} assume true; {20368#true} is VALID [2020-07-11 01:00:18,474 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20368#true} {20368#true} #151#return; {20368#true} is VALID [2020-07-11 01:00:18,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {20368#true} call #t~ret6 := main(); {20368#true} is VALID [2020-07-11 01:00:18,474 INFO L280 TraceCheckUtils]: 4: Hoare triple {20368#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {20368#true} is VALID [2020-07-11 01:00:18,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {20368#true} ~p1~0 := #t~nondet0; {20368#true} is VALID [2020-07-11 01:00:18,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {20368#true} havoc #t~nondet0; {20368#true} is VALID [2020-07-11 01:00:18,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {20368#true} havoc ~lk1~0; {20368#true} is VALID [2020-07-11 01:00:18,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {20368#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {20368#true} is VALID [2020-07-11 01:00:18,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {20368#true} ~p2~0 := #t~nondet1; {20368#true} is VALID [2020-07-11 01:00:18,476 INFO L280 TraceCheckUtils]: 10: Hoare triple {20368#true} havoc #t~nondet1; {20368#true} is VALID [2020-07-11 01:00:18,477 INFO L280 TraceCheckUtils]: 11: Hoare triple {20368#true} havoc ~lk2~0; {20368#true} is VALID [2020-07-11 01:00:18,477 INFO L280 TraceCheckUtils]: 12: Hoare triple {20368#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20368#true} is VALID [2020-07-11 01:00:18,477 INFO L280 TraceCheckUtils]: 13: Hoare triple {20368#true} ~p3~0 := #t~nondet2; {20368#true} is VALID [2020-07-11 01:00:18,477 INFO L280 TraceCheckUtils]: 14: Hoare triple {20368#true} havoc #t~nondet2; {20368#true} is VALID [2020-07-11 01:00:18,477 INFO L280 TraceCheckUtils]: 15: Hoare triple {20368#true} havoc ~lk3~0; {20368#true} is VALID [2020-07-11 01:00:18,478 INFO L280 TraceCheckUtils]: 16: Hoare triple {20368#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {20368#true} is VALID [2020-07-11 01:00:18,478 INFO L280 TraceCheckUtils]: 17: Hoare triple {20368#true} ~p4~0 := #t~nondet3; {20368#true} is VALID [2020-07-11 01:00:18,478 INFO L280 TraceCheckUtils]: 18: Hoare triple {20368#true} havoc #t~nondet3; {20368#true} is VALID [2020-07-11 01:00:18,478 INFO L280 TraceCheckUtils]: 19: Hoare triple {20368#true} havoc ~lk4~0; {20368#true} is VALID [2020-07-11 01:00:18,478 INFO L280 TraceCheckUtils]: 20: Hoare triple {20368#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {20368#true} is VALID [2020-07-11 01:00:18,479 INFO L280 TraceCheckUtils]: 21: Hoare triple {20368#true} ~p5~0 := #t~nondet4; {20368#true} is VALID [2020-07-11 01:00:18,479 INFO L280 TraceCheckUtils]: 22: Hoare triple {20368#true} havoc #t~nondet4; {20368#true} is VALID [2020-07-11 01:00:18,479 INFO L280 TraceCheckUtils]: 23: Hoare triple {20368#true} havoc ~lk5~0; {20368#true} is VALID [2020-07-11 01:00:18,479 INFO L280 TraceCheckUtils]: 24: Hoare triple {20368#true} havoc ~cond~0; {20368#true} is VALID [2020-07-11 01:00:18,479 INFO L280 TraceCheckUtils]: 25: Hoare triple {20368#true} assume !false; {20368#true} is VALID [2020-07-11 01:00:18,480 INFO L280 TraceCheckUtils]: 26: Hoare triple {20368#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20368#true} is VALID [2020-07-11 01:00:18,480 INFO L280 TraceCheckUtils]: 27: Hoare triple {20368#true} ~cond~0 := #t~nondet5; {20368#true} is VALID [2020-07-11 01:00:18,480 INFO L280 TraceCheckUtils]: 28: Hoare triple {20368#true} havoc #t~nondet5; {20368#true} is VALID [2020-07-11 01:00:18,480 INFO L280 TraceCheckUtils]: 29: Hoare triple {20368#true} assume !(0 == ~cond~0); {20368#true} is VALID [2020-07-11 01:00:18,480 INFO L280 TraceCheckUtils]: 30: Hoare triple {20368#true} ~lk1~0 := 0; {20368#true} is VALID [2020-07-11 01:00:18,481 INFO L280 TraceCheckUtils]: 31: Hoare triple {20368#true} ~lk2~0 := 0; {20368#true} is VALID [2020-07-11 01:00:18,481 INFO L280 TraceCheckUtils]: 32: Hoare triple {20368#true} ~lk3~0 := 0; {20368#true} is VALID [2020-07-11 01:00:18,481 INFO L280 TraceCheckUtils]: 33: Hoare triple {20368#true} ~lk4~0 := 0; {20368#true} is VALID [2020-07-11 01:00:18,481 INFO L280 TraceCheckUtils]: 34: Hoare triple {20368#true} ~lk5~0 := 0; {20368#true} is VALID [2020-07-11 01:00:18,481 INFO L280 TraceCheckUtils]: 35: Hoare triple {20368#true} assume !(0 != ~p1~0); {20368#true} is VALID [2020-07-11 01:00:18,482 INFO L280 TraceCheckUtils]: 36: Hoare triple {20368#true} assume !(0 != ~p2~0); {20368#true} is VALID [2020-07-11 01:00:18,482 INFO L280 TraceCheckUtils]: 37: Hoare triple {20368#true} assume !(0 != ~p3~0); {20368#true} is VALID [2020-07-11 01:00:18,482 INFO L280 TraceCheckUtils]: 38: Hoare triple {20368#true} assume !(0 != ~p4~0); {20368#true} is VALID [2020-07-11 01:00:18,482 INFO L280 TraceCheckUtils]: 39: Hoare triple {20368#true} assume 0 != ~p5~0; {20368#true} is VALID [2020-07-11 01:00:18,482 INFO L280 TraceCheckUtils]: 40: Hoare triple {20368#true} ~lk5~0 := 1; {20372#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:18,483 INFO L280 TraceCheckUtils]: 41: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:18,483 INFO L280 TraceCheckUtils]: 42: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:18,484 INFO L280 TraceCheckUtils]: 43: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:18,484 INFO L280 TraceCheckUtils]: 44: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:18,484 INFO L280 TraceCheckUtils]: 45: Hoare triple {20372#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {20372#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:18,485 INFO L280 TraceCheckUtils]: 46: Hoare triple {20372#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {20369#false} is VALID [2020-07-11 01:00:18,485 INFO L280 TraceCheckUtils]: 47: Hoare triple {20369#false} assume !false; {20369#false} is VALID [2020-07-11 01:00:18,486 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 01:00:18,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206916992] [2020-07-11 01:00:18,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:18,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:18,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093720018] [2020-07-11 01:00:18,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-11 01:00:18,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:18,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:18,529 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 01:00:18,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:18,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:18,530 INFO L87 Difference]: Start difference. First operand 491 states and 570 transitions. Second operand 3 states. [2020-07-11 01:00:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:19,471 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-11 01:00:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:19,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-11 01:00:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-11 01:00:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-11 01:00:19,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-11 01:00:19,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:19,544 INFO L225 Difference]: With dead ends: 491 [2020-07-11 01:00:19,544 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 01:00:19,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 01:00:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 01:00:19,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:19,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:19,547 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:19,547 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:19,548 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:00:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:00:19,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:19,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:19,549 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:19,549 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:00:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:19,549 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:00:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:00:19,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:19,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:19,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:19,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 01:00:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 01:00:19,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-11 01:00:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:19,550 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 01:00:19,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:19,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 01:00:19,551 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 01:00:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:00:19,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:19,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 01:00:19,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 01:00:20,203 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-11 01:00:20,339 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:00:20,667 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:00:20,925 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:00:21,084 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-11 01:00:21,447 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:00:21,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:00:21,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:00:21,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:00:21,564 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:00:21,564 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 01:00:21,564 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:00:21,564 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 93) the Hoare annotation is: true [2020-07-11 01:00:21,565 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (= 1 main_~lk5~0) [2020-07-11 01:00:21,565 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-11 01:00:21,565 INFO L264 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk4~0)) (.cse2 (= 0 main_~p5~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse0 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-11 01:00:21,566 INFO L264 CegarLoopResult]: At program point L53-1(lines 24 88) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-11 01:00:21,566 INFO L264 CegarLoopResult]: At program point L78-1(lines 24 88) the Hoare annotation is: (or (= 0 main_~p5~0) (= 1 main_~lk5~0)) [2020-07-11 01:00:21,566 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 01:00:21,566 INFO L264 CegarLoopResult]: At program point L45-1(lines 24 88) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-11 01:00:21,567 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-11 01:00:21,567 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-11 01:00:21,567 INFO L264 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk4~0)) (.cse2 (= 0 main_~p5~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse0 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-11 01:00:21,567 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-11 01:00:21,567 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-11 01:00:21,568 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-11 01:00:21,568 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk4~0))) (or (and (= 1 main_~lk5~0) .cse0) (and (= 0 main_~p5~0) .cse0))) [2020-07-11 01:00:21,568 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-11 01:00:21,568 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-11 01:00:21,568 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 93) the Hoare annotation is: true [2020-07-11 01:00:21,568 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) the Hoare annotation is: false [2020-07-11 01:00:21,569 INFO L264 CegarLoopResult]: At program point L63-1(lines 24 88) the Hoare annotation is: (let ((.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse6 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse4) (and .cse0 .cse6 .cse1 .cse5) (and .cse1 .cse2 .cse7 .cse3) (and .cse0 .cse6 .cse1 .cse3) (and .cse0 .cse6 .cse5 .cse4) (and .cse2 .cse7 .cse5 .cse4) (and .cse6 .cse7 .cse3 .cse4) (and .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse7 .cse5) (and .cse6 .cse7 .cse5 .cse4) (and .cse6 .cse1 .cse7 .cse3) (and .cse0 .cse6 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5) (and .cse6 .cse1 .cse7 .cse5))) [2020-07-11 01:00:21,569 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-07-11 01:00:21,569 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-11 01:00:21,569 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk4~0))) (or (and (= 1 main_~lk5~0) .cse0) (and (= 0 main_~p5~0) .cse0))) [2020-07-11 01:00:21,569 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-11 01:00:21,569 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-11 01:00:21,569 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk3~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse7 .cse4) (and .cse0 .cse2 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse2 .cse6 .cse7 .cse4 .cse8) (and .cse5 .cse1 .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse2 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8))) [2020-07-11 01:00:21,569 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-11 01:00:21,570 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-07-11 01:00:21,570 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 01:00:21,570 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-11 01:00:21,570 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-11 01:00:21,570 INFO L264 CegarLoopResult]: At program point L73-1(lines 24 88) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse3 .cse2))) [2020-07-11 01:00:21,570 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-11 01:00:21,570 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse7 .cse4) (and .cse0 .cse2 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse2 .cse6 .cse7 .cse4 .cse8) (and .cse5 .cse1 .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse4 .cse8) (and .cse2 .cse6 .cse3 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse4 .cse8))) [2020-07-11 01:00:21,571 INFO L264 CegarLoopResult]: At program point L57-1(lines 24 88) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-11 01:00:21,571 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 01:00:21,571 INFO L264 CegarLoopResult]: At program point L49-1(lines 24 88) the Hoare annotation is: (let ((.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p1~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse2) (and .cse3 .cse0 .cse5) (and .cse4 .cse1 .cse2))) [2020-07-11 01:00:21,571 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse1 .cse2 .cse4))) [2020-07-11 01:00:21,571 INFO L271 CegarLoopResult]: At program point L41(lines 41 43) the Hoare annotation is: true [2020-07-11 01:00:21,571 INFO L264 CegarLoopResult]: At program point L41-2(lines 24 88) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-11 01:00:21,571 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-11 01:00:21,571 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-11 01:00:21,572 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-11 01:00:21,572 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-11 01:00:21,572 INFO L271 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-07-11 01:00:21,572 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-11 01:00:21,572 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-07-11 01:00:21,572 INFO L264 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse1 .cse2 .cse4))) [2020-07-11 01:00:21,572 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-11 01:00:21,573 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-11 01:00:21,573 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-11 01:00:21,573 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-11 01:00:21,573 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: false [2020-07-11 01:00:21,573 INFO L271 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: true [2020-07-11 01:00:21,573 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (= 1 main_~lk5~0) [2020-07-11 01:00:21,573 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-07-11 01:00:21,573 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 01:00:21,573 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-11 01:00:21,574 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-11 01:00:21,574 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-11 01:00:21,574 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-11 01:00:21,574 INFO L264 CegarLoopResult]: At program point L68-1(lines 24 88) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse4 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse1 .cse4 .cse5) (and .cse3 .cse0 .cse2) (and .cse3 .cse0 .cse4) (and .cse0 .cse1 .cse4) (and .cse1 .cse2 .cse5) (and .cse3 .cse2 .cse5))) [2020-07-11 01:00:21,616 INFO L163 areAnnotationChecker]: CFG has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:00:21,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:00:21 BoogieIcfgContainer [2020-07-11 01:00:21,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:00:21,630 INFO L168 Benchmark]: Toolchain (without parser) took 23334.18 ms. Allocated memory was 140.0 MB in the beginning and 441.5 MB in the end (delta: 301.5 MB). Free memory was 104.8 MB in the beginning and 344.5 MB in the end (delta: -239.8 MB). Peak memory consumption was 61.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:21,630 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 140.0 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 01:00:21,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.47 ms. Allocated memory is still 140.0 MB. Free memory was 104.5 MB in the beginning and 94.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:21,635 INFO L168 Benchmark]: Boogie Preprocessor took 133.92 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 94.5 MB in the beginning and 181.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:21,636 INFO L168 Benchmark]: RCFGBuilder took 536.96 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 154.2 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:21,637 INFO L168 Benchmark]: TraceAbstraction took 22389.04 ms. Allocated memory was 202.9 MB in the beginning and 441.5 MB in the end (delta: 238.6 MB). Free memory was 154.2 MB in the beginning and 344.5 MB in the end (delta: -190.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2020-07-11 01:00:21,643 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.79 ms. Allocated memory is still 140.0 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.47 ms. Allocated memory is still 140.0 MB. Free memory was 104.5 MB in the beginning and 94.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.92 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 94.5 MB in the beginning and 181.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 536.96 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 154.2 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22389.04 ms. Allocated memory was 202.9 MB in the beginning and 441.5 MB in the end (delta: 238.6 MB). Free memory was 154.2 MB in the beginning and 344.5 MB in the end (delta: -190.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 20.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 956 SDtfs, 332 SDslu, 668 SDs, 0 SdLazy, 49 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 266 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 956 NumberOfFragments, 2378 HoareAnnotationTreeSize, 68 FomulaSimplifications, 9164 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 68 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 24725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...