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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:13,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:13,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:13,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:13,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:13,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:13,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:13,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:13,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:13,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:13,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:13,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:13,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:13,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:13,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:13,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:13,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:13,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:13,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:13,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:13,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:13,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:13,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:13,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:13,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:13,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:13,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:13,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:13,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:13,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:13,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:13,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:13,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:13,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:13,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:13,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:13,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:13,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:13,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:13,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:13,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:13,392 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-15 01:04:13,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:13,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:13,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:13,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:13,409 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:13,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:13,410 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:13,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:13,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:13,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:13,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:13,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:13,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:13,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:13,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:13,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:13,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:13,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:13,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:13,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:13,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:13,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:13,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:13,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:13,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:13,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:13,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:13,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:13,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:04:13,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:13,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:13,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:13,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:13,776 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:13,776 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-15 01:04:13,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db0f40e4/e5681f95e68a490fa0a79822308dffbb/FLAG29a6d2786 [2019-10-15 01:04:14,279 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:14,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-1.c [2019-10-15 01:04:14,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db0f40e4/e5681f95e68a490fa0a79822308dffbb/FLAG29a6d2786 [2019-10-15 01:04:14,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db0f40e4/e5681f95e68a490fa0a79822308dffbb [2019-10-15 01:04:14,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:14,715 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:14,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:14,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:14,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:14,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b70fdbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14, skipping insertion in model container [2019-10-15 01:04:14,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:14,776 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:14,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:14,973 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:15,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:15,105 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:15,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15 WrapperNode [2019-10-15 01:04:15,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:15,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:15,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:15,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:15,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:15,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:15,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:15,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:15,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (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-15 01:04:15,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:15,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:15,637 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:15,637 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:15,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:15 BoogieIcfgContainer [2019-10-15 01:04:15,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:15,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:15,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:15,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:15,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:14" (1/3) ... [2019-10-15 01:04:15,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e98aa74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:15, skipping insertion in model container [2019-10-15 01:04:15,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (2/3) ... [2019-10-15 01:04:15,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e98aa74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:15, skipping insertion in model container [2019-10-15 01:04:15,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:15" (3/3) ... [2019-10-15 01:04:15,648 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2019-10-15 01:04:15,658 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:15,667 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:15,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:15,701 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:15,701 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:15,701 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:15,702 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:15,702 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:15,702 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:15,702 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:15,703 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2019-10-15 01:04:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:15,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,731 INFO L380 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-15 01:04:15,733 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,739 INFO L82 PathProgramCache]: Analyzing trace with hash -563352914, now seen corresponding path program 1 times [2019-10-15 01:04:15,749 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371159417] [2019-10-15 01:04:15,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,962 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-15 01:04:15,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371159417] [2019-10-15 01:04:15,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:15,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:15,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158883249] [2019-10-15 01:04:15,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:15,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:15,990 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2019-10-15 01:04:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,069 INFO L93 Difference]: Finished difference Result 164 states and 305 transitions. [2019-10-15 01:04:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,092 INFO L225 Difference]: With dead ends: 164 [2019-10-15 01:04:16,092 INFO L226 Difference]: Without dead ends: 102 [2019-10-15 01:04:16,100 INFO L600 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-15 01:04:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-15 01:04:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-15 01:04:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-15 01:04:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 186 transitions. [2019-10-15 01:04:16,212 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 186 transitions. Word has length 25 [2019-10-15 01:04:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,213 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 186 transitions. [2019-10-15 01:04:16,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 186 transitions. [2019-10-15 01:04:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:16,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,217 INFO L380 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-15 01:04:16,218 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,218 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2019-10-15 01:04:16,219 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065355221] [2019-10-15 01:04:16,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,307 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-15 01:04:16,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065355221] [2019-10-15 01:04:16,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754475070] [2019-10-15 01:04:16,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,313 INFO L87 Difference]: Start difference. First operand 100 states and 186 transitions. Second operand 3 states. [2019-10-15 01:04:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,354 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2019-10-15 01:04:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,361 INFO L225 Difference]: With dead ends: 103 [2019-10-15 01:04:16,362 INFO L226 Difference]: Without dead ends: 101 [2019-10-15 01:04:16,364 INFO L600 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-15 01:04:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-15 01:04:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-10-15 01:04:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-15 01:04:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 187 transitions. [2019-10-15 01:04:16,385 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 187 transitions. Word has length 25 [2019-10-15 01:04:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,385 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 187 transitions. [2019-10-15 01:04:16,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 187 transitions. [2019-10-15 01:04:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:16,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,387 INFO L380 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-15 01:04:16,387 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1737469676, now seen corresponding path program 1 times [2019-10-15 01:04:16,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66072984] [2019-10-15 01:04:16,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,500 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-15 01:04:16,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66072984] [2019-10-15 01:04:16,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281142227] [2019-10-15 01:04:16,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,504 INFO L87 Difference]: Start difference. First operand 101 states and 187 transitions. Second operand 3 states. [2019-10-15 01:04:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,539 INFO L93 Difference]: Finished difference Result 236 states and 440 transitions. [2019-10-15 01:04:16,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,544 INFO L225 Difference]: With dead ends: 236 [2019-10-15 01:04:16,544 INFO L226 Difference]: Without dead ends: 140 [2019-10-15 01:04:16,546 INFO L600 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-15 01:04:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-15 01:04:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-10-15 01:04:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-15 01:04:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 253 transitions. [2019-10-15 01:04:16,564 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 253 transitions. Word has length 25 [2019-10-15 01:04:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,564 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 253 transitions. [2019-10-15 01:04:16,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 253 transitions. [2019-10-15 01:04:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:16,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,566 INFO L380 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-15 01:04:16,566 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2019-10-15 01:04:16,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821450135] [2019-10-15 01:04:16,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,630 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-15 01:04:16,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821450135] [2019-10-15 01:04:16,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041327309] [2019-10-15 01:04:16,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,639 INFO L87 Difference]: Start difference. First operand 138 states and 253 transitions. Second operand 3 states. [2019-10-15 01:04:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,678 INFO L93 Difference]: Finished difference Result 190 states and 344 transitions. [2019-10-15 01:04:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,681 INFO L225 Difference]: With dead ends: 190 [2019-10-15 01:04:16,681 INFO L226 Difference]: Without dead ends: 138 [2019-10-15 01:04:16,682 INFO L600 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-15 01:04:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-15 01:04:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-15 01:04:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-15 01:04:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 246 transitions. [2019-10-15 01:04:16,694 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 246 transitions. Word has length 25 [2019-10-15 01:04:16,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,694 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 246 transitions. [2019-10-15 01:04:16,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 246 transitions. [2019-10-15 01:04:16,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:16,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,696 INFO L380 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-15 01:04:16,696 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash 149121774, now seen corresponding path program 1 times [2019-10-15 01:04:16,697 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64430539] [2019-10-15 01:04:16,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:04:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:04:16,790 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-15 01:04:16,791 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-15 01:04:16,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:16 BoogieIcfgContainer [2019-10-15 01:04:16,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:16,871 INFO L168 Benchmark]: Toolchain (without parser) took 2155.30 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.8 MB in the beginning and 94.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,872 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 01:04:16,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.70 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.4 MB in the beginning and 181.6 MB in the end (delta: -78.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,874 INFO L168 Benchmark]: Boogie Preprocessor took 41.35 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 179.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,875 INFO L168 Benchmark]: RCFGBuilder took 491.62 ms. Allocated memory is still 203.4 MB. Free memory was 179.7 MB in the beginning and 155.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,876 INFO L168 Benchmark]: TraceAbstraction took 1227.95 ms. Allocated memory is still 203.4 MB. Free memory was 155.7 MB in the beginning and 94.9 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,880 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.18 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 389.70 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.4 MB in the beginning and 181.6 MB in the end (delta: -78.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.35 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 179.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 491.62 ms. Allocated memory is still 203.4 MB. Free memory was 179.7 MB in the beginning and 155.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1227.95 ms. Allocated memory is still 203.4 MB. Free memory was 155.7 MB in the beginning and 94.9 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 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. Result: UNSAFE, OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 488 SDtfs, 243 SDslu, 321 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 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 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.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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...