./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer --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-6b5699a [2019-11-25 08:46:54,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:46:54,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:46:54,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:46:54,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:46:54,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:46:54,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:46:54,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:46:54,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:46:54,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:46:54,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:46:54,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:46:54,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:46:54,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:46:54,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:46:54,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:46:54,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:46:54,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:46:54,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:46:54,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:46:54,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:46:54,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:46:54,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:46:54,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:46:54,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:46:54,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:46:54,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:46:54,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:46:54,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:46:54,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:46:54,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:46:54,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:46:54,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:46:54,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:46:54,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:46:54,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:46:54,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:46:54,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:46:54,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:46:54,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:46:54,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:46:54,212 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:46:54,235 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:46:54,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:46:54,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:46:54,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:46:54,237 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:46:54,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:46:54,237 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:46:54,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:46:54,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:46:54,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:46:54,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:46:54,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:46:54,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:46:54,239 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:46:54,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:46:54,239 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:46:54,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:46:54,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:46:54,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:46:54,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:46:54,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:46:54,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:46:54,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:46:54,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:46:54,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:46:54,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:46:54,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:46:54,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:46:54,241 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer 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-25 08:46:54,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:46:54,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:46:54,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:46:54,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:46:54,437 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:46:54,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-25 08:46:54,491 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/data/46c5f4fbd/e4cc440b94d64bf99d75db554c77ab30/FLAG4ec497812 [2019-11-25 08:46:54,966 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:46:54,967 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-25 08:46:54,985 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/data/46c5f4fbd/e4cc440b94d64bf99d75db554c77ab30/FLAG4ec497812 [2019-11-25 08:46:54,997 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/data/46c5f4fbd/e4cc440b94d64bf99d75db554c77ab30 [2019-11-25 08:46:54,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:46:55,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:46:55,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:55,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:46:55,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:46:55,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:54" (1/1) ... [2019-11-25 08:46:55,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3eee99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55, skipping insertion in model container [2019-11-25 08:46:55,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:54" (1/1) ... [2019-11-25 08:46:55,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:46:55,069 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:46:55,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:55,466 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:46:55,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:55,561 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:46:55,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55 WrapperNode [2019-11-25 08:46:55,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:55,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:55,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:46:55,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:46:55,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:55,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:46:55,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:46:55,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:46:55,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... [2019-11-25 08:46:55,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:46:55,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:46:55,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:46:55,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:46:55,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/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-25 08:46:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:46:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:46:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:46:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:46:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:46:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:46:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:46:55,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:46:56,205 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:46:56,205 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-25 08:46:56,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:56 BoogieIcfgContainer [2019-11-25 08:46:56,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:46:56,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:46:56,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:46:56,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:46:56,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:46:54" (1/3) ... [2019-11-25 08:46:56,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d8f094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:56, skipping insertion in model container [2019-11-25 08:46:56,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:55" (2/3) ... [2019-11-25 08:46:56,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d8f094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:56, skipping insertion in model container [2019-11-25 08:46:56,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:56" (3/3) ... [2019-11-25 08:46:56,214 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-11-25 08:46:56,223 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:46:56,231 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-25 08:46:56,246 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-25 08:46:56,269 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:46:56,270 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:46:56,270 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:46:56,270 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:46:56,270 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:46:56,271 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:46:56,271 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:46:56,271 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:46:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-25 08:46:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-25 08:46:56,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:56,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:46:56,290 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-25 08:46:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-11-25 08:46:56,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:56,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520756485] [2019-11-25 08:46:56,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:56,448 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-25 08:46:56,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520756485] [2019-11-25 08:46:56,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:56,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:56,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893229723] [2019-11-25 08:46:56,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:46:56,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:46:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:46:56,464 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-25 08:46:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:56,482 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-11-25 08:46:56,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:46:56,484 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-25 08:46:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:56,491 INFO L225 Difference]: With dead ends: 92 [2019-11-25 08:46:56,491 INFO L226 Difference]: Without dead ends: 41 [2019-11-25 08:46:56,494 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-25 08:46:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-25 08:46:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-25 08:46:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-25 08:46:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-11-25 08:46:56,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-11-25 08:46:56,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:56,523 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-11-25 08:46:56,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:46:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-11-25 08:46:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-25 08:46:56,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:56,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:56,525 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-25 08:46:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-11-25 08:46:56,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:56,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000510596] [2019-11-25 08:46:56,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:56,602 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-25 08:46:56,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000510596] [2019-11-25 08:46:56,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:56,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:46:56,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489446167] [2019-11-25 08:46:56,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:56,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:56,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:56,605 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-11-25 08:46:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:56,754 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-11-25 08:46:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:56,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-25 08:46:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:56,756 INFO L225 Difference]: With dead ends: 47 [2019-11-25 08:46:56,756 INFO L226 Difference]: Without dead ends: 45 [2019-11-25 08:46:56,757 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-25 08:46:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-25 08:46:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-25 08:46:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 08:46:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-25 08:46:56,763 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2019-11-25 08:46:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:56,763 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-25 08:46:56,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-25 08:46:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-25 08:46:56,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:56,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:56,765 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-25 08:46:56,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:56,766 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-11-25 08:46:56,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:56,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021459327] [2019-11-25 08:46:56,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:56,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021459327] [2019-11-25 08:46:56,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:56,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:46:56,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077852558] [2019-11-25 08:46:56,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:56,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:56,912 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-25 08:46:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:57,006 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-25 08:46:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:57,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-25 08:46:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:57,008 INFO L225 Difference]: With dead ends: 39 [2019-11-25 08:46:57,008 INFO L226 Difference]: Without dead ends: 37 [2019-11-25 08:46:57,009 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-25 08:46:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-25 08:46:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-25 08:46:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-25 08:46:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-25 08:46:57,014 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2019-11-25 08:46:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:57,014 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-25 08:46:57,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-25 08:46:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:46:57,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:57,015 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:57,015 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-25 08:46:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-11-25 08:46:57,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:57,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801502601] [2019-11-25 08:46:57,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:57,193 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-25 08:46:57,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801502601] [2019-11-25 08:46:57,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:57,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:46:57,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183609030] [2019-11-25 08:46:57,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:46:57,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:46:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:46:57,195 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2019-11-25 08:46:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:57,525 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-11-25 08:46:57,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:46:57,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-25 08:46:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:57,528 INFO L225 Difference]: With dead ends: 78 [2019-11-25 08:46:57,528 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 08:46:57,529 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-25 08:46:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 08:46:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-11-25 08:46:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 08:46:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-25 08:46:57,537 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 10 [2019-11-25 08:46:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:57,540 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-25 08:46:57,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:46:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-25 08:46:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:46:57,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:57,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:57,542 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-25 08:46:57,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:57,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-11-25 08:46:57,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:57,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806023295] [2019-11-25 08:46:57,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:57,658 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-25 08:46:57,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806023295] [2019-11-25 08:46:57,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:57,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:46:57,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704704291] [2019-11-25 08:46:57,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:57,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:57,660 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-11-25 08:46:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:57,774 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-25 08:46:57,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:57,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-25 08:46:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:57,775 INFO L225 Difference]: With dead ends: 55 [2019-11-25 08:46:57,775 INFO L226 Difference]: Without dead ends: 53 [2019-11-25 08:46:57,776 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-25 08:46:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-25 08:46:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-25 08:46:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 08:46:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-25 08:46:57,783 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 11 [2019-11-25 08:46:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:57,784 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-25 08:46:57,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-25 08:46:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 08:46:57,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:57,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:57,785 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-25 08:46:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2019-11-25 08:46:57,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:57,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812302361] [2019-11-25 08:46:57,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:57,866 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-25 08:46:57,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812302361] [2019-11-25 08:46:57,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:57,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:46:57,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752370205] [2019-11-25 08:46:57,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:57,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:57,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:57,868 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2019-11-25 08:46:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:57,935 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-11-25 08:46:57,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:57,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-25 08:46:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:57,936 INFO L225 Difference]: With dead ends: 53 [2019-11-25 08:46:57,936 INFO L226 Difference]: Without dead ends: 51 [2019-11-25 08:46:57,937 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-25 08:46:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-25 08:46:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-25 08:46:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-25 08:46:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-25 08:46:57,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 13 [2019-11-25 08:46:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:57,944 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-25 08:46:57,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-25 08:46:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:46:57,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:57,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:57,945 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-25 08:46:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:57,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-11-25 08:46:57,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:57,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810502333] [2019-11-25 08:46:57,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:58,058 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-25 08:46:58,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810502333] [2019-11-25 08:46:58,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:58,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:46:58,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735679699] [2019-11-25 08:46:58,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:46:58,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:46:58,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:58,060 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-11-25 08:46:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:58,205 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-11-25 08:46:58,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:46:58,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-25 08:46:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:58,207 INFO L225 Difference]: With dead ends: 66 [2019-11-25 08:46:58,207 INFO L226 Difference]: Without dead ends: 54 [2019-11-25 08:46:58,207 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-25 08:46:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-25 08:46:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-11-25 08:46:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 08:46:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-25 08:46:58,213 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 14 [2019-11-25 08:46:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:58,214 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-25 08:46:58,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:46:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-25 08:46:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:46:58,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:58,215 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:58,215 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-25 08:46:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-11-25 08:46:58,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:58,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336297027] [2019-11-25 08:46:58,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:58,303 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-25 08:46:58,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336297027] [2019-11-25 08:46:58,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111122194] [2019-11-25 08:46:58,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/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-25 08:46:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:58,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 08:46:58,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:58,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:58,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:58,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:58,454 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-25 08:46:58,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:58,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:58,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:58,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:58,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:58,483 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-25 08:46:58,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:58,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:58,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:46:58,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-11-25 08:46:58,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:58,558 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-25 08:46:58,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:58,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:58,578 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-25 08:46:58,578 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-25 08:46:58,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:58,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:58,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:46:58,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-11-25 08:46:58,588 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-25 08:46:58,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:58,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-25 08:46:58,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584601913] [2019-11-25 08:46:58,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:46:58,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:58,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:46:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:46:58,590 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 7 states. [2019-11-25 08:46:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:58,794 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-25 08:46:58,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:46:58,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-25 08:46:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:58,795 INFO L225 Difference]: With dead ends: 75 [2019-11-25 08:46:58,795 INFO L226 Difference]: Without dead ends: 53 [2019-11-25 08:46:58,796 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-25 08:46:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-25 08:46:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-25 08:46:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 08:46:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-25 08:46:58,801 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 17 [2019-11-25 08:46:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:58,802 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-25 08:46:58,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:46:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-25 08:46:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:46:58,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:58,803 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-25 08:46:59,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:59,004 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-25 08:46:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2019-11-25 08:46:59,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:59,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636878952] [2019-11-25 08:46:59,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:59,252 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-25 08:46:59,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636878952] [2019-11-25 08:46:59,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272695238] [2019-11-25 08:46:59,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/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-25 08:46:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:59,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 08:46:59,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:59,370 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 08:46:59,371 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-25 08:46:59,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:59,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,389 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-25 08:46:59,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:59,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,400 INFO L496 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-25 08:46:59,401 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-25 08:46:59,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,484 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-25 08:46:59,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:59,578 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-11-25 08:46:59,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:59,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:59,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,633 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:46:59,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,667 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:46:59,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:59,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,718 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-25 08:46:59,719 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:59,760 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-11-25 08:46:59,761 INFO L496 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-25 08:46:59,761 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2019-11-25 08:46:59,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,821 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-25 08:46:59,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:59,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,868 INFO L392 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-25 08:46:59,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:46:59,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:59,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,924 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:46:59,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,955 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:46:59,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:59,982 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:00,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:00,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:00,055 INFO L343 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-11-25 08:47:00,055 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-25 08:47:00,056 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:00,110 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2019-11-25 08:47:00,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:00,115 INFO L496 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-25 08:47:00,116 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2019-11-25 08:47:00,195 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-25 08:47:00,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:00,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:00,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:00,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-11-25 08:47:00,208 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-25 08:47:00,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:00,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-25 08:47:00,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124797271] [2019-11-25 08:47:00,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:47:00,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:00,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:47:00,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:47:00,209 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 12 states. [2019-11-25 08:47:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:00,830 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-25 08:47:00,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:47:00,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-25 08:47:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:00,832 INFO L225 Difference]: With dead ends: 85 [2019-11-25 08:47:00,832 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 08:47:00,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-25 08:47:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 08:47:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 35. [2019-11-25 08:47:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-25 08:47:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-25 08:47:00,836 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2019-11-25 08:47:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:00,836 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-25 08:47:00,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:47:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-25 08:47:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:47:00,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:00,838 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-25 08:47:01,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:01,040 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-25 08:47:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2019-11-25 08:47:01,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:01,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58516858] [2019-11-25 08:47:01,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:01,350 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-25 08:47:01,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58516858] [2019-11-25 08:47:01,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940493878] [2019-11-25 08:47:01,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/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-25 08:47:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:01,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-25 08:47:01,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:01,452 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 08:47:01,452 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-25 08:47:01,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:01,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:01,460 INFO L496 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-25 08:47:01,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2019-11-25 08:47:01,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:01,523 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-25 08:47:01,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:01,599 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.4 percent of original size [2019-11-25 08:47:01,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:01,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:01,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:47:01,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:01,642 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-25 08:47:01,642 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:01,707 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.2 percent of original size [2019-11-25 08:47:01,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:01,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:01,727 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-25 08:47:01,727 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:01,797 INFO L567 ElimStorePlain]: treesize reduction 24, result has 73.3 percent of original size [2019-11-25 08:47:01,798 INFO L496 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-25 08:47:01,798 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:63 [2019-11-25 08:47:01,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:01,904 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-25 08:47:01,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:02,086 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-25 08:47:02,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:02,092 INFO L392 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-25 08:47:02,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:02,152 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-25 08:47:02,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:02,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:02,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:02,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:02,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:02,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:02,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:02,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:02,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:02,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:02,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:02,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-25 08:47:02,804 WARN L192 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-11-25 08:47:02,805 INFO L567 ElimStorePlain]: treesize reduction 3610, result has 10.4 percent of original size [2019-11-25 08:47:02,824 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-25 08:47:02,825 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:02,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:02,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:02,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:02,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:02,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:47:02,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:02,972 INFO L343 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-11-25 08:47:02,972 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-25 08:47:02,973 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:03,075 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-25 08:47:03,075 INFO L567 ElimStorePlain]: treesize reduction 41, result has 86.2 percent of original size [2019-11-25 08:47:03,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:03,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:03,210 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-25 08:47:03,211 INFO L343 Elim1Store]: treesize reduction 33, result has 82.0 percent of original size [2019-11-25 08:47:03,211 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-25 08:47:03,213 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:03,328 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-25 08:47:03,329 INFO L567 ElimStorePlain]: treesize reduction 168, result has 38.5 percent of original size [2019-11-25 08:47:03,329 INFO L496 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-25 08:47:03,330 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:454, output treesize:102 [2019-11-25 08:47:03,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:03,506 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-25 08:47:03,507 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:03,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:03,524 INFO L496 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-25 08:47:03,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:172, output treesize:88 [2019-11-25 08:47:03,643 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:03,643 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-25 08:47:03,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:03,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:03,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:03,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:03,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:03,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:03,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:03,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:03,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:03,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:03,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:03,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:4 [2019-11-25 08:47:03,668 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-25 08:47:03,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:03,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-25 08:47:03,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843171144] [2019-11-25 08:47:03,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-25 08:47:03,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:47:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:47:03,671 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-11-25 08:47:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:04,892 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-11-25 08:47:04,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:47:04,892 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-11-25 08:47:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:04,893 INFO L225 Difference]: With dead ends: 105 [2019-11-25 08:47:04,893 INFO L226 Difference]: Without dead ends: 103 [2019-11-25 08:47:04,894 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-25 08:47:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-25 08:47:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2019-11-25 08:47:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-25 08:47:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-11-25 08:47:04,901 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 28 [2019-11-25 08:47:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:04,901 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-11-25 08:47:04,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-25 08:47:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-11-25 08:47:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:47:04,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:04,903 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-25 08:47:05,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:05,110 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-25 08:47:05,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:05,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1572363688, now seen corresponding path program 1 times [2019-11-25 08:47:05,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:05,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525278667] [2019-11-25 08:47:05,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,527 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-11-25 08:47:06,005 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-25 08:47:06,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525278667] [2019-11-25 08:47:06,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179333858] [2019-11-25 08:47:06,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/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-25 08:47:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 08:47:06,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:06,078 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 08:47:06,078 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-25 08:47:06,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,087 INFO L496 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-25 08:47:06,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-11-25 08:47:06,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,147 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-25 08:47:06,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:06,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:06,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:47:06,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,202 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-25 08:47:06,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,256 INFO L567 ElimStorePlain]: treesize reduction 22, result has 85.2 percent of original size [2019-11-25 08:47:06,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:06,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:06,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,288 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-25 08:47:06,289 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,325 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-25 08:47:06,325 INFO L496 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-25 08:47:06,325 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:203, output treesize:45 [2019-11-25 08:47:06,354 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|]} [2019-11-25 08:47:06,358 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-25 08:47:06,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,410 INFO L343 Elim1Store]: treesize reduction 74, result has 47.5 percent of original size [2019-11-25 08:47:06,411 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-25 08:47:06,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:06,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,436 INFO L567 ElimStorePlain]: treesize reduction 40, result has 71.2 percent of original size [2019-11-25 08:47:06,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,453 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-25 08:47:06,454 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,471 INFO L567 ElimStorePlain]: treesize reduction 64, result has 48.4 percent of original size [2019-11-25 08:47:06,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,472 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:60 [2019-11-25 08:47:06,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,572 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-25 08:47:06,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,605 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-25 08:47:06,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:9 [2019-11-25 08:47:06,648 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-25 08:47:06,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:06,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:06,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-25 08:47:06,689 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-25 08:47:06,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:06,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-11-25 08:47:06,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263590759] [2019-11-25 08:47:06,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 08:47:06,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:06,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 08:47:06,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:47:06,692 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 21 states. [2019-11-25 08:47:08,407 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-25 08:47:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:08,785 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-11-25 08:47:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 08:47:08,785 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-25 08:47:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:08,788 INFO L225 Difference]: With dead ends: 127 [2019-11-25 08:47:08,788 INFO L226 Difference]: Without dead ends: 115 [2019-11-25 08:47:08,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 08:47:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-25 08:47:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 78. [2019-11-25 08:47:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 08:47:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-11-25 08:47:08,800 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 28 [2019-11-25 08:47:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:08,801 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-11-25 08:47:08,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 08:47:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-11-25 08:47:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:47:08,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:08,802 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-25 08:47:09,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:09,005 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-25 08:47:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash 120690651, now seen corresponding path program 2 times [2019-11-25 08:47:09,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:09,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484147512] [2019-11-25 08:47:09,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,327 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-25 08:47:09,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484147512] [2019-11-25 08:47:09,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925702525] [2019-11-25 08:47:09,328 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/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-25 08:47:09,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:09,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:09,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-25 08:47:09,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:09,466 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 08:47:09,466 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-25 08:47:09,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:09,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:09,479 INFO L496 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-25 08:47:09,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-25 08:47:09,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:09,546 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-25 08:47:09,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:09,662 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-25 08:47:09,663 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-11-25 08:47:09,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:09,682 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:47:09,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:09,694 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-25 08:47:09,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:09,774 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-11-25 08:47:09,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:09,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:09,793 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-25 08:47:09,793 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:09,861 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-11-25 08:47:09,862 INFO L496 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-25 08:47:09,862 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:66 [2019-11-25 08:47:10,001 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:10,001 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-25 08:47:10,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:10,401 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-25 08:47:10,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:10,404 INFO L392 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-25 08:47:10,419 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:10,947 WARN L192 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 08:47:10,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:11,042 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-25 08:47:11,043 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:11,333 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-25 08:47:11,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:11,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:11,383 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-25 08:47:11,384 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:11,586 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-25 08:47:11,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:11,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:11,604 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-25 08:47:11,605 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:11,895 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-25 08:47:11,896 INFO L567 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2019-11-25 08:47:11,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:11,902 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-25 08:47:11,903 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:12,124 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-25 08:47:12,125 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2019-11-25 08:47:12,146 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-25 08:47:12,147 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:12,262 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-25 08:47:12,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:12,441 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-25 08:47:12,442 INFO L343 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2019-11-25 08:47:12,442 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-25 08:47:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,449 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-25 08:47:12,599 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-11-25 08:47:12,599 INFO L567 ElimStorePlain]: treesize reduction 1789, result has 16.4 percent of original size [2019-11-25 08:47:12,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:12,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:12,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:12,620 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-25 08:47:12,620 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:12,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:12,652 INFO L496 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-25 08:47:12,652 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:131 [2019-11-25 08:47:12,737 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-11-25 08:47:12,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:12,753 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-25 08:47:12,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:12,757 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:12,804 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-11-25 08:47:12,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:47:12,809 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-25 08:47:12,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:12,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:12,820 INFO L496 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-25 08:47:12,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2019-11-25 08:47:12,847 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:12,847 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-25 08:47:12,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:12,860 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-25 08:47:12,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:12,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-25 08:47:12,882 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-25 08:47:12,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:12,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-25 08:47:12,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956907315] [2019-11-25 08:47:12,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:47:12,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:47:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:47:12,884 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 14 states. [2019-11-25 08:47:13,472 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-25 08:47:13,782 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-11-25 08:47:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:13,874 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-11-25 08:47:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:47:13,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-25 08:47:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:13,876 INFO L225 Difference]: With dead ends: 124 [2019-11-25 08:47:13,876 INFO L226 Difference]: Without dead ends: 112 [2019-11-25 08:47:13,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:47:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-25 08:47:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2019-11-25 08:47:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-25 08:47:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2019-11-25 08:47:13,885 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 31 [2019-11-25 08:47:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:13,891 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2019-11-25 08:47:13,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:47:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2019-11-25 08:47:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:47:13,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:13,894 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-25 08:47:14,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:14,098 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-25 08:47:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash -994395513, now seen corresponding path program 1 times [2019-11-25 08:47:14,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:14,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077004564] [2019-11-25 08:47:14,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:14,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:14,205 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:47:14,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:14 BoogieIcfgContainer [2019-11-25 08:47:14,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:14,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:14,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:14,259 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:14,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:56" (3/4) ... [2019-11-25 08:47:14,261 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:47:14,319 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0c599ca9-3a02-49bc-98cf-f80769846238/bin/uautomizer/witness.graphml [2019-11-25 08:47:14,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:14,320 INFO L168 Benchmark]: Toolchain (without parser) took 19320.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.3 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -275.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:14,320 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:14,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:14,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:14,323 INFO L168 Benchmark]: Boogie Preprocessor took 32.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:14,323 INFO L168 Benchmark]: RCFGBuilder took 564.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:14,324 INFO L168 Benchmark]: TraceAbstraction took 18050.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -178.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:14,325 INFO L168 Benchmark]: Witness Printer took 60.78 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:14,327 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 561.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 564.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18050.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -178.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 60.78 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 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: 17.9s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 378 SDtfs, 907 SDslu, 1331 SDs, 0 SdLazy, 1565 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 4.8s 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 160 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s 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...