./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c9c8a757 Calling Ultimate with: /usr/bin/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --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(valid-memtrack) --- Real Ultimate output --- This is Ultimate 0.1.24-c9c8a75 [2019-11-28 10:04:37,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:04:37,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:04:37,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:04:37,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:04:37,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:04:37,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:04:37,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:04:37,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:04:37,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:04:37,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:04:37,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:04:37,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:04:37,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:04:37,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:04:37,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:04:37,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:04:37,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:04:37,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:04:37,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:04:37,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:04:37,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:04:37,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:04:37,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:04:37,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:04:37,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:04:37,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:04:37,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:04:37,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:04:37,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:04:37,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:04:37,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:04:37,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:04:37,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:04:37,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:04:37,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:04:37,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:04:37,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:04:37,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:04:37,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:04:37,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:04:37,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 10:04:37,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:04:37,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:04:37,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:04:37,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:04:37,421 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:04:37,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:04:37,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:04:37,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:04:37,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:04:37,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:04:37,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:04:37,424 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:04:37,424 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:04:37,424 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:04:37,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:04:37,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:04:37,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:04:37,425 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:04:37,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:04:37,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:04:37,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:04:37,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:04:37,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:04:37,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:04:37,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:04:37,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 10:04:37,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 10:04:37,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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-11-28 10:04:37,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:04:37,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:04:37,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:04:37,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:04:37,815 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:04:37,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2019-11-28 10:04:37,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d06f525/00d4588bfea04eb2ba09549b2be90326/FLAG611bfd65a [2019-11-28 10:04:38,378 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:04:38,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2019-11-28 10:04:38,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d06f525/00d4588bfea04eb2ba09549b2be90326/FLAG611bfd65a [2019-11-28 10:04:38,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d06f525/00d4588bfea04eb2ba09549b2be90326 [2019-11-28 10:04:38,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:04:38,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:04:38,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:04:38,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:04:38,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:04:38,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:04:38" (1/1) ... [2019-11-28 10:04:38,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad95f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:38, skipping insertion in model container [2019-11-28 10:04:38,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:04:38" (1/1) ... [2019-11-28 10:04:38,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:04:38,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:04:39,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:04:39,006 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:04:39,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:04:39,105 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:04:39,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39 WrapperNode [2019-11-28 10:04:39,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:04:39,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:04:39,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:04:39,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:04:39,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (1/1) ... [2019-11-28 10:04:39,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (1/1) ... [2019-11-28 10:04:39,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (1/1) ... [2019-11-28 10:04:39,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (1/1) ... [2019-11-28 10:04:39,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (1/1) ... [2019-11-28 10:04:39,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (1/1) ... [2019-11-28 10:04:39,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (1/1) ... [2019-11-28 10:04:39,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:04:39,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:04:39,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:04:39,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:04:39,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (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-11-28 10:04:39,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:04:39,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:04:39,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:04:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 10:04:39,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:04:39,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:04:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:04:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:04:39,619 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:04:39,619 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 10:04:39,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:04:39 BoogieIcfgContainer [2019-11-28 10:04:39,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:04:39,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:04:39,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:04:39,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:04:39,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:04:38" (1/3) ... [2019-11-28 10:04:39,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5175b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:04:39, skipping insertion in model container [2019-11-28 10:04:39,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:04:39" (2/3) ... [2019-11-28 10:04:39,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5175b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:04:39, skipping insertion in model container [2019-11-28 10:04:39,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:04:39" (3/3) ... [2019-11-28 10:04:39,630 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2019-11-28 10:04:39,640 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:04:39,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 10:04:39,660 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 10:04:39,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:04:39,681 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:04:39,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:04:39,682 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:04:39,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:04:39,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:04:39,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:04:39,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:04:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2019-11-28 10:04:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 10:04:39,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:39,706 INFO L410 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-11-28 10:04:39,707 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:04:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:39,713 INFO L82 PathProgramCache]: Analyzing trace with hash -563352914, now seen corresponding path program 1 times [2019-11-28 10:04:39,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:04:39,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894273266] [2019-11-28 10:04:39,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:04:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:04:39,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894273266] [2019-11-28 10:04:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:39,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:04:39,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301445690] [2019-11-28 10:04:39,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:04:39,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:04:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:04:39,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:04:39,968 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2019-11-28 10:04:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:40,047 INFO L93 Difference]: Finished difference Result 110 states and 196 transitions. [2019-11-28 10:04:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:04:40,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 10:04:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:40,064 INFO L225 Difference]: With dead ends: 110 [2019-11-28 10:04:40,064 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 10:04:40,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:04:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 10:04:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-28 10:04:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 10:04:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 186 transitions. [2019-11-28 10:04:40,136 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 186 transitions. Word has length 25 [2019-11-28 10:04:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:40,137 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 186 transitions. [2019-11-28 10:04:40,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:04:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 186 transitions. [2019-11-28 10:04:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 10:04:40,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:40,142 INFO L410 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-11-28 10:04:40,143 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:04:40,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:40,144 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2019-11-28 10:04:40,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:04:40,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945143702] [2019-11-28 10:04:40,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:04:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:04:40,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945143702] [2019-11-28 10:04:40,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:40,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:04:40,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682722221] [2019-11-28 10:04:40,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:04:40,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:04:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:04:40,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:04:40,262 INFO L87 Difference]: Start difference. First operand 100 states and 186 transitions. Second operand 3 states. [2019-11-28 10:04:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:40,300 INFO L93 Difference]: Finished difference Result 101 states and 187 transitions. [2019-11-28 10:04:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:04:40,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 10:04:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:40,304 INFO L225 Difference]: With dead ends: 101 [2019-11-28 10:04:40,304 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 10:04:40,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:04:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 10:04:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-11-28 10:04:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 10:04:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 187 transitions. [2019-11-28 10:04:40,325 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 187 transitions. Word has length 25 [2019-11-28 10:04:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:40,326 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 187 transitions. [2019-11-28 10:04:40,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:04:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 187 transitions. [2019-11-28 10:04:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 10:04:40,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:40,327 INFO L410 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-11-28 10:04:40,328 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:04:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1737469676, now seen corresponding path program 1 times [2019-11-28 10:04:40,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:04:40,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558278654] [2019-11-28 10:04:40,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:04:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:04:40,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558278654] [2019-11-28 10:04:40,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:40,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:04:40,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143322443] [2019-11-28 10:04:40,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:04:40,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:04:40,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:04:40,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:04:40,416 INFO L87 Difference]: Start difference. First operand 101 states and 187 transitions. Second operand 3 states. [2019-11-28 10:04:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:40,443 INFO L93 Difference]: Finished difference Result 140 states and 254 transitions. [2019-11-28 10:04:40,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:04:40,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 10:04:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:40,446 INFO L225 Difference]: With dead ends: 140 [2019-11-28 10:04:40,446 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 10:04:40,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:04:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 10:04:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-11-28 10:04:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-28 10:04:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 253 transitions. [2019-11-28 10:04:40,460 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 253 transitions. Word has length 25 [2019-11-28 10:04:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:40,462 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 253 transitions. [2019-11-28 10:04:40,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:04:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 253 transitions. [2019-11-28 10:04:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 10:04:40,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:40,466 INFO L410 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-11-28 10:04:40,467 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:04:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2019-11-28 10:04:40,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:04:40,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894762277] [2019-11-28 10:04:40,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:04:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:04:40,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894762277] [2019-11-28 10:04:40,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:40,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 10:04:40,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502825864] [2019-11-28 10:04:40,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:04:40,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 10:04:40,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:04:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:04:40,528 INFO L87 Difference]: Start difference. First operand 138 states and 253 transitions. Second operand 3 states. [2019-11-28 10:04:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:40,564 INFO L93 Difference]: Finished difference Result 138 states and 247 transitions. [2019-11-28 10:04:40,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:04:40,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 10:04:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:40,566 INFO L225 Difference]: With dead ends: 138 [2019-11-28 10:04:40,566 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 10:04:40,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:04:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 10:04:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-11-28 10:04:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 10:04:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 246 transitions. [2019-11-28 10:04:40,576 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 246 transitions. Word has length 25 [2019-11-28 10:04:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:40,576 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 246 transitions. [2019-11-28 10:04:40,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:04:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 246 transitions. [2019-11-28 10:04:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 10:04:40,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:40,578 INFO L410 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-11-28 10:04:40,579 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 10:04:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash 149121774, now seen corresponding path program 1 times [2019-11-28 10:04:40,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 10:04:40,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482223372] [2019-11-28 10:04:40,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 10:04:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 10:04:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 10:04:40,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 10:04:40,670 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 10:04:40,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:04:40 BoogieIcfgContainer [2019-11-28 10:04:40,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 10:04:40,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 10:04:40,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 10:04:40,746 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 10:04:40,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:04:39" (3/4) ... [2019-11-28 10:04:40,748 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 10:04:40,840 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 10:04:40,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 10:04:40,843 INFO L168 Benchmark]: Toolchain (without parser) took 2083.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -44.3 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2019-11-28 10:04:40,844 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:04:40,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 10:04:40,845 INFO L168 Benchmark]: Boogie Preprocessor took 36.94 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 10:04:40,846 INFO L168 Benchmark]: RCFGBuilder took 477.38 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-28 10:04:40,846 INFO L168 Benchmark]: TraceAbstraction took 1122.93 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: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. [2019-11-28 10:04:40,847 INFO L168 Benchmark]: Witness Printer took 94.78 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-11-28 10:04:40,851 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.74 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.94 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 477.38 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1122.93 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: 60.9 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. * Witness Printer took 94.78 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]: not all allocated memory was freed not all allocated memory was freed 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: 0.9s, 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, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s 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...