./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/LexIndexValue-Array-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash b9dfe2826dbd43b76a93fbf593c8a07947a4c894 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:47:03,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:47:03,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:47:03,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:47:03,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:47:03,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:47:03,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:47:03,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:47:03,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:47:03,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:47:03,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:47:03,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:47:03,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:47:03,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:47:03,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:47:03,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:47:03,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:47:03,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:47:03,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:47:03,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:47:03,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:47:03,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:47:03,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:47:03,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:47:03,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:47:03,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:47:03,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:47:03,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:47:03,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:47:03,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:47:03,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:47:03,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:47:03,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:47:03,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:47:03,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:47:03,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:47:03,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:47:03,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:47:03,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:47:03,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:47:03,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:47:03,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-28 02:47:03,225 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:47:03,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:47:03,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:47:03,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:47:03,230 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:47:03,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:47:03,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:47:03,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:47:03,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:47:03,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:47:03,233 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:47:03,233 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:47:03,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:47:03,234 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:47:03,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:47:03,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:47:03,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:47:03,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:47:03,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:47:03,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:47:03,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:47:03,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:47:03,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:47:03,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:47:03,238 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9dfe2826dbd43b76a93fbf593c8a07947a4c894 [2019-11-28 02:47:03,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:47:03,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:47:03,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:47:03,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:47:03,565 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:47:03,565 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2019-11-28 02:47:03,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c2560ae/2289ce7bafd344a986dc6c3c1f339cca/FLAG87d40f2f3 [2019-11-28 02:47:04,101 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:47:04,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2019-11-28 02:47:04,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c2560ae/2289ce7bafd344a986dc6c3c1f339cca/FLAG87d40f2f3 [2019-11-28 02:47:04,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c2560ae/2289ce7bafd344a986dc6c3c1f339cca [2019-11-28 02:47:04,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:47:04,472 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:47:04,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:04,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:47:04,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:47:04,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1748b44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04, skipping insertion in model container [2019-11-28 02:47:04,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:47:04,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:47:04,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:04,677 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:47:04,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:04,723 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:47:04,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04 WrapperNode [2019-11-28 02:47:04,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:04,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:47:04,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:47:04,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:47:04,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (1/1) ... [2019-11-28 02:47:04,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:47:04,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:47:04,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:47:04,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:47:04,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (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:47:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:47:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:47:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:47:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:47:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:47:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:47:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:47:04,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:47:04,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:47:04,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:47:04,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:47:05,215 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:47:05,215 INFO L297 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 02:47:05,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:05 BoogieIcfgContainer [2019-11-28 02:47:05,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:47:05,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:47:05,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:47:05,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:47:05,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:04" (1/3) ... [2019-11-28 02:47:05,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5a103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:05, skipping insertion in model container [2019-11-28 02:47:05,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:04" (2/3) ... [2019-11-28 02:47:05,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd5a103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:05, skipping insertion in model container [2019-11-28 02:47:05,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:05" (3/3) ... [2019-11-28 02:47:05,224 INFO L109 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Array-1.c [2019-11-28 02:47:05,234 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:47:05,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-11-28 02:47:05,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-11-28 02:47:05,274 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:47:05,275 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:47:05,275 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:47:05,275 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:47:05,275 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:47:05,275 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:47:05,275 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:47:05,276 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:47:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-11-28 02:47:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:47:05,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:05,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:05,300 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1038673271, now seen corresponding path program 1 times [2019-11-28 02:47:05,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:05,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943884006] [2019-11-28 02:47:05,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,543 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:47:05,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943884006] [2019-11-28 02:47:05,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:05,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:05,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422670993] [2019-11-28 02:47:05,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:05,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:05,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:05,566 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2019-11-28 02:47:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:05,695 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-28 02:47:05,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:05,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:47:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:05,707 INFO L225 Difference]: With dead ends: 39 [2019-11-28 02:47:05,707 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:47:05,709 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:47:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:47:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-28 02:47:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 02:47:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-28 02:47:05,749 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 8 [2019-11-28 02:47:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:05,750 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-28 02:47:05,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-28 02:47:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:47:05,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:05,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:05,751 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:05,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1038673272, now seen corresponding path program 1 times [2019-11-28 02:47:05,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:05,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962136863] [2019-11-28 02:47:05,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:05,816 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:47:05,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962136863] [2019-11-28 02:47:05,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:05,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:05,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180306293] [2019-11-28 02:47:05,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:05,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:05,822 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-11-28 02:47:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:05,913 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-11-28 02:47:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:05,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:47:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:05,915 INFO L225 Difference]: With dead ends: 29 [2019-11-28 02:47:05,915 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 02:47:05,916 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:47:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 02:47:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 02:47:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 02:47:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-28 02:47:05,928 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2019-11-28 02:47:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:05,928 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-28 02:47:05,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-28 02:47:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:47:05,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:05,930 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:05,930 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1416659532, now seen corresponding path program 1 times [2019-11-28 02:47:05,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:05,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138872508] [2019-11-28 02:47:05,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:06,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138872508] [2019-11-28 02:47:06,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085934421] [2019-11-28 02:47:06,084 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:47:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:47:06,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:06,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:47:06,200 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:06,209 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:06,209 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:06,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 02:47:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:06,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:06,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-11-28 02:47:06,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812944754] [2019-11-28 02:47:06,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:06,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:06,225 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2019-11-28 02:47:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:06,326 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-11-28 02:47:06,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:06,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:47:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:06,328 INFO L225 Difference]: With dead ends: 35 [2019-11-28 02:47:06,328 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 02:47:06,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 02:47:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 02:47:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 02:47:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-11-28 02:47:06,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2019-11-28 02:47:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:06,335 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-11-28 02:47:06,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-11-28 02:47:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:47:06,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:06,336 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:06,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:06,541 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash -931508081, now seen corresponding path program 2 times [2019-11-28 02:47:06,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:06,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560006010] [2019-11-28 02:47:06,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:06,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560006010] [2019-11-28 02:47:06,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445492412] [2019-11-28 02:47:06,699 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:47:06,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:47:06,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:06,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:47:06,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:06,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:47:06,764 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:06,775 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:06,776 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:06,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 02:47:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:06,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:06,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-28 02:47:06,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031087974] [2019-11-28 02:47:06,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:06,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:06,876 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 6 states. [2019-11-28 02:47:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:06,930 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-28 02:47:06,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:06,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 02:47:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:06,932 INFO L225 Difference]: With dead ends: 34 [2019-11-28 02:47:06,932 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 02:47:06,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 02:47:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-11-28 02:47:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 02:47:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-28 02:47:06,938 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2019-11-28 02:47:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:06,938 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-28 02:47:06,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-28 02:47:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:47:06,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:06,940 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:07,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:07,144 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:07,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1826117314, now seen corresponding path program 1 times [2019-11-28 02:47:07,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:07,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521016006] [2019-11-28 02:47:07,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:07,222 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:47:07,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521016006] [2019-11-28 02:47:07,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595109422] [2019-11-28 02:47:07,224 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:47:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:07,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:47:07,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:07,281 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:47:07,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:07,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 02:47:07,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99238594] [2019-11-28 02:47:07,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:07,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:07,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:07,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:07,284 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-11-28 02:47:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:07,350 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-28 02:47:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:07,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 02:47:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:07,352 INFO L225 Difference]: With dead ends: 38 [2019-11-28 02:47:07,352 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 02:47:07,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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:47:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 02:47:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-11-28 02:47:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 02:47:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-28 02:47:07,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 18 [2019-11-28 02:47:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:07,359 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-28 02:47:07,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-28 02:47:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:47:07,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:07,360 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:07,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:07,564 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:07,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash 945846593, now seen corresponding path program 2 times [2019-11-28 02:47:07,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:07,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308318717] [2019-11-28 02:47:07,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:07,650 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:47:07,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308318717] [2019-11-28 02:47:07,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18768949] [2019-11-28 02:47:07,655 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:47:07,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:47:07,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:07,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:47:07,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:07,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:47:07,702 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,709 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,710 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 02:47:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:47:07,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:07,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2019-11-28 02:47:07,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301445690] [2019-11-28 02:47:07,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:47:07,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:07,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:47:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:07,747 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2019-11-28 02:47:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:07,786 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-11-28 02:47:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:47:07,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:47:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:07,787 INFO L225 Difference]: With dead ends: 46 [2019-11-28 02:47:07,788 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 02:47:07,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 02:47:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-11-28 02:47:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:47:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-11-28 02:47:07,803 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 22 [2019-11-28 02:47:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:07,804 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-28 02:47:07,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:47:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-11-28 02:47:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:47:07,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:07,806 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:08,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:08,008 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:08,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1574303516, now seen corresponding path program 1 times [2019-11-28 02:47:08,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:08,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693518928] [2019-11-28 02:47:08,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:47:08,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693518928] [2019-11-28 02:47:08,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:08,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:47:08,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421432995] [2019-11-28 02:47:08,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:08,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:08,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:08,067 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2019-11-28 02:47:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:08,137 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-11-28 02:47:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:08,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 02:47:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:08,139 INFO L225 Difference]: With dead ends: 48 [2019-11-28 02:47:08,139 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 02:47:08,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:47:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 02:47:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-28 02:47:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:47:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-11-28 02:47:08,145 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2019-11-28 02:47:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:08,145 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-11-28 02:47:08,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-11-28 02:47:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:47:08,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:08,146 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:08,147 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:08,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1258071097, now seen corresponding path program 1 times [2019-11-28 02:47:08,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:08,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563086702] [2019-11-28 02:47:08,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,208 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:47:08,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563086702] [2019-11-28 02:47:08,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898436039] [2019-11-28 02:47:08,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:47:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:47:08,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:08,278 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:47:08,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:08,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 02:47:08,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662741991] [2019-11-28 02:47:08,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:47:08,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:08,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:47:08,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:08,281 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 8 states. [2019-11-28 02:47:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:08,357 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-28 02:47:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:08,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-28 02:47:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:08,359 INFO L225 Difference]: With dead ends: 52 [2019-11-28 02:47:08,359 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 02:47:08,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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:47:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 02:47:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-28 02:47:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:47:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-28 02:47:08,365 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 26 [2019-11-28 02:47:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:08,365 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-28 02:47:08,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:47:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-28 02:47:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:47:08,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:08,367 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:08,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:08,576 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:08,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash -113674038, now seen corresponding path program 2 times [2019-11-28 02:47:08,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:08,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823494174] [2019-11-28 02:47:08,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:08,663 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:47:08,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823494174] [2019-11-28 02:47:08,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929552002] [2019-11-28 02:47:08,664 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:47:08,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:47:08,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:08,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:47:08,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 02:47:08,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:08,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-11-28 02:47:08,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573252702] [2019-11-28 02:47:08,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:08,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:08,781 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2019-11-28 02:47:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:08,824 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-11-28 02:47:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:08,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 02:47:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:08,826 INFO L225 Difference]: With dead ends: 48 [2019-11-28 02:47:08,826 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 02:47:08,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 02:47:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-28 02:47:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:47:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-28 02:47:08,833 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 30 [2019-11-28 02:47:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:08,833 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-28 02:47:08,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-28 02:47:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:47:08,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:08,835 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:09,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:09,043 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1865200645, now seen corresponding path program 1 times [2019-11-28 02:47:09,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:09,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30098562] [2019-11-28 02:47:09,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:47:09,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30098562] [2019-11-28 02:47:09,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881394367] [2019-11-28 02:47:09,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:47:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:47:09,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:47:09,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:09,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-28 02:47:09,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963812360] [2019-11-28 02:47:09,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:09,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:09,217 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2019-11-28 02:47:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:09,307 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-11-28 02:47:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:09,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-11-28 02:47:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:09,308 INFO L225 Difference]: With dead ends: 53 [2019-11-28 02:47:09,308 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 02:47:09,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 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:47:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 02:47:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-28 02:47:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:47:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 02:47:09,316 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2019-11-28 02:47:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:09,317 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 02:47:09,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 02:47:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 02:47:09,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:09,322 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:09,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:09,526 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash 133323454, now seen corresponding path program 2 times [2019-11-28 02:47:09,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:09,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884483254] [2019-11-28 02:47:09,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:47:09,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884483254] [2019-11-28 02:47:09,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51822533] [2019-11-28 02:47:09,643 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 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:47:09,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:47:09,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:09,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:47:09,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:47:09,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:09,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-28 02:47:09,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400547606] [2019-11-28 02:47:09,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:47:09,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:09,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:47:09,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:09,706 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2019-11-28 02:47:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:09,767 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-28 02:47:09,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:09,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-28 02:47:09,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:09,768 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:47:09,768 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 02:47:09,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 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:47:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 02:47:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-11-28 02:47:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:47:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-28 02:47:09,773 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 36 [2019-11-28 02:47:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:09,773 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-28 02:47:09,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:47:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-28 02:47:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 02:47:09,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:09,775 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:09,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:09,978 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:47:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:09,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1483321343, now seen corresponding path program 3 times [2019-11-28 02:47:09,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:09,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941152969] [2019-11-28 02:47:09,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:47:10,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941152969] [2019-11-28 02:47:10,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921846957] [2019-11-28 02:47:10,065 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 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:47:10,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 02:47:10,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:10,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:47:10,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:10,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:47:10,124 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:10,131 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:10,132 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:10,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 02:47:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-28 02:47:10,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:10,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2019-11-28 02:47:10,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787918494] [2019-11-28 02:47:10,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:10,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:10,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:10,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:10,225 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2019-11-28 02:47:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:10,306 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-28 02:47:10,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:10,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-28 02:47:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:10,307 INFO L225 Difference]: With dead ends: 54 [2019-11-28 02:47:10,307 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:47:10,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:47:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:47:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:47:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:47:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:47:10,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-11-28 02:47:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:10,309 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:47:10,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:47:10,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:47:10,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:10,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:47:10 BoogieIcfgContainer [2019-11-28 02:47:10,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:47:10,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:47:10,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:47:10,518 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:47:10,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:05" (3/4) ... [2019-11-28 02:47:10,522 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:47:10,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:47:10,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:47:10,544 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 02:47:10,544 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-28 02:47:10,544 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:47:10,545 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:47:10,590 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:47:10,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:47:10,592 INFO L168 Benchmark]: Toolchain (without parser) took 6120.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 71.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:10,592 INFO L168 Benchmark]: CDTParser took 0.18 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:47:10,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.33 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:47:10,593 INFO L168 Benchmark]: Boogie Preprocessor took 104.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:10,594 INFO L168 Benchmark]: RCFGBuilder took 387.15 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.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:10,594 INFO L168 Benchmark]: TraceAbstraction took 5299.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:10,595 INFO L168 Benchmark]: Witness Printer took 72.85 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:10,598 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.33 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 104.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 387.15 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.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5299.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. * Witness Printer took 72.85 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: 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: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 9 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 268 SDtfs, 159 SDslu, 585 SDs, 0 SdLazy, 555 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 24 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 504 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 483 ConstructedInterpolants, 1 QuantifiedInterpolants, 58570 SizeOfPredicates, 5 NumberOfNonLiveVariables, 661 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 150/459 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 correct! Received shutdown request...