/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:03:39,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:03:39,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:03:39,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:03:39,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:03:39,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:03:39,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:03:39,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:03:39,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:03:39,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:03:39,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:03:39,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:03:39,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:03:39,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:03:39,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:03:39,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:03:39,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:03:39,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:03:39,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:03:39,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:03:39,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:03:39,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:03:39,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:03:39,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:03:39,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:03:39,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:03:39,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:03:39,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:03:39,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:03:39,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:03:39,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:03:39,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:03:39,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:03:39,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:03:39,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:03:39,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:03:39,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:03:39,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:03:39,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:03:39,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:03:39,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:03:39,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:03:39,277 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:03:39,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:03:39,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:03:39,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:03:39,279 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:03:39,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:03:39,280 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:03:39,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:03:39,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:03:39,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:03:39,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:03:39,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:03:39,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:03:39,281 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:03:39,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:03:39,281 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:03:39,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:03:39,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:03:39,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:03:39,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:03:39,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:03:39,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:39,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:03:39,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:03:39,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:03:39,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:03:39,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:03:39,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:03:39,284 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:03:39,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:03:39,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:03:39,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:03:39,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:03:39,573 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:03:39,574 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:03:39,574 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-1.c [2020-07-10 15:03:39,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83304ae3/0fb8efb3afa14580875e42d45f0677eb/FLAG36cb91338 [2020-07-10 15:03:40,095 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:03:40,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-1.c [2020-07-10 15:03:40,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83304ae3/0fb8efb3afa14580875e42d45f0677eb/FLAG36cb91338 [2020-07-10 15:03:40,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83304ae3/0fb8efb3afa14580875e42d45f0677eb [2020-07-10 15:03:40,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:03:40,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:03:40,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:40,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:03:40,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:03:40,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485a0299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40, skipping insertion in model container [2020-07-10 15:03:40,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:03:40,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:03:40,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:40,795 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:03:40,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:40,846 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:03:40,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40 WrapperNode [2020-07-10 15:03:40,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:40,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:03:40,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:03:40,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:03:40,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (1/1) ... [2020-07-10 15:03:40,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:03:40,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:03:40,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:03:40,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:03:40,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:41,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:03:41,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:03:41,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:03:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:03:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:03:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:03:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:03:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:03:41,677 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:03:41,677 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:03:41,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:41 BoogieIcfgContainer [2020-07-10 15:03:41,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:03:41,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:03:41,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:03:41,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:03:41,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:03:40" (1/3) ... [2020-07-10 15:03:41,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d30971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:41, skipping insertion in model container [2020-07-10 15:03:41,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:40" (2/3) ... [2020-07-10 15:03:41,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d30971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:41, skipping insertion in model container [2020-07-10 15:03:41,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:41" (3/3) ... [2020-07-10 15:03:41,692 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2020-07-10 15:03:41,704 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:03:41,713 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:03:41,729 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:03:41,756 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:03:41,756 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:03:41,756 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:03:41,757 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:03:41,757 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:03:41,757 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:03:41,757 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:03:41,758 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:03:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-10 15:03:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:41,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:41,787 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] [2020-07-10 15:03:41,787 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash -563352914, now seen corresponding path program 1 times [2020-07-10 15:03:41,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:41,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830702473] [2020-07-10 15:03:41,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:42,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 15:03:42,077 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {62#true} {62#true} #282#return; {62#true} is VALID [2020-07-10 15:03:42,079 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {62#true} is VALID [2020-07-10 15:03:42,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-10 15:03:42,082 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {62#true} {62#true} #282#return; {62#true} is VALID [2020-07-10 15:03:42,082 INFO L263 TraceCheckUtils]: 3: Hoare triple {62#true} call #t~ret16 := main(); {62#true} is VALID [2020-07-10 15:03:42,083 INFO L280 TraceCheckUtils]: 4: Hoare triple {62#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {62#true} is VALID [2020-07-10 15:03:42,083 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {62#true} is VALID [2020-07-10 15:03:42,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {62#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {62#true} is VALID [2020-07-10 15:03:42,088 INFO L280 TraceCheckUtils]: 7: Hoare triple {62#true} assume 0 != ~p1~0;~lk1~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,090 INFO L280 TraceCheckUtils]: 9: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,091 INFO L280 TraceCheckUtils]: 10: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,093 INFO L280 TraceCheckUtils]: 11: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,094 INFO L280 TraceCheckUtils]: 12: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,095 INFO L280 TraceCheckUtils]: 13: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,096 INFO L280 TraceCheckUtils]: 14: Hoare triple {66#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,100 INFO L280 TraceCheckUtils]: 15: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,102 INFO L280 TraceCheckUtils]: 16: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p10~0;~lk10~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,103 INFO L280 TraceCheckUtils]: 17: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p11~0;~lk11~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,104 INFO L280 TraceCheckUtils]: 18: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p12~0;~lk12~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,105 INFO L280 TraceCheckUtils]: 19: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p13~0;~lk13~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,106 INFO L280 TraceCheckUtils]: 20: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p14~0;~lk14~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,109 INFO L280 TraceCheckUtils]: 21: Hoare triple {66#(not (= 0 main_~p1~0))} assume 0 != ~p15~0;~lk15~0 := 1; {66#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:42,110 INFO L280 TraceCheckUtils]: 22: Hoare triple {66#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {63#false} is VALID [2020-07-10 15:03:42,110 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} assume !(0 != ~p2~0); {63#false} is VALID [2020-07-10 15:03:42,111 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-10 15:03:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:42,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830702473] [2020-07-10 15:03:42,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:42,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:42,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714686811] [2020-07-10 15:03:42,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:42,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:42,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:42,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:42,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:42,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:42,228 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-10 15:03:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:42,612 INFO L93 Difference]: Finished difference Result 164 states and 305 transitions. [2020-07-10 15:03:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:42,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2020-07-10 15:03:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2020-07-10 15:03:42,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 305 transitions. [2020-07-10 15:03:42,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:43,003 INFO L225 Difference]: With dead ends: 164 [2020-07-10 15:03:43,004 INFO L226 Difference]: Without dead ends: 102 [2020-07-10 15:03:43,008 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-10 15:03:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-10 15:03:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2020-07-10 15:03:43,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:43,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2020-07-10 15:03:43,065 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2020-07-10 15:03:43,065 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2020-07-10 15:03:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,077 INFO L93 Difference]: Finished difference Result 102 states and 187 transitions. [2020-07-10 15:03:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 187 transitions. [2020-07-10 15:03:43,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:43,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:43,080 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2020-07-10 15:03:43,080 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2020-07-10 15:03:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,089 INFO L93 Difference]: Finished difference Result 102 states and 187 transitions. [2020-07-10 15:03:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 187 transitions. [2020-07-10 15:03:43,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:43,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:43,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:43,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-10 15:03:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 186 transitions. [2020-07-10 15:03:43,100 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 186 transitions. Word has length 25 [2020-07-10 15:03:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:43,101 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 186 transitions. [2020-07-10 15:03:43,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 186 transitions. [2020-07-10 15:03:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:43,102 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:43,103 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] [2020-07-10 15:03:43,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:03:43,103 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2020-07-10 15:03:43,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:43,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735115859] [2020-07-10 15:03:43,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:43,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-10 15:03:43,182 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {557#true} {557#true} #282#return; {557#true} is VALID [2020-07-10 15:03:43,182 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {557#true} is VALID [2020-07-10 15:03:43,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-10 15:03:43,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #282#return; {557#true} is VALID [2020-07-10 15:03:43,183 INFO L263 TraceCheckUtils]: 3: Hoare triple {557#true} call #t~ret16 := main(); {557#true} is VALID [2020-07-10 15:03:43,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {557#true} is VALID [2020-07-10 15:03:43,184 INFO L280 TraceCheckUtils]: 5: Hoare triple {557#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {557#true} is VALID [2020-07-10 15:03:43,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {557#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {557#true} is VALID [2020-07-10 15:03:43,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {557#true} assume 0 != ~p1~0;~lk1~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,187 INFO L280 TraceCheckUtils]: 10: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,188 INFO L280 TraceCheckUtils]: 11: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,188 INFO L280 TraceCheckUtils]: 12: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {561#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,191 INFO L280 TraceCheckUtils]: 16: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,192 INFO L280 TraceCheckUtils]: 17: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,193 INFO L280 TraceCheckUtils]: 18: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p12~0;~lk12~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,193 INFO L280 TraceCheckUtils]: 19: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p13~0;~lk13~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,194 INFO L280 TraceCheckUtils]: 20: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p14~0;~lk14~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,195 INFO L280 TraceCheckUtils]: 21: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p15~0;~lk15~0 := 1; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,195 INFO L280 TraceCheckUtils]: 22: Hoare triple {561#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {561#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:43,196 INFO L280 TraceCheckUtils]: 23: Hoare triple {561#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {558#false} is VALID [2020-07-10 15:03:43,196 INFO L280 TraceCheckUtils]: 24: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-10 15:03:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:43,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735115859] [2020-07-10 15:03:43,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:43,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:43,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575762133] [2020-07-10 15:03:43,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:43,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:43,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:43,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:43,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:43,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:43,235 INFO L87 Difference]: Start difference. First operand 100 states and 186 transitions. Second operand 3 states. [2020-07-10 15:03:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,382 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2020-07-10 15:03:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:43,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 15:03:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 15:03:43,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-10 15:03:43,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:43,551 INFO L225 Difference]: With dead ends: 103 [2020-07-10 15:03:43,551 INFO L226 Difference]: Without dead ends: 101 [2020-07-10 15:03:43,553 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-10 15:03:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-10 15:03:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-07-10 15:03:43,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:43,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2020-07-10 15:03:43,566 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2020-07-10 15:03:43,566 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2020-07-10 15:03:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,572 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2020-07-10 15:03:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 187 transitions. [2020-07-10 15:03:43,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:43,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:43,574 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2020-07-10 15:03:43,574 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2020-07-10 15:03:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,581 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2020-07-10 15:03:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 187 transitions. [2020-07-10 15:03:43,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:43,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:43,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:43,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-10 15:03:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 187 transitions. [2020-07-10 15:03:43,589 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 187 transitions. Word has length 25 [2020-07-10 15:03:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:43,590 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 187 transitions. [2020-07-10 15:03:43,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 187 transitions. [2020-07-10 15:03:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:43,592 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:43,592 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] [2020-07-10 15:03:43,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:03:43,595 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:43,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1737469676, now seen corresponding path program 1 times [2020-07-10 15:03:43,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:43,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969870508] [2020-07-10 15:03:43,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:43,728 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:03:43,728 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {985#true} {985#true} #282#return; {985#true} is VALID [2020-07-10 15:03:43,728 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-10 15:03:43,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:03:43,729 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #282#return; {985#true} is VALID [2020-07-10 15:03:43,729 INFO L263 TraceCheckUtils]: 3: Hoare triple {985#true} call #t~ret16 := main(); {985#true} is VALID [2020-07-10 15:03:43,730 INFO L280 TraceCheckUtils]: 4: Hoare triple {985#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {985#true} is VALID [2020-07-10 15:03:43,730 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {985#true} is VALID [2020-07-10 15:03:43,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {985#true} is VALID [2020-07-10 15:03:43,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {985#true} assume !(0 != ~p1~0); {985#true} is VALID [2020-07-10 15:03:43,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} assume 0 != ~p2~0;~lk2~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,736 INFO L280 TraceCheckUtils]: 10: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,737 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,739 INFO L280 TraceCheckUtils]: 13: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {989#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p10~0;~lk10~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,744 INFO L280 TraceCheckUtils]: 17: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p11~0;~lk11~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,744 INFO L280 TraceCheckUtils]: 18: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p12~0;~lk12~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,745 INFO L280 TraceCheckUtils]: 19: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p13~0;~lk13~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p14~0;~lk14~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,746 INFO L280 TraceCheckUtils]: 21: Hoare triple {989#(not (= 0 main_~p2~0))} assume 0 != ~p15~0;~lk15~0 := 1; {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,747 INFO L280 TraceCheckUtils]: 22: Hoare triple {989#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {989#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:43,748 INFO L280 TraceCheckUtils]: 23: Hoare triple {989#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {986#false} is VALID [2020-07-10 15:03:43,748 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-10 15:03:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:43,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969870508] [2020-07-10 15:03:43,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:43,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:43,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605777149] [2020-07-10 15:03:43,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:43,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:43,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:43,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:43,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:43,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:43,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:43,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:43,788 INFO L87 Difference]: Start difference. First operand 101 states and 187 transitions. Second operand 3 states. [2020-07-10 15:03:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,950 INFO L93 Difference]: Finished difference Result 236 states and 440 transitions. [2020-07-10 15:03:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:43,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-10 15:03:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-10 15:03:43,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2020-07-10 15:03:44,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:44,197 INFO L225 Difference]: With dead ends: 236 [2020-07-10 15:03:44,197 INFO L226 Difference]: Without dead ends: 140 [2020-07-10 15:03:44,198 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-10 15:03:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-07-10 15:03:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2020-07-10 15:03:44,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:44,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 138 states. [2020-07-10 15:03:44,229 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 138 states. [2020-07-10 15:03:44,229 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 138 states. [2020-07-10 15:03:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:44,237 INFO L93 Difference]: Finished difference Result 140 states and 254 transitions. [2020-07-10 15:03:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 254 transitions. [2020-07-10 15:03:44,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:44,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:44,241 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 140 states. [2020-07-10 15:03:44,241 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 140 states. [2020-07-10 15:03:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:44,248 INFO L93 Difference]: Finished difference Result 140 states and 254 transitions. [2020-07-10 15:03:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 254 transitions. [2020-07-10 15:03:44,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:44,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:44,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:44,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-10 15:03:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 253 transitions. [2020-07-10 15:03:44,258 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 253 transitions. Word has length 25 [2020-07-10 15:03:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:44,258 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 253 transitions. [2020-07-10 15:03:44,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 253 transitions. [2020-07-10 15:03:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:44,259 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:44,260 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] [2020-07-10 15:03:44,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:03:44,260 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2020-07-10 15:03:44,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:44,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641066507] [2020-07-10 15:03:44,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:44,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {1666#true} assume true; {1666#true} is VALID [2020-07-10 15:03:44,341 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1666#true} {1666#true} #282#return; {1666#true} is VALID [2020-07-10 15:03:44,342 INFO L263 TraceCheckUtils]: 0: Hoare triple {1666#true} call ULTIMATE.init(); {1666#true} is VALID [2020-07-10 15:03:44,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {1666#true} assume true; {1666#true} is VALID [2020-07-10 15:03:44,342 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1666#true} {1666#true} #282#return; {1666#true} is VALID [2020-07-10 15:03:44,343 INFO L263 TraceCheckUtils]: 3: Hoare triple {1666#true} call #t~ret16 := main(); {1666#true} is VALID [2020-07-10 15:03:44,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {1666#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p15~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk15~0;havoc ~cond~0; {1666#true} is VALID [2020-07-10 15:03:44,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {1666#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1666#true} is VALID [2020-07-10 15:03:44,344 INFO L280 TraceCheckUtils]: 6: Hoare triple {1666#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1666#true} is VALID [2020-07-10 15:03:44,344 INFO L280 TraceCheckUtils]: 7: Hoare triple {1666#true} assume !(0 != ~p1~0); {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,346 INFO L280 TraceCheckUtils]: 10: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,348 INFO L280 TraceCheckUtils]: 13: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {1670#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,350 INFO L280 TraceCheckUtils]: 15: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,350 INFO L280 TraceCheckUtils]: 16: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,351 INFO L280 TraceCheckUtils]: 17: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,352 INFO L280 TraceCheckUtils]: 18: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p12~0;~lk12~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,352 INFO L280 TraceCheckUtils]: 19: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p13~0;~lk13~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,353 INFO L280 TraceCheckUtils]: 20: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p14~0;~lk14~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,354 INFO L280 TraceCheckUtils]: 21: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p15~0;~lk15~0 := 1; {1670#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:44,354 INFO L280 TraceCheckUtils]: 22: Hoare triple {1670#(= 0 main_~p1~0)} assume 0 != ~p1~0; {1667#false} is VALID [2020-07-10 15:03:44,355 INFO L280 TraceCheckUtils]: 23: Hoare triple {1667#false} assume 1 != ~lk1~0; {1667#false} is VALID [2020-07-10 15:03:44,355 INFO L280 TraceCheckUtils]: 24: Hoare triple {1667#false} assume !false; {1667#false} is VALID [2020-07-10 15:03:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:44,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641066507] [2020-07-10 15:03:44,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:44,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:44,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121798022] [2020-07-10 15:03:44,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:44,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:44,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:44,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:44,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:44,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:44,401 INFO L87 Difference]: Start difference. First operand 138 states and 253 transitions. Second operand 3 states. [2020-07-10 15:03:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:44,568 INFO L93 Difference]: Finished difference Result 190 states and 344 transitions. [2020-07-10 15:03:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:44,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2020-07-10 15:03:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2020-07-10 15:03:44,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 277 transitions. [2020-07-10 15:03:44,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:44,881 INFO L225 Difference]: With dead ends: 190 [2020-07-10 15:03:44,881 INFO L226 Difference]: Without dead ends: 138 [2020-07-10 15:03:44,882 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-10 15:03:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-10 15:03:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-10 15:03:44,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:44,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:44,909 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:44,909 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:44,915 INFO L93 Difference]: Finished difference Result 138 states and 247 transitions. [2020-07-10 15:03:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 247 transitions. [2020-07-10 15:03:44,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:44,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:44,916 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2020-07-10 15:03:44,917 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2020-07-10 15:03:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:44,924 INFO L93 Difference]: Finished difference Result 138 states and 247 transitions. [2020-07-10 15:03:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 247 transitions. [2020-07-10 15:03:44,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:44,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:44,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:44,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-10 15:03:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 246 transitions. [2020-07-10 15:03:44,943 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 246 transitions. Word has length 25 [2020-07-10 15:03:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:44,943 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 246 transitions. [2020-07-10 15:03:44,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 246 transitions. [2020-07-10 15:03:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:44,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:44,945 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] [2020-07-10 15:03:44,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:03:44,945 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash 149121774, now seen corresponding path program 1 times [2020-07-10 15:03:44,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:44,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883163617] [2020-07-10 15:03:44,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:03:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:03:45,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:03:45,072 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:03:45,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:03:45,125 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:03:45,125 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:03:45,125 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:03:45,125 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: L223-1 has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: L223-1 has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: L223-1 has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2020-07-10 15:03:45,126 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-10 15:03:45,127 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-10 15:03:45,128 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-10 15:03:45,128 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-10 15:03:45,128 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2020-07-10 15:03:45,128 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2020-07-10 15:03:45,128 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2020-07-10 15:03:45,128 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2020-07-10 15:03:45,128 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2020-07-10 15:03:45,128 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2020-07-10 15:03:45,129 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2020-07-10 15:03:45,129 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2020-07-10 15:03:45,129 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2020-07-10 15:03:45,129 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2020-07-10 15:03:45,129 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2020-07-10 15:03:45,129 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2020-07-10 15:03:45,129 WARN L170 areAnnotationChecker]: L127-1 has no Hoare annotation [2020-07-10 15:03:45,129 WARN L170 areAnnotationChecker]: L127-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2020-07-10 15:03:45,130 WARN L170 areAnnotationChecker]: L147-1 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L147-1 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L153-1 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L153-1 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L224-1 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L224-1 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2020-07-10 15:03:45,131 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2020-07-10 15:03:45,132 WARN L170 areAnnotationChecker]: L168-1 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L168-1 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L173-1 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L173-1 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L178-1 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L178-1 has no Hoare annotation [2020-07-10 15:03:45,133 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L183-1 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L183-1 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L188-1 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L188-1 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2020-07-10 15:03:45,134 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L193-1 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L193-1 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2020-07-10 15:03:45,135 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L208-1 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L208-1 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L213-1 has no Hoare annotation [2020-07-10 15:03:45,136 WARN L170 areAnnotationChecker]: L213-1 has no Hoare annotation [2020-07-10 15:03:45,137 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2020-07-10 15:03:45,137 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2020-07-10 15:03:45,137 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2020-07-10 15:03:45,137 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2020-07-10 15:03:45,137 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2020-07-10 15:03:45,137 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2020-07-10 15:03:45,137 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:03:45,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:03:45 BoogieIcfgContainer [2020-07-10 15:03:45,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:03:45,143 INFO L168 Benchmark]: Toolchain (without parser) took 4631.28 ms. Allocated memory was 137.4 MB in the beginning and 248.5 MB in the end (delta: 111.1 MB). Free memory was 100.8 MB in the beginning and 119.1 MB in the end (delta: -18.2 MB). Peak memory consumption was 92.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:45,144 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:03:45,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.33 ms. Allocated memory is still 137.4 MB. Free memory was 100.6 MB in the beginning and 88.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:45,145 INFO L168 Benchmark]: Boogie Preprocessor took 145.11 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 88.5 MB in the beginning and 178.7 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:45,146 INFO L168 Benchmark]: RCFGBuilder took 689.64 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 138.6 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:45,147 INFO L168 Benchmark]: TraceAbstraction took 3456.44 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 138.6 MB in the beginning and 119.1 MB in the end (delta: 19.5 MB). Peak memory consumption was 66.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:45,151 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.33 ms. Allocated memory is still 137.4 MB. Free memory was 100.6 MB in the beginning and 88.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.11 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 88.5 MB in the beginning and 178.7 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 689.64 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 138.6 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3456.44 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 138.6 MB in the beginning and 119.1 MB in the end (delta: 19.5 MB). Peak memory consumption was 66.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 231]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; VAL [p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L91] COND FALSE !(p1 != 0) VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L95] COND FALSE !(p2 != 0) VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L99] COND TRUE p3 != 0 [L100] lk3 = 1 VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L103] COND TRUE p4 != 0 [L104] lk4 = 1 VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L107] COND TRUE p5 != 0 [L108] lk5 = 1 VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L111] COND TRUE p6 != 0 [L112] lk6 = 1 VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L115] COND TRUE p7 != 0 [L116] lk7 = 1 VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L119] COND FALSE !(p8 != 0) VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L123] COND TRUE p9 != 0 [L124] lk9 = 1 VAL [cond=-2, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L127] COND TRUE p10 != 0 [L128] lk10 = 1 VAL [cond=-2, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L131] COND TRUE p11 != 0 [L132] lk11 = 1 VAL [cond=-2, lk1=0, lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L135] COND TRUE p12 != 0 [L136] lk12 = 1 VAL [cond=-2, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L139] COND TRUE p13 != 0 [L140] lk13 = 1 VAL [cond=-2, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L143] COND TRUE p14 != 0 [L144] lk14 = 1 VAL [cond=-2, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L147] COND TRUE p15 != 0 [L148] lk15 = 1 VAL [cond=-2, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L153] COND FALSE !(p1 != 0) VAL [cond=-2, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L158] COND FALSE !(p2 != 0) VAL [cond=-2, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] [L231] __VERIFIER_error() VAL [cond=-2, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=2, p8=0, p9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 488 SDtfs, 243 SDslu, 321 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 5952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 incorrect! Received shutdown request...