java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:07:54,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:07:54,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:07:54,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:07:54,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:07:54,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:07:54,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:07:54,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:07:54,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:07:54,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:07:54,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:07:54,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:07:54,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:07:54,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:07:54,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:07:54,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:07:54,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:07:54,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:07:54,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:07:54,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:07:54,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:07:54,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:07:54,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:07:54,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:07:54,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:07:54,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:07:54,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:07:54,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:07:54,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:07:54,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:07:54,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:07:54,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:07:54,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:07:54,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:07:54,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:07:54,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:07:54,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:07:54,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:07:54,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:07:54,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:07:54,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:07:54,184 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 [2019-10-02 11:07:54,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:07:54,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:07:54,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:07:54,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:07:54,200 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:07:54,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:07:54,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:07:54,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:07:54,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:07:54,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:07:54,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:07:54,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:07:54,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:07:54,202 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:07:54,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:07:54,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:07:54,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:07:54,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:07:54,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:07:54,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:07:54,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:07:54,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:07:54,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:07:54,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:07:54,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:07:54,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:07:54,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:07:54,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:07:54,205 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:07:54,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:07:54,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:07:54,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:07:54,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:07:54,251 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:07:54,252 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-1.c [2019-10-02 11:07:54,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69219607f/19955a36adad48139affb8d35d2185da/FLAG54e4e6350 [2019-10-02 11:07:54,818 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:07:54,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-1.c [2019-10-02 11:07:54,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69219607f/19955a36adad48139affb8d35d2185da/FLAG54e4e6350 [2019-10-02 11:07:55,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69219607f/19955a36adad48139affb8d35d2185da [2019-10-02 11:07:55,209 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:07:55,211 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:07:55,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:07:55,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:07:55,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:07:55,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ef2688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55, skipping insertion in model container [2019-10-02 11:07:55,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,227 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:07:55,270 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:07:55,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:07:55,474 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:07:55,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:07:55,624 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:07:55,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55 WrapperNode [2019-10-02 11:07:55,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:07:55,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:07:55,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:07:55,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:07:55,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (1/1) ... [2019-10-02 11:07:55,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:07:55,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:07:55,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:07:55,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:07:55,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (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 [2019-10-02 11:07:55,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:07:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:07:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:07:55,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:07:55,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:07:55,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:07:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:07:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:07:56,143 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:07:56,143 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:07:56,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:07:56 BoogieIcfgContainer [2019-10-02 11:07:56,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:07:56,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:07:56,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:07:56,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:07:56,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:07:55" (1/3) ... [2019-10-02 11:07:56,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef2800e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:07:56, skipping insertion in model container [2019-10-02 11:07:56,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:55" (2/3) ... [2019-10-02 11:07:56,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef2800e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:07:56, skipping insertion in model container [2019-10-02 11:07:56,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:07:56" (3/3) ... [2019-10-02 11:07:56,153 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2019-10-02 11:07:56,162 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:07:56,169 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:07:56,184 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:07:56,218 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:07:56,219 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:07:56,219 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:07:56,219 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:07:56,219 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:07:56,220 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:07:56,220 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:07:56,220 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:07:56,220 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:07:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2019-10-02 11:07:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:07:56,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:07:56,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:07:56,246 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:07:56,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:07:56,251 INFO L82 PathProgramCache]: Analyzing trace with hash -563352914, now seen corresponding path program 1 times [2019-10-02 11:07:56,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:07:56,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:07:56,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:56,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:07:56,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:07:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:07:56,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:07:56,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:07:56,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:07:56,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:07:56,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:07:56,484 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2019-10-02 11:07:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:07:56,560 INFO L93 Difference]: Finished difference Result 164 states and 305 transitions. [2019-10-02 11:07:56,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:07:56,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:07:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:07:56,577 INFO L225 Difference]: With dead ends: 164 [2019-10-02 11:07:56,577 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 11:07:56,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:07:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 11:07:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-02 11:07:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-02 11:07:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 186 transitions. [2019-10-02 11:07:56,644 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 186 transitions. Word has length 25 [2019-10-02 11:07:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:07:56,644 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 186 transitions. [2019-10-02 11:07:56,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:07:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 186 transitions. [2019-10-02 11:07:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:07:56,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:07:56,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:07:56,647 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:07:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:07:56,647 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2019-10-02 11:07:56,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:07:56,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:07:56,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:56,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:07:56,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:07:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:07:56,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:07:56,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:07:56,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:07:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:07:56,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:07:56,761 INFO L87 Difference]: Start difference. First operand 100 states and 186 transitions. Second operand 3 states. [2019-10-02 11:07:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:07:56,802 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2019-10-02 11:07:56,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:07:56,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:07:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:07:56,809 INFO L225 Difference]: With dead ends: 103 [2019-10-02 11:07:56,810 INFO L226 Difference]: Without dead ends: 101 [2019-10-02 11:07:56,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:07:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-02 11:07:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-10-02 11:07:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-02 11:07:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 187 transitions. [2019-10-02 11:07:56,827 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 187 transitions. Word has length 25 [2019-10-02 11:07:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:07:56,828 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 187 transitions. [2019-10-02 11:07:56,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:07:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 187 transitions. [2019-10-02 11:07:56,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:07:56,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:07:56,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:07:56,831 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:07:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:07:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1737469676, now seen corresponding path program 1 times [2019-10-02 11:07:56,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:07:56,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:07:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:56,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:07:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:07:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:07:56,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:07:56,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:07:56,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:07:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:07:56,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:07:56,946 INFO L87 Difference]: Start difference. First operand 101 states and 187 transitions. Second operand 3 states. [2019-10-02 11:07:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:07:56,988 INFO L93 Difference]: Finished difference Result 236 states and 440 transitions. [2019-10-02 11:07:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:07:56,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:07:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:07:56,994 INFO L225 Difference]: With dead ends: 236 [2019-10-02 11:07:56,996 INFO L226 Difference]: Without dead ends: 140 [2019-10-02 11:07:56,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:07:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-02 11:07:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-10-02 11:07:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-02 11:07:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 253 transitions. [2019-10-02 11:07:57,017 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 253 transitions. Word has length 25 [2019-10-02 11:07:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:07:57,018 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 253 transitions. [2019-10-02 11:07:57,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:07:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 253 transitions. [2019-10-02 11:07:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:07:57,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:07:57,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:07:57,024 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:07:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:07:57,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2019-10-02 11:07:57,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:07:57,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:07:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:57,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:07:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:07:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:07:57,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:07:57,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:07:57,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:07:57,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:07:57,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:07:57,116 INFO L87 Difference]: Start difference. First operand 138 states and 253 transitions. Second operand 3 states. [2019-10-02 11:07:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:07:57,154 INFO L93 Difference]: Finished difference Result 190 states and 344 transitions. [2019-10-02 11:07:57,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:07:57,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:07:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:07:57,156 INFO L225 Difference]: With dead ends: 190 [2019-10-02 11:07:57,156 INFO L226 Difference]: Without dead ends: 138 [2019-10-02 11:07:57,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:07:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-02 11:07:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-02 11:07:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-02 11:07:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 246 transitions. [2019-10-02 11:07:57,176 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 246 transitions. Word has length 25 [2019-10-02 11:07:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:07:57,177 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 246 transitions. [2019-10-02 11:07:57,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:07:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 246 transitions. [2019-10-02 11:07:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:07:57,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:07:57,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:07:57,179 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:07:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:07:57,179 INFO L82 PathProgramCache]: Analyzing trace with hash 149121774, now seen corresponding path program 1 times [2019-10-02 11:07:57,179 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:07:57,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:07:57,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:57,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:07:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 11:07:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 11:07:57,305 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-02 11:07:57,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:07:57 BoogieIcfgContainer [2019-10-02 11:07:57,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:07:57,364 INFO L168 Benchmark]: Toolchain (without parser) took 2152.59 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 90.4 MB in the beginning and 91.1 MB in the end (delta: -742.1 kB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:57,365 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:07:57,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.55 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 90.2 MB in the beginning and 177.3 MB in the end (delta: -87.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:57,367 INFO L168 Benchmark]: Boogie Preprocessor took 44.87 ms. Allocated memory is still 201.3 MB. Free memory was 177.3 MB in the beginning and 174.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:57,368 INFO L168 Benchmark]: RCFGBuilder took 474.05 ms. Allocated memory is still 201.3 MB. Free memory was 174.9 MB in the beginning and 151.4 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:57,369 INFO L168 Benchmark]: TraceAbstraction took 1215.88 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 91.1 MB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:57,374 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 413.55 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 90.2 MB in the beginning and 177.3 MB in the end (delta: -87.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.87 ms. Allocated memory is still 201.3 MB. Free memory was 177.3 MB in the beginning and 174.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 474.05 ms. Allocated memory is still 201.3 MB. Free memory was 174.9 MB in the beginning and 151.4 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1215.88 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 91.1 MB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 231]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; VAL [p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L91] COND FALSE !(p1 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L95] COND FALSE !(p2 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L99] COND TRUE p3 != 0 [L100] lk3 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L103] COND TRUE p4 != 0 [L104] lk4 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L107] COND TRUE p5 != 0 [L108] lk5 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L111] COND TRUE p6 != 0 [L112] lk6 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L115] COND TRUE p7 != 0 [L116] lk7 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L119] COND FALSE !(p8 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L123] COND TRUE p9 != 0 [L124] lk9 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L127] COND TRUE p10 != 0 [L128] lk10 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L131] COND TRUE p11 != 0 [L132] lk11 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L135] COND TRUE p12 != 0 [L136] lk12 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L139] COND TRUE p13 != 0 [L140] lk13 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L143] COND TRUE p14 != 0 [L144] lk14 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L147] COND TRUE p15 != 0 [L148] lk15 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L153] COND FALSE !(p1 != 0) VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L158] COND FALSE !(p2 != 0) VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L231] __VERIFIER_error() VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p15=3, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 488 SDtfs, 243 SDslu, 321 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 5952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...