/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_14-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:03:31,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:03:31,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:03:31,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:03:31,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:03:31,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:03:31,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:03:31,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:03:31,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:03:31,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:03:31,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:03:31,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:03:31,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:03:31,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:03:31,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:03:31,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:03:31,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:03:31,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:03:31,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:03:31,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:03:31,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:03:31,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:03:31,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:03:31,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:03:31,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:03:31,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:03:31,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:03:31,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:03:31,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:03:31,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:03:31,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:03:31,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:03:31,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:03:31,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:03:31,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:03:31,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:03:31,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:03:31,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:03:31,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:03:31,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:03:31,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:03:31,430 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:31,452 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:03:31,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:03:31,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:03:31,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:03:31,455 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:03:31,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:03:31,456 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:03:31,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:03:31,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:03:31,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:03:31,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:03:31,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:03:31,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:03:31,459 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:03:31,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:03:31,459 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:03:31,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:03:31,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:03:31,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:03:31,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:03:31,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:03:31,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:31,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:03:31,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:03:31,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:03:31,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:03:31,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:03:31,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:03:31,462 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:03:31,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:03:31,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:03:31,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:03:31,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:03:31,745 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:03:31,745 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:03:31,746 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-2.c [2020-07-10 15:03:31,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99dcbfd68/692afa940da140ceb11f0fe02325392e/FLAG8d22e5682 [2020-07-10 15:03:32,361 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:03:32,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c [2020-07-10 15:03:32,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99dcbfd68/692afa940da140ceb11f0fe02325392e/FLAG8d22e5682 [2020-07-10 15:03:32,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99dcbfd68/692afa940da140ceb11f0fe02325392e [2020-07-10 15:03:32,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:03:32,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:03:32,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:32,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:03:32,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:03:32,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71475f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:32, skipping insertion in model container [2020-07-10 15:03:32,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:32" (1/1) ... [2020-07-10 15:03:32,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:03:32,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:03:32,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:32,993 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:03:33,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:33,040 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:03:33,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:33 WrapperNode [2020-07-10 15:03:33,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:33,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:03:33,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:03:33,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:03:33,138 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:33" (1/1) ... [2020-07-10 15:03:33,139 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:33" (1/1) ... [2020-07-10 15:03:33,145 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:33" (1/1) ... [2020-07-10 15:03:33,145 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:33" (1/1) ... [2020-07-10 15:03:33,155 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:33" (1/1) ... [2020-07-10 15:03:33,169 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:33" (1/1) ... [2020-07-10 15:03:33,171 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:33" (1/1) ... [2020-07-10 15:03:33,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:03:33,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:03:33,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:03:33,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:03:33,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:33" (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:33,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:03:33,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:03:33,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:03:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:03:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:03:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:03:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:03:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:03:33,847 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:03:33,848 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:03:33,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:33 BoogieIcfgContainer [2020-07-10 15:03:33,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:03:33,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:03:33,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:03:33,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:03:33,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:03:32" (1/3) ... [2020-07-10 15:03:33,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7b0d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:33, skipping insertion in model container [2020-07-10 15:03:33,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:33" (2/3) ... [2020-07-10 15:03:33,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7b0d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:33, skipping insertion in model container [2020-07-10 15:03:33,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:33" (3/3) ... [2020-07-10 15:03:33,864 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2020-07-10 15:03:33,877 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:03:33,887 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:03:33,903 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:03:33,932 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:03:33,932 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:03:33,932 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:03:33,932 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:03:33,933 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:03:33,933 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:03:33,933 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:03:33,934 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:03:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-07-10 15:03:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:33,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:33,968 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] [2020-07-10 15:03:33,969 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:33,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1694527455, now seen corresponding path program 1 times [2020-07-10 15:03:33,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:33,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040924767] [2020-07-10 15:03:33,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:34,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-10 15:03:34,244 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {59#true} {59#true} #265#return; {59#true} is VALID [2020-07-10 15:03:34,246 INFO L263 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2020-07-10 15:03:34,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#true} assume true; {59#true} is VALID [2020-07-10 15:03:34,247 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {59#true} {59#true} #265#return; {59#true} is VALID [2020-07-10 15:03:34,248 INFO L263 TraceCheckUtils]: 3: Hoare triple {59#true} call #t~ret15 := main(); {59#true} is VALID [2020-07-10 15:03:34,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {59#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;havoc ~cond~0; {59#true} is VALID [2020-07-10 15:03:34,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {59#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {59#true} is VALID [2020-07-10 15:03:34,249 INFO L280 TraceCheckUtils]: 6: Hoare triple {59#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; {59#true} is VALID [2020-07-10 15:03:34,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {59#true} assume 0 != ~p1~0;~lk1~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,252 INFO L280 TraceCheckUtils]: 8: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,253 INFO L280 TraceCheckUtils]: 9: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,254 INFO L280 TraceCheckUtils]: 10: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,255 INFO L280 TraceCheckUtils]: 11: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {63#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,267 INFO L280 TraceCheckUtils]: 15: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,268 INFO L280 TraceCheckUtils]: 16: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p10~0;~lk10~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,269 INFO L280 TraceCheckUtils]: 17: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p11~0;~lk11~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,271 INFO L280 TraceCheckUtils]: 18: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p12~0;~lk12~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,272 INFO L280 TraceCheckUtils]: 19: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p13~0;~lk13~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,273 INFO L280 TraceCheckUtils]: 20: Hoare triple {63#(not (= 0 main_~p1~0))} assume 0 != ~p14~0;~lk14~0 := 1; {63#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:34,276 INFO L280 TraceCheckUtils]: 21: Hoare triple {63#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {60#false} is VALID [2020-07-10 15:03:34,276 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#false} assume !(0 != ~p2~0); {60#false} is VALID [2020-07-10 15:03:34,277 INFO L280 TraceCheckUtils]: 23: Hoare triple {60#false} assume !false; {60#false} is VALID [2020-07-10 15:03:34,287 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:34,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040924767] [2020-07-10 15:03:34,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:34,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:34,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7063439] [2020-07-10 15:03:34,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:34,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:34,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:34,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:34,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:34,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:34,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:34,366 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2020-07-10 15:03:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,705 INFO L93 Difference]: Finished difference Result 155 states and 287 transitions. [2020-07-10 15:03:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:34,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2020-07-10 15:03:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2020-07-10 15:03:34,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 287 transitions. [2020-07-10 15:03:35,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:35,089 INFO L225 Difference]: With dead ends: 155 [2020-07-10 15:03:35,089 INFO L226 Difference]: Without dead ends: 96 [2020-07-10 15:03:35,093 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:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-10 15:03:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2020-07-10 15:03:35,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:35,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2020-07-10 15:03:35,166 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2020-07-10 15:03:35,166 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2020-07-10 15:03:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,176 INFO L93 Difference]: Finished difference Result 96 states and 175 transitions. [2020-07-10 15:03:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 175 transitions. [2020-07-10 15:03:35,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,179 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2020-07-10 15:03:35,179 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2020-07-10 15:03:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,188 INFO L93 Difference]: Finished difference Result 96 states and 175 transitions. [2020-07-10 15:03:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 175 transitions. [2020-07-10 15:03:35,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:35,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-10 15:03:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 174 transitions. [2020-07-10 15:03:35,199 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 174 transitions. Word has length 24 [2020-07-10 15:03:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:35,200 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 174 transitions. [2020-07-10 15:03:35,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 174 transitions. [2020-07-10 15:03:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:35,202 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:35,202 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] [2020-07-10 15:03:35,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:03:35,203 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2020-07-10 15:03:35,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:35,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953125442] [2020-07-10 15:03:35,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {527#true} assume true; {527#true} is VALID [2020-07-10 15:03:35,317 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {527#true} {527#true} #265#return; {527#true} is VALID [2020-07-10 15:03:35,317 INFO L263 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2020-07-10 15:03:35,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {527#true} assume true; {527#true} is VALID [2020-07-10 15:03:35,318 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {527#true} {527#true} #265#return; {527#true} is VALID [2020-07-10 15:03:35,318 INFO L263 TraceCheckUtils]: 3: Hoare triple {527#true} call #t~ret15 := main(); {527#true} is VALID [2020-07-10 15:03:35,318 INFO L280 TraceCheckUtils]: 4: Hoare triple {527#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;havoc ~cond~0; {527#true} is VALID [2020-07-10 15:03:35,319 INFO L280 TraceCheckUtils]: 5: Hoare triple {527#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {527#true} is VALID [2020-07-10 15:03:35,319 INFO L280 TraceCheckUtils]: 6: Hoare triple {527#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; {527#true} is VALID [2020-07-10 15:03:35,320 INFO L280 TraceCheckUtils]: 7: Hoare triple {527#true} assume 0 != ~p1~0;~lk1~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,321 INFO L280 TraceCheckUtils]: 8: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,322 INFO L280 TraceCheckUtils]: 9: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,323 INFO L280 TraceCheckUtils]: 10: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,325 INFO L280 TraceCheckUtils]: 12: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,326 INFO L280 TraceCheckUtils]: 13: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,327 INFO L280 TraceCheckUtils]: 14: Hoare triple {531#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,328 INFO L280 TraceCheckUtils]: 15: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,329 INFO L280 TraceCheckUtils]: 16: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,329 INFO L280 TraceCheckUtils]: 17: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,330 INFO L280 TraceCheckUtils]: 18: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p12~0;~lk12~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,330 INFO L280 TraceCheckUtils]: 19: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p13~0;~lk13~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,331 INFO L280 TraceCheckUtils]: 20: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p14~0;~lk14~0 := 1; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,332 INFO L280 TraceCheckUtils]: 21: Hoare triple {531#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {531#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:35,333 INFO L280 TraceCheckUtils]: 22: Hoare triple {531#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {528#false} is VALID [2020-07-10 15:03:35,333 INFO L280 TraceCheckUtils]: 23: Hoare triple {528#false} assume !false; {528#false} is VALID [2020-07-10 15:03:35,338 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:35,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953125442] [2020-07-10 15:03:35,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:35,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:35,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088750152] [2020-07-10 15:03:35,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:35,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:35,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:35,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:35,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:35,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:35,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:35,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,378 INFO L87 Difference]: Start difference. First operand 94 states and 174 transitions. Second operand 3 states. [2020-07-10 15:03:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,507 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2020-07-10 15:03:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:35,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-10 15:03:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-10 15:03:35,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-10 15:03:35,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:35,683 INFO L225 Difference]: With dead ends: 97 [2020-07-10 15:03:35,683 INFO L226 Difference]: Without dead ends: 95 [2020-07-10 15:03:35,685 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:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-10 15:03:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-07-10 15:03:35,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:35,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2020-07-10 15:03:35,697 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2020-07-10 15:03:35,697 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2020-07-10 15:03:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,702 INFO L93 Difference]: Finished difference Result 95 states and 175 transitions. [2020-07-10 15:03:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2020-07-10 15:03:35,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,704 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2020-07-10 15:03:35,704 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2020-07-10 15:03:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,709 INFO L93 Difference]: Finished difference Result 95 states and 175 transitions. [2020-07-10 15:03:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2020-07-10 15:03:35,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:35,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-10 15:03:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2020-07-10 15:03:35,717 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 24 [2020-07-10 15:03:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:35,717 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 175 transitions. [2020-07-10 15:03:35,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2020-07-10 15:03:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:35,718 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:35,719 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] [2020-07-10 15:03:35,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:03:35,719 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash 106179553, now seen corresponding path program 1 times [2020-07-10 15:03:35,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:35,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730402657] [2020-07-10 15:03:35,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {931#true} assume true; {931#true} is VALID [2020-07-10 15:03:35,773 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {931#true} {931#true} #265#return; {931#true} is VALID [2020-07-10 15:03:35,773 INFO L263 TraceCheckUtils]: 0: Hoare triple {931#true} call ULTIMATE.init(); {931#true} is VALID [2020-07-10 15:03:35,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#true} assume true; {931#true} is VALID [2020-07-10 15:03:35,774 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {931#true} {931#true} #265#return; {931#true} is VALID [2020-07-10 15:03:35,774 INFO L263 TraceCheckUtils]: 3: Hoare triple {931#true} call #t~ret15 := main(); {931#true} is VALID [2020-07-10 15:03:35,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {931#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;havoc ~cond~0; {931#true} is VALID [2020-07-10 15:03:35,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {931#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {931#true} is VALID [2020-07-10 15:03:35,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {931#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; {931#true} is VALID [2020-07-10 15:03:35,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#true} assume !(0 != ~p1~0); {931#true} is VALID [2020-07-10 15:03:35,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {931#true} assume 0 != ~p2~0;~lk2~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,777 INFO L280 TraceCheckUtils]: 9: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,778 INFO L280 TraceCheckUtils]: 10: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,778 INFO L280 TraceCheckUtils]: 11: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,779 INFO L280 TraceCheckUtils]: 13: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,780 INFO L280 TraceCheckUtils]: 14: Hoare triple {935#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,781 INFO L280 TraceCheckUtils]: 16: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p10~0;~lk10~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p11~0;~lk11~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,782 INFO L280 TraceCheckUtils]: 18: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p12~0;~lk12~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,783 INFO L280 TraceCheckUtils]: 19: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p13~0;~lk13~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,784 INFO L280 TraceCheckUtils]: 20: Hoare triple {935#(not (= 0 main_~p2~0))} assume 0 != ~p14~0;~lk14~0 := 1; {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,784 INFO L280 TraceCheckUtils]: 21: Hoare triple {935#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {935#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:35,785 INFO L280 TraceCheckUtils]: 22: Hoare triple {935#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {932#false} is VALID [2020-07-10 15:03:35,785 INFO L280 TraceCheckUtils]: 23: Hoare triple {932#false} assume !false; {932#false} is VALID [2020-07-10 15:03:35,786 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:35,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730402657] [2020-07-10 15:03:35,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:35,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:35,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305496190] [2020-07-10 15:03:35,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:35,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:35,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:35,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:35,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:35,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:35,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:35,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,813 INFO L87 Difference]: Start difference. First operand 95 states and 175 transitions. Second operand 3 states. [2020-07-10 15:03:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,946 INFO L93 Difference]: Finished difference Result 222 states and 412 transitions. [2020-07-10 15:03:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:35,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2020-07-10 15:03:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2020-07-10 15:03:35,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 216 transitions. [2020-07-10 15:03:36,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:36,181 INFO L225 Difference]: With dead ends: 222 [2020-07-10 15:03:36,182 INFO L226 Difference]: Without dead ends: 132 [2020-07-10 15:03:36,183 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:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-10 15:03:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2020-07-10 15:03:36,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:36,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 130 states. [2020-07-10 15:03:36,200 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 130 states. [2020-07-10 15:03:36,200 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 130 states. [2020-07-10 15:03:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,207 INFO L93 Difference]: Finished difference Result 132 states and 238 transitions. [2020-07-10 15:03:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 238 transitions. [2020-07-10 15:03:36,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,208 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 132 states. [2020-07-10 15:03:36,209 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 132 states. [2020-07-10 15:03:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,216 INFO L93 Difference]: Finished difference Result 132 states and 238 transitions. [2020-07-10 15:03:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 238 transitions. [2020-07-10 15:03:36,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:36,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-07-10 15:03:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 237 transitions. [2020-07-10 15:03:36,224 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 237 transitions. Word has length 24 [2020-07-10 15:03:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:36,224 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 237 transitions. [2020-07-10 15:03:36,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 237 transitions. [2020-07-10 15:03:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:36,225 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:36,225 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] [2020-07-10 15:03:36,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:03:36,226 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2020-07-10 15:03:36,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:36,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196914480] [2020-07-10 15:03:36,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:36,284 INFO L280 TraceCheckUtils]: 0: Hoare triple {1574#true} assume true; {1574#true} is VALID [2020-07-10 15:03:36,284 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1574#true} {1574#true} #265#return; {1574#true} is VALID [2020-07-10 15:03:36,284 INFO L263 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2020-07-10 15:03:36,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {1574#true} assume true; {1574#true} is VALID [2020-07-10 15:03:36,285 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1574#true} {1574#true} #265#return; {1574#true} is VALID [2020-07-10 15:03:36,285 INFO L263 TraceCheckUtils]: 3: Hoare triple {1574#true} call #t~ret15 := main(); {1574#true} is VALID [2020-07-10 15:03:36,286 INFO L280 TraceCheckUtils]: 4: Hoare triple {1574#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;havoc ~cond~0; {1574#true} is VALID [2020-07-10 15:03:36,286 INFO L280 TraceCheckUtils]: 5: Hoare triple {1574#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1574#true} is VALID [2020-07-10 15:03:36,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {1574#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; {1574#true} is VALID [2020-07-10 15:03:36,287 INFO L280 TraceCheckUtils]: 7: Hoare triple {1574#true} assume !(0 != ~p1~0); {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,288 INFO L280 TraceCheckUtils]: 8: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,288 INFO L280 TraceCheckUtils]: 9: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,289 INFO L280 TraceCheckUtils]: 10: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,290 INFO L280 TraceCheckUtils]: 11: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,291 INFO L280 TraceCheckUtils]: 12: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,292 INFO L280 TraceCheckUtils]: 13: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,292 INFO L280 TraceCheckUtils]: 14: Hoare triple {1578#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,293 INFO L280 TraceCheckUtils]: 15: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,293 INFO L280 TraceCheckUtils]: 16: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,294 INFO L280 TraceCheckUtils]: 17: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,294 INFO L280 TraceCheckUtils]: 18: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p12~0;~lk12~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,295 INFO L280 TraceCheckUtils]: 19: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p13~0;~lk13~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,296 INFO L280 TraceCheckUtils]: 20: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p14~0;~lk14~0 := 1; {1578#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:36,297 INFO L280 TraceCheckUtils]: 21: Hoare triple {1578#(= 0 main_~p1~0)} assume 0 != ~p1~0; {1575#false} is VALID [2020-07-10 15:03:36,297 INFO L280 TraceCheckUtils]: 22: Hoare triple {1575#false} assume 1 != ~lk1~0; {1575#false} is VALID [2020-07-10 15:03:36,298 INFO L280 TraceCheckUtils]: 23: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2020-07-10 15:03:36,299 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:36,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196914480] [2020-07-10 15:03:36,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:36,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:36,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575120108] [2020-07-10 15:03:36,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:36,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:36,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:36,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:36,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:36,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:36,324 INFO L87 Difference]: Start difference. First operand 130 states and 237 transitions. Second operand 3 states. [2020-07-10 15:03:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,504 INFO L93 Difference]: Finished difference Result 179 states and 322 transitions. [2020-07-10 15:03:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:36,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2020-07-10 15:03:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2020-07-10 15:03:36,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 259 transitions. [2020-07-10 15:03:36,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:36,757 INFO L225 Difference]: With dead ends: 179 [2020-07-10 15:03:36,757 INFO L226 Difference]: Without dead ends: 130 [2020-07-10 15:03:36,758 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:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-10 15:03:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2020-07-10 15:03:36,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:36,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 128 states. [2020-07-10 15:03:36,773 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 128 states. [2020-07-10 15:03:36,774 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 128 states. [2020-07-10 15:03:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,780 INFO L93 Difference]: Finished difference Result 130 states and 231 transitions. [2020-07-10 15:03:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 231 transitions. [2020-07-10 15:03:36,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,781 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 130 states. [2020-07-10 15:03:36,781 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 130 states. [2020-07-10 15:03:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,786 INFO L93 Difference]: Finished difference Result 130 states and 231 transitions. [2020-07-10 15:03:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 231 transitions. [2020-07-10 15:03:36,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:36,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-07-10 15:03:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 230 transitions. [2020-07-10 15:03:36,793 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 230 transitions. Word has length 24 [2020-07-10 15:03:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:36,793 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 230 transitions. [2020-07-10 15:03:36,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 230 transitions. [2020-07-10 15:03:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:36,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:36,795 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] [2020-07-10 15:03:36,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:03:36,795 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash -914888801, now seen corresponding path program 1 times [2020-07-10 15:03:36,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:36,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824242650] [2020-07-10 15:03:36,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:03:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:03:36,865 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:03:36,865 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:03:36,865 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:03:36,927 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:03:36,927 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:03:36,927 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:03:36,927 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:03:36,927 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:03:36,928 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:03:36,928 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:03:36,928 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2020-07-10 15:03:36,928 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2020-07-10 15:03:36,928 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2020-07-10 15:03:36,928 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:03:36,928 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2020-07-10 15:03:36,928 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:03:36,929 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:03:36,929 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:03:36,929 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 15:03:36,929 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-10 15:03:36,929 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:03:36,929 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2020-07-10 15:03:36,929 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2020-07-10 15:03:36,929 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2020-07-10 15:03:36,930 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2020-07-10 15:03:36,931 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2020-07-10 15:03:36,931 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2020-07-10 15:03:36,931 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2020-07-10 15:03:36,931 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2020-07-10 15:03:36,931 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-10 15:03:36,931 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-10 15:03:36,931 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2020-07-10 15:03:36,931 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2020-07-10 15:03:36,932 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2020-07-10 15:03:36,932 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2020-07-10 15:03:36,932 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2020-07-10 15:03:36,932 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2020-07-10 15:03:36,932 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2020-07-10 15:03:36,932 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2020-07-10 15:03:36,932 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2020-07-10 15:03:36,932 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2020-07-10 15:03:36,933 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2020-07-10 15:03:36,933 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2020-07-10 15:03:36,933 WARN L170 areAnnotationChecker]: L144-1 has no Hoare annotation [2020-07-10 15:03:36,933 WARN L170 areAnnotationChecker]: L144-1 has no Hoare annotation [2020-07-10 15:03:36,933 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2020-07-10 15:03:36,933 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2020-07-10 15:03:36,933 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L154-1 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L154-1 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2020-07-10 15:03:36,934 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2020-07-10 15:03:36,935 WARN L170 areAnnotationChecker]: L159-1 has no Hoare annotation [2020-07-10 15:03:36,935 WARN L170 areAnnotationChecker]: L159-1 has no Hoare annotation [2020-07-10 15:03:36,935 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2020-07-10 15:03:36,935 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2020-07-10 15:03:36,935 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2020-07-10 15:03:36,935 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2020-07-10 15:03:36,935 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-10 15:03:36,935 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2020-07-10 15:03:36,936 WARN L170 areAnnotationChecker]: L179-1 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L179-1 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L184-1 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L184-1 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L190 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L190 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L189-1 has no Hoare annotation [2020-07-10 15:03:36,937 WARN L170 areAnnotationChecker]: L189-1 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L195 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L195 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L194-1 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L194-1 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L199-1 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L199-1 has no Hoare annotation [2020-07-10 15:03:36,938 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2020-07-10 15:03:36,939 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2020-07-10 15:03:36,939 WARN L170 areAnnotationChecker]: L204-1 has no Hoare annotation [2020-07-10 15:03:36,939 WARN L170 areAnnotationChecker]: L204-1 has no Hoare annotation [2020-07-10 15:03:36,939 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2020-07-10 15:03:36,939 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2020-07-10 15:03:36,939 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:36,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:03:36 BoogieIcfgContainer [2020-07-10 15:03:36,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:03:36,946 INFO L168 Benchmark]: Toolchain (without parser) took 4255.30 ms. Allocated memory was 143.1 MB in the beginning and 248.5 MB in the end (delta: 105.4 MB). Free memory was 101.6 MB in the beginning and 139.2 MB in the end (delta: -37.5 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:36,947 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:03:36,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.47 ms. Allocated memory is still 143.1 MB. Free memory was 101.4 MB in the beginning and 89.0 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:36,949 INFO L168 Benchmark]: Boogie Preprocessor took 132.47 ms. Allocated memory was 143.1 MB in the beginning and 201.9 MB in the end (delta: 58.7 MB). Free memory was 89.0 MB in the beginning and 179.4 MB in the end (delta: -90.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:36,949 INFO L168 Benchmark]: RCFGBuilder took 679.11 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 141.6 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:36,950 INFO L168 Benchmark]: TraceAbstraction took 3087.36 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 140.9 MB in the beginning and 139.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:03:36,954 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 143.1 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.47 ms. Allocated memory is still 143.1 MB. Free memory was 101.4 MB in the beginning and 89.0 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.47 ms. Allocated memory was 143.1 MB in the beginning and 201.9 MB in the end (delta: 58.7 MB). Free memory was 89.0 MB in the beginning and 179.4 MB in the end (delta: -90.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 679.11 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 141.6 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3087.36 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 140.9 MB in the beginning and 139.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 217]: 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; [L49] int cond; VAL [p1=0, p10=1, p11=1, p12=1, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L86] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L90] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L94] COND TRUE p3 != 0 [L95] lk3 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L98] COND TRUE p4 != 0 [L99] lk4 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L102] COND TRUE p5 != 0 [L103] lk5 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L106] COND TRUE p6 != 0 [L107] lk6 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L110] COND TRUE p7 != 0 [L111] lk7 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L114] COND FALSE !(p8 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L118] COND TRUE p9 != 0 [L119] lk9 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L122] COND TRUE p10 != 0 [L123] lk10 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L126] COND TRUE p11 != 0 [L127] lk11 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=0, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L130] COND TRUE p12 != 0 [L131] lk12 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L134] COND TRUE p13 != 0 [L135] lk13 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L138] COND TRUE p14 != 0 [L139] lk14 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L144] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L149] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] [L217] __VERIFIER_error() VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=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, p2=0, p3=1, p4=1, p5=1, p6=1, p7=-1, p8=0, p9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 458 SDtfs, 227 SDslu, 301 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=130occurred 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 5382 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...