./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab 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/memsafety-ext3/freeAlloca.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 bd24d7b29a77a6b0da9f8cbc1fae4e00216bc104 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:46:32,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:32,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:32,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:32,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:32,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:32,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:32,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:33,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:33,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:33,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:33,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:33,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:33,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:33,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:33,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:33,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:33,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:33,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:33,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:33,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:33,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:33,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:33,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:33,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:33,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:33,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:33,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:33,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:33,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:33,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:33,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:33,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:33,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:33,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:33,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:33,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:33,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:33,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:33,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:33,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:33,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:46:33,062 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:33,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:33,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:33,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:33,065 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:33,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:33,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:33,065 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:33,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:33,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:33,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:33,067 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:33,067 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:33,067 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:33,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:33,068 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:33,068 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:33,068 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:33,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:33,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:33,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:33,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:33,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:33,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:33,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:33,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:33,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:33,073 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 -> bd24d7b29a77a6b0da9f8cbc1fae4e00216bc104 [2019-11-28 02:46:33,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:33,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:33,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:33,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:33,411 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:33,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2019-11-28 02:46:33,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b954ef6/4d9bce3411cc45608e057fe741539dea/FLAGae0e62b1e [2019-11-28 02:46:33,953 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:33,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2019-11-28 02:46:33,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b954ef6/4d9bce3411cc45608e057fe741539dea/FLAGae0e62b1e [2019-11-28 02:46:34,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b954ef6/4d9bce3411cc45608e057fe741539dea [2019-11-28 02:46:34,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:34,331 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:34,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:34,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:34,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:34,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42887913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34, skipping insertion in model container [2019-11-28 02:46:34,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:34,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:34,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:34,562 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:34,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:34,594 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:34,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34 WrapperNode [2019-11-28 02:46:34,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:34,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:34,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:34,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:34,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (1/1) ... [2019-11-28 02:46:34,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:34,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:34,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:34,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:34,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (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 02:46:34,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:34,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:34,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 02:46:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 02:46:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 02:46:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:46:34,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:46:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:46:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:46:34,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:34,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:35,036 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:35,036 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:35,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:35 BoogieIcfgContainer [2019-11-28 02:46:35,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:35,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:35,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:35,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:35,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:34" (1/3) ... [2019-11-28 02:46:35,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d263595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:35, skipping insertion in model container [2019-11-28 02:46:35,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:34" (2/3) ... [2019-11-28 02:46:35,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d263595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:35, skipping insertion in model container [2019-11-28 02:46:35,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:35" (3/3) ... [2019-11-28 02:46:35,050 INFO L109 eAbstractionObserver]: Analyzing ICFG freeAlloca.c [2019-11-28 02:46:35,063 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:35,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 02:46:35,081 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 02:46:35,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:35,101 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:35,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:35,101 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:35,101 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:35,102 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:35,102 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:35,102 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 02:46:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:35,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:35,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:35,131 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:35,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash 996996062, now seen corresponding path program 1 times [2019-11-28 02:46:35,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:35,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925757345] [2019-11-28 02:46:35,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:35,332 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 02:46:35,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925757345] [2019-11-28 02:46:35,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:35,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:35,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272122956] [2019-11-28 02:46:35,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:35,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:35,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:35,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:35,368 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-11-28 02:46:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:35,523 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-28 02:46:35,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:35,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 02:46:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:35,539 INFO L225 Difference]: With dead ends: 28 [2019-11-28 02:46:35,539 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 02:46:35,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 02:46:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 02:46:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 02:46:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:46:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-28 02:46:35,597 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 8 [2019-11-28 02:46:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:35,599 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 02:46:35,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-11-28 02:46:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:35,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:35,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:35,601 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash 996995752, now seen corresponding path program 1 times [2019-11-28 02:46:35,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:35,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160677686] [2019-11-28 02:46:35,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:35,690 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 02:46:35,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160677686] [2019-11-28 02:46:35,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:35,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:46:35,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799316204] [2019-11-28 02:46:35,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:35,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:35,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:35,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:35,694 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 4 states. [2019-11-28 02:46:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:35,773 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-11-28 02:46:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:35,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:46:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:35,775 INFO L225 Difference]: With dead ends: 31 [2019-11-28 02:46:35,775 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 02:46:35,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 02:46:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-11-28 02:46:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 02:46:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 02:46:35,782 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 8 [2019-11-28 02:46:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:35,782 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 02:46:35,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 02:46:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:35,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:35,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:35,784 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash 996995806, now seen corresponding path program 1 times [2019-11-28 02:46:35,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:35,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655061648] [2019-11-28 02:46:35,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:35,911 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 02:46:35,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655061648] [2019-11-28 02:46:35,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:35,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:35,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688982157] [2019-11-28 02:46:35,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:35,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:35,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:35,919 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2019-11-28 02:46:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:36,007 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 02:46:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:36,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:46:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:36,009 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:46:36,009 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 02:46:36,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 02:46:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-28 02:46:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:46:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-28 02:46:36,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2019-11-28 02:46:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:36,016 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-28 02:46:36,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-28 02:46:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:36,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:36,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:36,018 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:36,019 INFO L82 PathProgramCache]: Analyzing trace with hash 996995805, now seen corresponding path program 1 times [2019-11-28 02:46:36,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:36,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914250396] [2019-11-28 02:46:36,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,064 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 02:46:36,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914250396] [2019-11-28 02:46:36,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:36,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:36,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584935106] [2019-11-28 02:46:36,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:36,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:36,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:36,067 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2019-11-28 02:46:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:36,146 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-28 02:46:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:36,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:46:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:36,148 INFO L225 Difference]: With dead ends: 25 [2019-11-28 02:46:36,148 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 02:46:36,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 02:46:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-28 02:46:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:46:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-28 02:46:36,158 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2019-11-28 02:46:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:36,159 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-28 02:46:36,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-28 02:46:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:46:36,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:36,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:36,162 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:36,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash 63449068, now seen corresponding path program 1 times [2019-11-28 02:46:36,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:36,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963927017] [2019-11-28 02:46:36,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:46:36,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963927017] [2019-11-28 02:46:36,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:36,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:36,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753484953] [2019-11-28 02:46:36,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:36,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:36,282 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 4 states. [2019-11-28 02:46:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:36,337 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-28 02:46:36,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:36,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:46:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:36,339 INFO L225 Difference]: With dead ends: 22 [2019-11-28 02:46:36,339 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 02:46:36,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 02:46:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 02:46:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 02:46:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-28 02:46:36,347 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2019-11-28 02:46:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:36,348 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-28 02:46:36,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:36,348 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-28 02:46:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:46:36,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:36,349 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:36,350 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:36,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash 63449121, now seen corresponding path program 1 times [2019-11-28 02:46:36,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:36,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76612997] [2019-11-28 02:46:36,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:36,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76612997] [2019-11-28 02:46:36,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:36,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:46:36,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51349548] [2019-11-28 02:46:36,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:46:36,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:36,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:46:36,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:36,489 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2019-11-28 02:46:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:36,562 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-28 02:46:36,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:36,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 02:46:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:36,563 INFO L225 Difference]: With dead ends: 23 [2019-11-28 02:46:36,563 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 02:46:36,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 02:46:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-28 02:46:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 02:46:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 02:46:36,568 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2019-11-28 02:46:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:36,568 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 02:46:36,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:46:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 02:46:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:46:36,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:36,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:36,570 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash 425550780, now seen corresponding path program 1 times [2019-11-28 02:46:36,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:36,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843131188] [2019-11-28 02:46:36,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:36,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843131188] [2019-11-28 02:46:36,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263537547] [2019-11-28 02:46:36,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:36,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:46:36,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:36,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:36,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 02:46:36,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070105030] [2019-11-28 02:46:36,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:46:36,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:46:36,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:36,737 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2019-11-28 02:46:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:36,783 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 02:46:36,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:36,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 02:46:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:36,785 INFO L225 Difference]: With dead ends: 27 [2019-11-28 02:46:36,785 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 02:46:36,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 02:46:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-11-28 02:46:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:46:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-28 02:46:36,789 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2019-11-28 02:46:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:36,790 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-28 02:46:36,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:46:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-28 02:46:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:36,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:36,791 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:36,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:36,993 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash 316362009, now seen corresponding path program 2 times [2019-11-28 02:46:36,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:36,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746288901] [2019-11-28 02:46:36,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:37,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746288901] [2019-11-28 02:46:37,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969063472] [2019-11-28 02:46:37,079 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:37,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:46:37,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:37,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:46:37,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:46:37,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:37,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-11-28 02:46:37,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699033349] [2019-11-28 02:46:37,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:37,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:37,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:37,235 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2019-11-28 02:46:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:37,294 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-28 02:46:37,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:37,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 02:46:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:37,296 INFO L225 Difference]: With dead ends: 26 [2019-11-28 02:46:37,296 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 02:46:37,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 02:46:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 02:46:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:46:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-11-28 02:46:37,308 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2019-11-28 02:46:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:37,309 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-11-28 02:46:37,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-11-28 02:46:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:37,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:37,312 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:37,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:37,514 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:37,514 INFO L82 PathProgramCache]: Analyzing trace with hash 316354064, now seen corresponding path program 1 times [2019-11-28 02:46:37,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:37,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701019724] [2019-11-28 02:46:37,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:37,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701019724] [2019-11-28 02:46:37,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518310539] [2019-11-28 02:46:37,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:46:37,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:37,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:37,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 02:46:37,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329359051] [2019-11-28 02:46:37,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:46:37,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:37,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:46:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:37,644 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2019-11-28 02:46:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:37,704 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-11-28 02:46:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:46:37,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 02:46:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:37,705 INFO L225 Difference]: With dead ends: 31 [2019-11-28 02:46:37,705 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 02:46:37,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:46:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 02:46:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-11-28 02:46:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:46:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-11-28 02:46:37,710 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-11-28 02:46:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:37,710 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-11-28 02:46:37,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:46:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-11-28 02:46:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:37,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:37,712 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:37,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:37,916 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash -564453139, now seen corresponding path program 2 times [2019-11-28 02:46:37,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:37,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524508555] [2019-11-28 02:46:37,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:37,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524508555] [2019-11-28 02:46:37,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887226274] [2019-11-28 02:46:38,000 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:38,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:46:38,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:38,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:46:38,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:38,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:38,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 02:46:38,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156116531] [2019-11-28 02:46:38,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:38,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:38,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:38,069 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2019-11-28 02:46:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:38,139 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-11-28 02:46:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:46:38,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 02:46:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:38,143 INFO L225 Difference]: With dead ends: 35 [2019-11-28 02:46:38,144 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 02:46:38,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:46:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 02:46:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-11-28 02:46:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 02:46:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-11-28 02:46:38,154 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2019-11-28 02:46:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:38,155 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-11-28 02:46:38,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-11-28 02:46:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:46:38,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:38,156 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:38,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:38,360 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:38,361 INFO L82 PathProgramCache]: Analyzing trace with hash 817651018, now seen corresponding path program 3 times [2019-11-28 02:46:38,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:38,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122948406] [2019-11-28 02:46:38,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:38,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122948406] [2019-11-28 02:46:38,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971350106] [2019-11-28 02:46:38,515 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:38,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 02:46:38,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:38,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:46:38,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:38,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:38,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-28 02:46:38,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345179674] [2019-11-28 02:46:38,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:46:38,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:38,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:46:38,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:38,601 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2019-11-28 02:46:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:38,674 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-11-28 02:46:38,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:46:38,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-28 02:46:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:38,676 INFO L225 Difference]: With dead ends: 39 [2019-11-28 02:46:38,676 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 02:46:38,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 02:46:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 02:46:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 02:46:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-11-28 02:46:38,685 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-11-28 02:46:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:38,685 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-11-28 02:46:38,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:46:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-11-28 02:46:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:46:38,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:38,687 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:38,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:38,888 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1120001241, now seen corresponding path program 4 times [2019-11-28 02:46:38,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:38,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950263470] [2019-11-28 02:46:38,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:38,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950263470] [2019-11-28 02:46:38,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649936345] [2019-11-28 02:46:38,978 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:39,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:46:39,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:39,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:46:39,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:39,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:39,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-28 02:46:39,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809885853] [2019-11-28 02:46:39,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:46:39,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:46:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:39,047 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 10 states. [2019-11-28 02:46:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:39,122 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-11-28 02:46:39,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:46:39,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-28 02:46:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:39,124 INFO L225 Difference]: With dead ends: 43 [2019-11-28 02:46:39,124 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 02:46:39,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:46:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 02:46:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-28 02:46:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:46:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-11-28 02:46:39,134 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2019-11-28 02:46:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:39,134 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-11-28 02:46:39,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:46:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-11-28 02:46:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:46:39,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:39,136 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:39,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:39,345 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash 92254852, now seen corresponding path program 5 times [2019-11-28 02:46:39,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:39,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887002901] [2019-11-28 02:46:39,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:39,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887002901] [2019-11-28 02:46:39,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519811181] [2019-11-28 02:46:39,483 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:39,565 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-28 02:46:39,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:39,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:46:39,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:39,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:39,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-28 02:46:39,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827872] [2019-11-28 02:46:39,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:46:39,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:46:39,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:39,597 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2019-11-28 02:46:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:39,690 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-11-28 02:46:39,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:46:39,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-28 02:46:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:39,691 INFO L225 Difference]: With dead ends: 47 [2019-11-28 02:46:39,692 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 02:46:39,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:46:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 02:46:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-11-28 02:46:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 02:46:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-11-28 02:46:39,696 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-11-28 02:46:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:39,697 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-11-28 02:46:39,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:46:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-11-28 02:46:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 02:46:39,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:39,698 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:39,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:39,899 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:39,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash 696273761, now seen corresponding path program 6 times [2019-11-28 02:46:39,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:39,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667338307] [2019-11-28 02:46:39,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:40,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667338307] [2019-11-28 02:46:40,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456749171] [2019-11-28 02:46:40,003 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:40,059 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-28 02:46:40,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:40,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:46:40,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:40,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:40,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-11-28 02:46:40,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724632161] [2019-11-28 02:46:40,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:46:40,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:40,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:46:40,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:40,084 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 12 states. [2019-11-28 02:46:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:40,151 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-11-28 02:46:40,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:46:40,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-11-28 02:46:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:40,153 INFO L225 Difference]: With dead ends: 51 [2019-11-28 02:46:40,153 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 02:46:40,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 02:46:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 02:46:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:46:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-11-28 02:46:40,158 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 39 [2019-11-28 02:46:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:40,159 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-11-28 02:46:40,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:46:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-11-28 02:46:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:46:40,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:40,160 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:40,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:40,365 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:40,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1214304834, now seen corresponding path program 7 times [2019-11-28 02:46:40,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:40,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181298055] [2019-11-28 02:46:40,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:40,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181298055] [2019-11-28 02:46:40,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314117734] [2019-11-28 02:46:40,481 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:46:40,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:40,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:40,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-28 02:46:40,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938636046] [2019-11-28 02:46:40,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:46:40,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:40,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:46:40,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:40,551 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 13 states. [2019-11-28 02:46:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:40,627 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-11-28 02:46:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:46:40,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-28 02:46:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:40,628 INFO L225 Difference]: With dead ends: 55 [2019-11-28 02:46:40,628 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 02:46:40,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:46:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 02:46:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-11-28 02:46:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:46:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-11-28 02:46:40,633 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-11-28 02:46:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:40,634 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-11-28 02:46:40,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:46:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-11-28 02:46:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 02:46:40,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:40,636 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:40,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:40,844 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2090572187, now seen corresponding path program 8 times [2019-11-28 02:46:40,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:40,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918939305] [2019-11-28 02:46:40,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:40,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918939305] [2019-11-28 02:46:40,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522187568] [2019-11-28 02:46:40,977 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:41,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:46:41,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:46:41,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:46:41,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:41,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:41,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-11-28 02:46:41,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164118652] [2019-11-28 02:46:41,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:46:41,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:41,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:46:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:46:41,055 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 14 states. [2019-11-28 02:46:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:41,143 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-28 02:46:41,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:46:41,143 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-28 02:46:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:41,144 INFO L225 Difference]: With dead ends: 56 [2019-11-28 02:46:41,144 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 02:46:41,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:46:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 02:46:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 02:46:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 02:46:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-11-28 02:46:41,151 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 47 [2019-11-28 02:46:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:41,151 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-11-28 02:46:41,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:46:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-11-28 02:46:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 02:46:41,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:41,152 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:41,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:41,359 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 02:46:41,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:41,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1402261240, now seen corresponding path program 9 times [2019-11-28 02:46:41,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:41,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900143092] [2019-11-28 02:46:41,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:46:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:46:41,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:46:41,431 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:46:41,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:41 BoogieIcfgContainer [2019-11-28 02:46:41,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:41,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:41,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:41,470 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:41,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:35" (3/4) ... [2019-11-28 02:46:41,473 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:46:41,532 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:41,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:41,534 INFO L168 Benchmark]: Toolchain (without parser) took 7203.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -52.1 MB). Peak memory consumption was 152.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:41,540 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:41,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.91 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:41,541 INFO L168 Benchmark]: Boogie Preprocessor took 90.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:41,541 INFO L168 Benchmark]: RCFGBuilder took 352.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:41,542 INFO L168 Benchmark]: TraceAbstraction took 6430.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.7 MB). Peak memory consumption was 160.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:41,543 INFO L168 Benchmark]: Witness Printer took 62.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:41,550 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.91 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 352.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6430.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.7 MB). Peak memory consumption was 160.8 MB. Max. memory is 11.5 GB. * Witness Printer took 62.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L7] char *p = alloca(10 * sizeof(char)); [L9] int i = 0; VAL [alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L9] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L13] EXPR p[2] VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}, p[2]=97] [L13] COND TRUE p[2] == 'a' [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 8 error locations. Result: UNSAFE, OverallTime: 6.3s, OverallIterations: 17, TraceHistogramMax: 10, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 235 SDslu, 783 SDs, 0 SdLazy, 697 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 36 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 703 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 626 ConstructedInterpolants, 1 QuantifiedInterpolants, 53253 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1018 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 9/1065 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...