./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4892275a211cad54ffe3d940980c258aec58e47d .............................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:24:36,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:24:36,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:24:36,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:24:36,449 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:24:36,450 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:24:36,451 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:24:36,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:24:36,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:24:36,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:24:36,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:24:36,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:24:36,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:24:36,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:24:36,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:24:36,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:24:36,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:24:36,465 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:24:36,467 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:24:36,469 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:24:36,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:24:36,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:24:36,474 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:24:36,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:24:36,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:24:36,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:24:36,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:24:36,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:24:36,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:24:36,481 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:24:36,481 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:24:36,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:24:36,482 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:24:36,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:24:36,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:24:36,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:24:36,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:24:36,513 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:24:36,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:24:36,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:24:36,516 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:24:36,516 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:24:36,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:24:36,516 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:24:36,516 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:24:36,518 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:24:36,518 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:24:36,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:24:36,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:24:36,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:24:36,518 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:24:36,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:24:36,519 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:24:36,519 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:24:36,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:24:36,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:24:36,520 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:24:36,521 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:24:36,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:24:36,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:24:36,521 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:24:36,522 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:24:36,522 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:24:36,522 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:24:36,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:24:36,522 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4892275a211cad54ffe3d940980c258aec58e47d [2019-01-11 21:24:36,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:24:36,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:24:36,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:24:36,598 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:24:36,599 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:24:36,600 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:24:36,656 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916f6e50a/85a6e82371c94b48843e1db192c3013c/FLAGd4b71c8d4 [2019-01-11 21:24:37,134 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:24:37,135 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:24:37,146 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916f6e50a/85a6e82371c94b48843e1db192c3013c/FLAGd4b71c8d4 [2019-01-11 21:24:37,483 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916f6e50a/85a6e82371c94b48843e1db192c3013c [2019-01-11 21:24:37,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:24:37,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:24:37,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:24:37,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:24:37,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:24:37,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:37,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37, skipping insertion in model container [2019-01-11 21:24:37,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:37,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:24:37,531 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:24:37,728 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:24:37,734 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:24:37,804 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:24:37,823 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:24:37,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37 WrapperNode [2019-01-11 21:24:37,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:24:37,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:24:37,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:24:37,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:24:37,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:37,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:37,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:24:37,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:24:37,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:24:37,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:24:37,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:37,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:37,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:37,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:37,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:38,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:38,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (1/1) ... [2019-01-11 21:24:38,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:24:38,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:24:38,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:24:38,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:24:38,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (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-01-11 21:24:38,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:24:38,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:24:38,716 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:24:38,716 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 21:24:38,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:38 BoogieIcfgContainer [2019-01-11 21:24:38,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:24:38,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:24:38,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:24:38,722 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:24:38,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:24:37" (1/3) ... [2019-01-11 21:24:38,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8783ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:24:38, skipping insertion in model container [2019-01-11 21:24:38,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:37" (2/3) ... [2019-01-11 21:24:38,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8783ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:24:38, skipping insertion in model container [2019-01-11 21:24:38,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:38" (3/3) ... [2019-01-11 21:24:38,726 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_false-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:24:38,736 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:24:38,744 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:24:38,759 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:24:38,791 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:24:38,792 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:24:38,792 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:24:38,792 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:24:38,792 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:24:38,792 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:24:38,793 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:24:38,793 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:24:38,793 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:24:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-01-11 21:24:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:24:38,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:38,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:38,819 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1323184238, now seen corresponding path program 1 times [2019-01-11 21:24:38,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:38,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:38,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:39,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:39,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:39,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:39,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:39,077 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2019-01-11 21:24:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:39,174 INFO L93 Difference]: Finished difference Result 159 states and 299 transitions. [2019-01-11 21:24:39,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:39,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:24:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:39,188 INFO L225 Difference]: With dead ends: 159 [2019-01-11 21:24:39,189 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 21:24:39,192 INFO L631 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-01-11 21:24:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 21:24:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-01-11 21:24:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 21:24:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 182 transitions. [2019-01-11 21:24:39,242 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 182 transitions. Word has length 21 [2019-01-11 21:24:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:39,243 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 182 transitions. [2019-01-11 21:24:39,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 182 transitions. [2019-01-11 21:24:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:24:39,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:39,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:39,245 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1323177046, now seen corresponding path program 1 times [2019-01-11 21:24:39,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:39,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:39,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:39,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:39,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:39,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:39,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:39,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:39,321 INFO L87 Difference]: Start difference. First operand 96 states and 182 transitions. Second operand 3 states. [2019-01-11 21:24:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:39,373 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2019-01-11 21:24:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:39,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:24:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:39,377 INFO L225 Difference]: With dead ends: 99 [2019-01-11 21:24:39,377 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 21:24:39,378 INFO L631 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-01-11 21:24:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 21:24:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-11 21:24:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 21:24:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2019-01-11 21:24:39,392 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 21 [2019-01-11 21:24:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:39,393 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2019-01-11 21:24:39,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2019-01-11 21:24:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:24:39,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:39,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:39,395 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash -670960468, now seen corresponding path program 1 times [2019-01-11 21:24:39,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:39,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:39,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:39,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:39,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:39,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:39,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:39,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:39,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:39,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:39,517 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand 3 states. [2019-01-11 21:24:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:39,590 INFO L93 Difference]: Finished difference Result 232 states and 436 transitions. [2019-01-11 21:24:39,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:39,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:24:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:39,598 INFO L225 Difference]: With dead ends: 232 [2019-01-11 21:24:39,598 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 21:24:39,599 INFO L631 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-01-11 21:24:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 21:24:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-01-11 21:24:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 21:24:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 249 transitions. [2019-01-11 21:24:39,614 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 249 transitions. Word has length 21 [2019-01-11 21:24:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:39,614 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 249 transitions. [2019-01-11 21:24:39,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 249 transitions. [2019-01-11 21:24:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:24:39,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:39,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:39,616 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash -670967660, now seen corresponding path program 1 times [2019-01-11 21:24:39,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:39,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:39,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:39,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:39,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:39,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:39,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:39,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:39,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:39,718 INFO L87 Difference]: Start difference. First operand 134 states and 249 transitions. Second operand 3 states. [2019-01-11 21:24:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:39,747 INFO L93 Difference]: Finished difference Result 186 states and 340 transitions. [2019-01-11 21:24:39,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:39,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:24:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:39,750 INFO L225 Difference]: With dead ends: 186 [2019-01-11 21:24:39,750 INFO L226 Difference]: Without dead ends: 134 [2019-01-11 21:24:39,751 INFO L631 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-01-11 21:24:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-11 21:24:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-01-11 21:24:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 21:24:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 242 transitions. [2019-01-11 21:24:39,781 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 242 transitions. Word has length 21 [2019-01-11 21:24:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:39,784 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 242 transitions. [2019-01-11 21:24:39,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 242 transitions. [2019-01-11 21:24:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:24:39,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:39,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:39,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2035658926, now seen corresponding path program 1 times [2019-01-11 21:24:39,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:39,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:39,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:24:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:24:39,916 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:24:39,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:24:39 BoogieIcfgContainer [2019-01-11 21:24:39,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:24:39,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:24:39,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:24:39,958 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:24:39,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:38" (3/4) ... [2019-01-11 21:24:39,961 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:24:40,042 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:24:40,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:24:40,044 INFO L168 Benchmark]: Toolchain (without parser) took 2556.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -62.1 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:40,046 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:24:40,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.41 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:40,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.35 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:40,047 INFO L168 Benchmark]: Boogie Preprocessor took 117.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:40,049 INFO L168 Benchmark]: RCFGBuilder took 704.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:40,050 INFO L168 Benchmark]: TraceAbstraction took 1238.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:40,051 INFO L168 Benchmark]: Witness Printer took 84.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:40,056 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.41 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.35 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 704.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1238.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. * Witness Printer took 84.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 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; [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 [L91] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L99] COND FALSE !(p3 != 0) [L103] COND TRUE p4 != 0 [L104] lk4 = 1 [L107] COND TRUE p5 != 0 [L108] lk5 = 1 [L111] COND TRUE p6 != 0 [L112] lk6 = 1 [L115] COND TRUE p7 != 0 [L116] lk7 = 1 [L119] COND TRUE p8 != 0 [L120] lk8 = 1 [L123] COND TRUE p9 != 0 [L124] lk9 = 1 [L127] COND TRUE p10 != 0 [L128] lk10 = 1 [L131] COND FALSE !(p11 != 0) [L135] COND TRUE p12 != 0 [L136] lk12 = 1 [L139] COND TRUE p13 != 0 [L140] lk13 = 1 [L143] COND TRUE p14 != 0 [L144] lk14 = 1 [L147] COND TRUE p15 != 0 [L148] lk15 = 1 [L153] COND FALSE !(p1 != 0) [L158] COND FALSE !(p2 != 0) [L231] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 471 SDtfs, 244 SDslu, 303 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred 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.3s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 4640 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...