./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:54:13,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:54:13,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:54:13,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:54:13,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:54:13,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:54:13,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:54:13,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:54:13,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:54:13,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:54:13,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:54:13,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:54:13,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:54:13,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:54:13,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:54:13,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:54:13,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:54:13,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:54:13,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:54:13,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:54:13,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:54:13,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:54:13,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:54:13,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:54:13,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:54:13,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:54:13,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:54:13,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:54:13,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:54:13,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:54:13,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:54:13,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:54:13,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:54:13,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:54:13,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:54:13,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:54:13,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:54:13,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:54:13,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:54:13,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:54:13,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:54:13,179 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:54:13,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:54:13,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:54:13,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:54:13,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:54:13,207 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:54:13,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:54:13,208 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:54:13,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:54:13,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:54:13,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:54:13,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:54:13,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:54:13,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:54:13,210 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:54:13,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:54:13,211 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:54:13,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:54:13,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:54:13,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:54:13,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:54:13,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:54:13,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:54:13,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:54:13,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:54:13,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:54:13,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:54:13,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:54:13,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:54:13,215 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-11-27 23:54:13,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:54:13,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:54:13,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:54:13,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:54:13,575 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:54:13,576 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-27 23:54:13,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8404b7c9/0b6bb36cb9c14f8080431082cb580cb3/FLAGa604aecd1 [2019-11-27 23:54:14,234 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:54:14,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-27 23:54:14,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8404b7c9/0b6bb36cb9c14f8080431082cb580cb3/FLAGa604aecd1 [2019-11-27 23:54:14,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8404b7c9/0b6bb36cb9c14f8080431082cb580cb3 [2019-11-27 23:54:14,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:54:14,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:54:14,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:54:14,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:54:14,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:54:14,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:54:14" (1/1) ... [2019-11-27 23:54:14,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29271dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:14, skipping insertion in model container [2019-11-27 23:54:14,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:54:14" (1/1) ... [2019-11-27 23:54:14,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:54:14,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:54:14,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:54:14,988 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:54:15,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:54:15,090 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:54:15,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15 WrapperNode [2019-11-27 23:54:15,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:54:15,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:54:15,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:54:15,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:54:15,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:54:15,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:54:15,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:54:15,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:54:15,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... [2019-11-27 23:54:15,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:54:15,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:54:15,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:54:15,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:54:15,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:54:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:54:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:54:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:54:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:54:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:54:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:54:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:54:15,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:54:15,807 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:54:15,807 INFO L297 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-27 23:54:15,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:15 BoogieIcfgContainer [2019-11-27 23:54:15,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:54:15,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:54:15,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:54:15,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:54:15,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:54:14" (1/3) ... [2019-11-27 23:54:15,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbb4dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:54:15, skipping insertion in model container [2019-11-27 23:54:15,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:54:15" (2/3) ... [2019-11-27 23:54:15,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbb4dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:54:15, skipping insertion in model container [2019-11-27 23:54:15,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:15" (3/3) ... [2019-11-27 23:54:15,817 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-11-27 23:54:15,826 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:54:15,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-27 23:54:15,842 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-27 23:54:15,865 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:54:15,865 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:54:15,865 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:54:15,865 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:54:15,865 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:54:15,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:54:15,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:54:15,866 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:54:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-27 23:54:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-27 23:54:15,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:15,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-27 23:54:15,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-11-27 23:54:15,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:15,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700722762] [2019-11-27 23:54:15,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:16,087 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-27 23:54:16,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700722762] [2019-11-27 23:54:16,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:16,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:54:16,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756181612] [2019-11-27 23:54:16,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:54:16,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:54:16,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:54:16,108 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-27 23:54:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:16,132 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-11-27 23:54:16,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:54:16,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-27 23:54:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:16,145 INFO L225 Difference]: With dead ends: 92 [2019-11-27 23:54:16,145 INFO L226 Difference]: Without dead ends: 41 [2019-11-27 23:54:16,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:54:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-27 23:54:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-27 23:54:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-27 23:54:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-11-27 23:54:16,187 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-11-27 23:54:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:16,188 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-11-27 23:54:16,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:54:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-11-27 23:54:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-27 23:54:16,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:16,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:16,189 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-11-27 23:54:16,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:16,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594251031] [2019-11-27 23:54:16,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:16,280 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-27 23:54:16,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594251031] [2019-11-27 23:54:16,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:16,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:16,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414338440] [2019-11-27 23:54:16,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:16,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:16,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:16,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:16,284 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-11-27 23:54:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:16,426 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-11-27 23:54:16,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:16,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-27 23:54:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:16,428 INFO L225 Difference]: With dead ends: 47 [2019-11-27 23:54:16,430 INFO L226 Difference]: Without dead ends: 45 [2019-11-27 23:54:16,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-27 23:54:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-27 23:54:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-27 23:54:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-27 23:54:16,444 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2019-11-27 23:54:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:16,445 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-27 23:54:16,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-27 23:54:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 23:54:16,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:16,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:16,448 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:16,448 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-11-27 23:54:16,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:16,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237902672] [2019-11-27 23:54:16,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:16,580 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-27 23:54:16,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237902672] [2019-11-27 23:54:16,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:16,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:16,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602352834] [2019-11-27 23:54:16,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:16,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:16,584 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-27 23:54:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:16,675 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-27 23:54:16,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:16,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-27 23:54:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:16,678 INFO L225 Difference]: With dead ends: 39 [2019-11-27 23:54:16,678 INFO L226 Difference]: Without dead ends: 37 [2019-11-27 23:54:16,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-27 23:54:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-27 23:54:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-27 23:54:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-27 23:54:16,685 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2019-11-27 23:54:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:16,686 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-27 23:54:16,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-27 23:54:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:54:16,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:16,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:16,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-11-27 23:54:16,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:16,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915843940] [2019-11-27 23:54:16,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:16,872 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-27 23:54:16,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915843940] [2019-11-27 23:54:16,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:16,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:54:16,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180510339] [2019-11-27 23:54:16,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:54:16,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:16,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:54:16,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:54:16,876 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2019-11-27 23:54:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:17,188 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-11-27 23:54:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:54:17,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-27 23:54:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:17,192 INFO L225 Difference]: With dead ends: 78 [2019-11-27 23:54:17,192 INFO L226 Difference]: Without dead ends: 76 [2019-11-27 23:54:17,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:54:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-27 23:54:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-11-27 23:54:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-27 23:54:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-27 23:54:17,206 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 10 [2019-11-27 23:54:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:17,206 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-27 23:54:17,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:54:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-27 23:54:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:54:17,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:17,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:17,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-11-27 23:54:17,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:17,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153690804] [2019-11-27 23:54:17,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:17,337 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-27 23:54:17,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153690804] [2019-11-27 23:54:17,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:17,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:17,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53054195] [2019-11-27 23:54:17,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:17,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:17,341 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-11-27 23:54:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:17,469 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-27 23:54:17,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:54:17,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-27 23:54:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:17,472 INFO L225 Difference]: With dead ends: 55 [2019-11-27 23:54:17,472 INFO L226 Difference]: Without dead ends: 53 [2019-11-27 23:54:17,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-27 23:54:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-27 23:54:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-27 23:54:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-27 23:54:17,489 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 11 [2019-11-27 23:54:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:17,490 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-27 23:54:17,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-27 23:54:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 23:54:17,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:17,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:17,492 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2019-11-27 23:54:17,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:17,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097681467] [2019-11-27 23:54:17,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:17,603 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-27 23:54:17,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097681467] [2019-11-27 23:54:17,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:17,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:54:17,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382324673] [2019-11-27 23:54:17,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:54:17,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:17,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:54:17,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:54:17,608 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2019-11-27 23:54:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:17,682 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-11-27 23:54:17,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:54:17,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-27 23:54:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:17,683 INFO L225 Difference]: With dead ends: 53 [2019-11-27 23:54:17,683 INFO L226 Difference]: Without dead ends: 51 [2019-11-27 23:54:17,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-27 23:54:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-27 23:54:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-27 23:54:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-27 23:54:17,691 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 13 [2019-11-27 23:54:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:17,691 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-27 23:54:17,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:54:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-27 23:54:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 23:54:17,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:17,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:17,693 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-11-27 23:54:17,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:17,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548344330] [2019-11-27 23:54:17,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:17,805 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-27 23:54:17,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548344330] [2019-11-27 23:54:17,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:54:17,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:54:17,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235435389] [2019-11-27 23:54:17,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:54:17,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:54:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:54:17,813 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-11-27 23:54:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:17,954 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-11-27 23:54:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:54:17,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-27 23:54:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:17,956 INFO L225 Difference]: With dead ends: 66 [2019-11-27 23:54:17,956 INFO L226 Difference]: Without dead ends: 54 [2019-11-27 23:54:17,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:54:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-27 23:54:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-11-27 23:54:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-27 23:54:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-27 23:54:17,973 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 14 [2019-11-27 23:54:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:17,973 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-27 23:54:17,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:54:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-27 23:54:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 23:54:17,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:17,975 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:17,976 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:17,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-11-27 23:54:17,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:17,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902033046] [2019-11-27 23:54:17,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:18,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902033046] [2019-11-27 23:54:18,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872514378] [2019-11-27 23:54:18,035 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-27 23:54:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:18,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 23:54:18,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:18,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:18,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:18,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:18,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-27 23:54:18,190 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:18,205 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:18,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:18,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:18,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:18,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-27 23:54:18,217 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:18,228 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:18,228 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:18,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-11-27 23:54:18,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:18,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-27 23:54:18,287 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:18,320 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:18,330 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-27 23:54:18,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-27 23:54:18,331 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:18,346 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:18,346 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:18,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-11-27 23:54:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:18,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:54:18,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-27 23:54:18,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901872870] [2019-11-27 23:54:18,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:54:18,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:54:18,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:54:18,357 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 7 states. [2019-11-27 23:54:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:18,623 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-27 23:54:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:54:18,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-27 23:54:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:18,627 INFO L225 Difference]: With dead ends: 75 [2019-11-27 23:54:18,627 INFO L226 Difference]: Without dead ends: 53 [2019-11-27 23:54:18,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:54:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-27 23:54:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-27 23:54:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-27 23:54:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-27 23:54:18,637 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 17 [2019-11-27 23:54:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:18,637 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-27 23:54:18,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:54:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-27 23:54:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:54:18,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:18,638 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:18,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:18,840 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2019-11-27 23:54:18,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:18,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021119757] [2019-11-27 23:54:18,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:19,155 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-27 23:54:19,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021119757] [2019-11-27 23:54:19,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557840671] [2019-11-27 23:54:19,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 23:54:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:19,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-27 23:54:19,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:19,264 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 23:54:19,265 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 23:54:19,265 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:19,277 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:54:19,284 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:19,297 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,298 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:19,299 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-27 23:54:19,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:54:19,406 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:19,504 INFO L588 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-11-27 23:54:19,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:19,525 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:19,562 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,568 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:19,597 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,600 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:19,633 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:19,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2019-11-27 23:54:19,669 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:19,712 INFO L588 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-11-27 23:54:19,714 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:19,714 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2019-11-27 23:54:19,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-27 23:54:19,783 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:19,823 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,827 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_28|, |v_#memory_int_37|, |v_#memory_int_38|, |v_#memory_int_39|], 4=[|v_#memory_int_41|]} [2019-11-27 23:54:19,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:19,833 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:19,871 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,875 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:19,904 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,909 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:19,930 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,933 INFO L508 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:19,957 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:19,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:20,018 INFO L343 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-11-27 23:54:20,019 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2019-11-27 23:54:20,020 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:20,082 INFO L588 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2019-11-27 23:54:20,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:20,089 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:20,090 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2019-11-27 23:54:20,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-11-27 23:54:20,176 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:20,182 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:20,182 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:20,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-11-27 23:54:20,190 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-27 23:54:20,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:54:20,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-27 23:54:20,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045038766] [2019-11-27 23:54:20,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:54:20,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:20,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:54:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:54:20,192 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 12 states. [2019-11-27 23:54:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:20,933 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-27 23:54:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:54:20,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-27 23:54:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:20,939 INFO L225 Difference]: With dead ends: 85 [2019-11-27 23:54:20,939 INFO L226 Difference]: Without dead ends: 83 [2019-11-27 23:54:20,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:54:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-27 23:54:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 35. [2019-11-27 23:54:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-27 23:54:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-27 23:54:20,952 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2019-11-27 23:54:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:20,952 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-27 23:54:20,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:54:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-27 23:54:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 23:54:20,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:20,954 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:21,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:21,165 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2019-11-27 23:54:21,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:21,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065935616] [2019-11-27 23:54:21,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:21,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065935616] [2019-11-27 23:54:21,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483957282] [2019-11-27 23:54:21,369 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-27 23:54:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:21,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-27 23:54:21,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:21,476 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 23:54:21,477 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 23:54:21,477 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:21,485 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:21,486 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:21,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2019-11-27 23:54:21,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:21,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:54:21,561 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:21,654 INFO L588 ElimStorePlain]: treesize reduction 14, result has 93.4 percent of original size [2019-11-27 23:54:21,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:21,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:21,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:54:21,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:21,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-27 23:54:21,680 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:21,743 INFO L588 ElimStorePlain]: treesize reduction 16, result has 89.2 percent of original size [2019-11-27 23:54:21,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:21,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:21,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2019-11-27 23:54:21,767 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:21,820 INFO L588 ElimStorePlain]: treesize reduction 24, result has 73.3 percent of original size [2019-11-27 23:54:21,822 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:21,822 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:63 [2019-11-27 23:54:21,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:21,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-27 23:54:21,960 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:22,169 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-27 23:54:22,171 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:22,175 INFO L404 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_30|], 11=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_30|]} [2019-11-27 23:54:22,207 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:22,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 433 treesize of output 333 [2019-11-27 23:54:22,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:22,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:22,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:22,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:22,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:22,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:22,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:22,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:22,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:22,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:22,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:22,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:22,235 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-27 23:54:22,913 WARN L192 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-11-27 23:54:22,914 INFO L588 ElimStorePlain]: treesize reduction 3610, result has 10.4 percent of original size [2019-11-27 23:54:22,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-11-27 23:54:22,942 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:23,030 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:23,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:23,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:23,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:23,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:54:23,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:23,099 INFO L343 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-11-27 23:54:23,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 97 [2019-11-27 23:54:23,101 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:23,217 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-27 23:54:23,218 INFO L588 ElimStorePlain]: treesize reduction 41, result has 86.2 percent of original size [2019-11-27 23:54:23,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:23,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:23,422 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-27 23:54:23,423 INFO L343 Elim1Store]: treesize reduction 33, result has 82.0 percent of original size [2019-11-27 23:54:23,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 174 treesize of output 198 [2019-11-27 23:54:23,427 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:23,602 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-27 23:54:23,602 INFO L588 ElimStorePlain]: treesize reduction 168, result has 38.5 percent of original size [2019-11-27 23:54:23,604 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:23,604 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:454, output treesize:102 [2019-11-27 23:54:23,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:23,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 53 [2019-11-27 23:54:23,782 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:23,797 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:23,798 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:23,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:172, output treesize:88 [2019-11-27 23:54:23,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:23,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 122 [2019-11-27 23:54:23,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:23,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:23,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:23,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:54:23,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:23,890 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:23,894 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:23,894 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:23,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:4 [2019-11-27 23:54:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:23,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:54:23,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-27 23:54:23,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231605919] [2019-11-27 23:54:23,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 23:54:23,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:23,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 23:54:23,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:54:23,911 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-11-27 23:54:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:25,246 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-11-27 23:54:25,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 23:54:25,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-11-27 23:54:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:25,247 INFO L225 Difference]: With dead ends: 105 [2019-11-27 23:54:25,247 INFO L226 Difference]: Without dead ends: 103 [2019-11-27 23:54:25,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-11-27 23:54:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-27 23:54:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2019-11-27 23:54:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-27 23:54:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-11-27 23:54:25,256 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 28 [2019-11-27 23:54:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:25,257 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-11-27 23:54:25,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 23:54:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-11-27 23:54:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 23:54:25,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:25,258 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:25,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:25,462 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:25,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1572363688, now seen corresponding path program 1 times [2019-11-27 23:54:25,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:25,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684579437] [2019-11-27 23:54:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:26,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684579437] [2019-11-27 23:54:26,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364878718] [2019-11-27 23:54:26,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 23:54:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:26,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-27 23:54:26,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:26,476 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 23:54:26,477 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 23:54:26,477 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,487 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:26,488 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:26,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-11-27 23:54:26,550 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:26,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:54:26,551 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,589 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:26,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:26,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:26,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:54:26,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:26,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2019-11-27 23:54:26,621 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,679 INFO L588 ElimStorePlain]: treesize reduction 22, result has 85.2 percent of original size [2019-11-27 23:54:26,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:26,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:26,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:26,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 51 [2019-11-27 23:54:26,710 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,756 INFO L588 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-27 23:54:26,757 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,758 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:203, output treesize:45 [2019-11-27 23:54:26,796 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|]} [2019-11-27 23:54:26,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-11-27 23:54:26,801 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,819 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:26,882 INFO L343 Elim1Store]: treesize reduction 74, result has 47.5 percent of original size [2019-11-27 23:54:26,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 153 [2019-11-27 23:54:26,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:26,884 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,922 INFO L588 ElimStorePlain]: treesize reduction 40, result has 71.2 percent of original size [2019-11-27 23:54:26,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:26,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 109 [2019-11-27 23:54:26,940 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,965 INFO L588 ElimStorePlain]: treesize reduction 64, result has 48.4 percent of original size [2019-11-27 23:54:26,965 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:26,965 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:60 [2019-11-27 23:54:27,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:27,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2019-11-27 23:54:27,060 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:27,068 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:27,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:54:27,072 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:27,076 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:27,077 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:27,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:9 [2019-11-27 23:54:27,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-27 23:54:27,100 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:27,104 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:27,104 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:27,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-27 23:54:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:27,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:54:27,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-11-27 23:54:27,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715056304] [2019-11-27 23:54:27,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-27 23:54:27,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:27,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-27 23:54:27,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-11-27 23:54:27,132 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 21 states. [2019-11-27 23:54:27,339 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-11-27 23:54:27,584 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-27 23:54:27,960 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-11-27 23:54:29,056 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-11-27 23:54:29,264 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-27 23:54:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:29,726 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-11-27 23:54:29,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 23:54:29,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-27 23:54:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:29,735 INFO L225 Difference]: With dead ends: 127 [2019-11-27 23:54:29,735 INFO L226 Difference]: Without dead ends: 115 [2019-11-27 23:54:29,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2019-11-27 23:54:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-27 23:54:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 78. [2019-11-27 23:54:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-27 23:54:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-11-27 23:54:29,761 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 28 [2019-11-27 23:54:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:29,762 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-11-27 23:54:29,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-27 23:54:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-11-27 23:54:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 23:54:29,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:29,767 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:29,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:29,971 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:29,972 INFO L82 PathProgramCache]: Analyzing trace with hash 120690651, now seen corresponding path program 2 times [2019-11-27 23:54:29,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:29,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788760553] [2019-11-27 23:54:29,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:54:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:30,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788760553] [2019-11-27 23:54:30,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948048663] [2019-11-27 23:54:30,234 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 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-27 23:54:30,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:54:30,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:54:30,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-27 23:54:30,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:54:30,339 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-27 23:54:30,340 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-27 23:54:30,340 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:30,359 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:30,360 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:30,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-27 23:54:30,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:30,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:54:30,430 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:30,552 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-27 23:54:30,553 INFO L588 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-11-27 23:54:30,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:30,570 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:54:30,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:30,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-27 23:54:30,583 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:30,659 INFO L588 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-11-27 23:54:30,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:30,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:30,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-27 23:54:30,678 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:30,743 INFO L588 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-11-27 23:54:30,744 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:30,744 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:66 [2019-11-27 23:54:30,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:30,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-27 23:54:30,879 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:31,231 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-27 23:54:31,232 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:31,237 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|, |v_#memory_int_46|], 2=[|v_#memory_int_44|, |v_#memory_int_43|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_35|], 11=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_33|]} [2019-11-27 23:54:31,250 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:31,831 WARN L192 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-27 23:54:31,832 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:31,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2019-11-27 23:54:31,899 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:32,162 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-27 23:54:32,162 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:32,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:32,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 29 [2019-11-27 23:54:32,215 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:32,426 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-27 23:54:32,427 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:32,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:32,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 138 [2019-11-27 23:54:32,446 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:32,760 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-27 23:54:32,761 INFO L588 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2019-11-27 23:54:32,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:32,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1047 treesize of output 635 [2019-11-27 23:54:32,771 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:33,012 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-27 23:54:33,013 INFO L588 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2019-11-27 23:54:33,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-11-27 23:54:33,042 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:33,169 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-27 23:54:33,169 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:33,368 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-27 23:54:33,369 INFO L343 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2019-11-27 23:54:33,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 535 treesize of output 537 [2019-11-27 23:54:33,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,381 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-27 23:54:33,592 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-11-27 23:54:33,593 INFO L588 ElimStorePlain]: treesize reduction 1789, result has 16.4 percent of original size [2019-11-27 23:54:33,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:33,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:33,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:33,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 60 [2019-11-27 23:54:33,624 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:33,652 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:33,652 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:33,653 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:131 [2019-11-27 23:54:33,767 INFO L404 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-11-27 23:54:33,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:33,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 78 [2019-11-27 23:54:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:54:33,803 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:33,923 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-27 23:54:33,924 INFO L588 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-11-27 23:54:33,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:54:33,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-11-27 23:54:33,936 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:33,964 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:33,965 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:54:33,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2019-11-27 23:54:34,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:54:34,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-27 23:54:34,024 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:54:34,036 INFO L588 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-27 23:54:34,037 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:54:34,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-27 23:54:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:54:34,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:54:34,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-27 23:54:34,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124518569] [2019-11-27 23:54:34,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:54:34,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:54:34,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:54:34,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:54:34,098 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 14 states. [2019-11-27 23:54:34,905 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-27 23:54:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:54:35,264 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-11-27 23:54:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 23:54:35,265 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-27 23:54:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:54:35,266 INFO L225 Difference]: With dead ends: 124 [2019-11-27 23:54:35,266 INFO L226 Difference]: Without dead ends: 112 [2019-11-27 23:54:35,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:54:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-27 23:54:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2019-11-27 23:54:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-27 23:54:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2019-11-27 23:54:35,276 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 31 [2019-11-27 23:54:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:54:35,276 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2019-11-27 23:54:35,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:54:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2019-11-27 23:54:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 23:54:35,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:54:35,278 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:54:35,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:54:35,483 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:54:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:54:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -994395513, now seen corresponding path program 1 times [2019-11-27 23:54:35,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:54:35,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836395117] [2019-11-27 23:54:35,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:54:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:54:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:54:35,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:54:35,610 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:54:35,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:54:35 BoogieIcfgContainer [2019-11-27 23:54:35,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:54:35,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:54:35,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:54:35,688 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:54:35,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:54:15" (3/4) ... [2019-11-27 23:54:35,692 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:54:35,775 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:54:35,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:54:35,777 INFO L168 Benchmark]: Toolchain (without parser) took 21268.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -122.8 MB). Peak memory consumption was 176.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:35,778 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:54:35,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -102.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:35,781 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:35,781 INFO L168 Benchmark]: Boogie Preprocessor took 42.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:54:35,782 INFO L168 Benchmark]: RCFGBuilder took 617.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:35,783 INFO L168 Benchmark]: TraceAbstraction took 19877.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -76.6 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:35,784 INFO L168 Benchmark]: Witness Printer took 88.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:54:35,787 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -102.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 617.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19877.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -76.6 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. * Witness Printer took 88.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK [L1021] EXPR end->colour [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list [L1030] COND FALSE !(!(null != end)) [L1031] EXPR end->colour [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) [L1038] EXPR end->colour [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 7 error locations. Result: UNSAFE, OverallTime: 19.7s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 378 SDtfs, 907 SDslu, 1331 SDs, 0 SdLazy, 1565 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 160 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 302 ConstructedInterpolants, 29 QuantifiedInterpolants, 256038 SizeOfPredicates, 69 NumberOfNonLiveVariables, 607 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 12/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...