./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/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-678e011 [2019-11-20 03:31:42,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:31:42,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:31:42,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:31:42,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:31:42,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:31:42,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:31:42,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:31:42,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:31:42,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:31:42,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:31:42,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:31:42,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:31:42,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:31:42,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:31:42,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:31:42,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:31:42,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:31:42,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:31:42,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:31:42,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:31:42,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:31:42,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:31:42,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:31:42,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:31:42,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:31:42,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:31:42,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:31:42,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:31:42,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:31:42,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:31:42,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:31:42,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:31:42,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:31:42,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:31:42,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:31:42,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:31:42,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:31:42,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:31:42,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:31:42,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:31:42,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:31:42,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:31:42,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:31:42,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:31:42,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:31:42,888 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:31:42,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:31:42,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:31:42,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:31:42,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:31:42,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:31:42,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:31:42,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:31:42,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:31:42,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:31:42,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:31:42,891 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:31:42,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:31:42,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:31:42,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:31:42,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:31:42,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:31:42,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:31:42,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:31:42,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:31:42,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:31:42,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:31:42,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:31:42,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:31:42,894 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_873ba516-676f-45ec-bf9b-ca210095284d/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-20 03:31:43,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:31:43,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:31:43,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:31:43,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:31:43,048 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:31:43,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-20 03:31:43,105 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/data/de301c692/6a03a5f320e74b8ba2ac84da2b2a8bf5/FLAG981c73e77 [2019-11-20 03:31:43,576 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:31:43,577 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-20 03:31:43,592 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/data/de301c692/6a03a5f320e74b8ba2ac84da2b2a8bf5/FLAG981c73e77 [2019-11-20 03:31:44,068 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/data/de301c692/6a03a5f320e74b8ba2ac84da2b2a8bf5 [2019-11-20 03:31:44,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:31:44,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:31:44,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:31:44,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:31:44,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:31:44,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26de5b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44, skipping insertion in model container [2019-11-20 03:31:44,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,086 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:31:44,140 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:31:44,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:31:44,457 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:31:44,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:31:44,541 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:31:44,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44 WrapperNode [2019-11-20 03:31:44,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:31:44,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:31:44,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:31:44,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:31:44,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:31:44,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:31:44,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:31:44,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:31:44,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... [2019-11-20 03:31:44,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:31:44,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:31:44,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:31:44,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:31:44,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/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-20 03:31:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 03:31:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 03:31:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:31:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:31:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:31:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:31:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:31:44,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:31:45,135 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:31:45,135 INFO L285 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-20 03:31:45,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:31:45 BoogieIcfgContainer [2019-11-20 03:31:45,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:31:45,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:31:45,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:31:45,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:31:45,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:31:44" (1/3) ... [2019-11-20 03:31:45,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f67d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:31:45, skipping insertion in model container [2019-11-20 03:31:45,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:31:44" (2/3) ... [2019-11-20 03:31:45,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f67d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:31:45, skipping insertion in model container [2019-11-20 03:31:45,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:31:45" (3/3) ... [2019-11-20 03:31:45,144 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-11-20 03:31:45,153 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:31:45,169 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-20 03:31:45,183 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-20 03:31:45,206 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:31:45,206 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:31:45,206 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:31:45,206 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:31:45,207 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:31:45,207 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:31:45,207 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:31:45,207 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:31:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-20 03:31:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 03:31:45,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:45,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 03:31:45,230 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-20 03:31:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-11-20 03:31:45,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:45,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379066704] [2019-11-20 03:31:45,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:45,389 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-20 03:31:45,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379066704] [2019-11-20 03:31:45,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:45,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:31:45,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866740854] [2019-11-20 03:31:45,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 03:31:45,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:45,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 03:31:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 03:31:45,406 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-20 03:31:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:45,424 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-11-20 03:31:45,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 03:31:45,425 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-20 03:31:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:45,433 INFO L225 Difference]: With dead ends: 92 [2019-11-20 03:31:45,433 INFO L226 Difference]: Without dead ends: 41 [2019-11-20 03:31:45,437 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-20 03:31:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-20 03:31:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-20 03:31:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-20 03:31:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-11-20 03:31:45,469 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-11-20 03:31:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:45,469 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-11-20 03:31:45,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 03:31:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-11-20 03:31:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 03:31:45,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:45,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:45,470 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-20 03:31:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-11-20 03:31:45,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:45,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584610285] [2019-11-20 03:31:45,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:45,545 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-20 03:31:45,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584610285] [2019-11-20 03:31:45,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:45,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:31:45,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391039258] [2019-11-20 03:31:45,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:31:45,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:31:45,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:45,549 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-11-20 03:31:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:45,717 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-11-20 03:31:45,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:31:45,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-20 03:31:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:45,719 INFO L225 Difference]: With dead ends: 47 [2019-11-20 03:31:45,719 INFO L226 Difference]: Without dead ends: 45 [2019-11-20 03:31:45,720 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-20 03:31:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-20 03:31:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-20 03:31:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 03:31:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-20 03:31:45,726 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2019-11-20 03:31:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:45,732 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-20 03:31:45,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:31:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-20 03:31:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 03:31:45,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:45,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:45,733 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-20 03:31:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-11-20 03:31:45,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:45,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302230740] [2019-11-20 03:31:45,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:45,850 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-20 03:31:45,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302230740] [2019-11-20 03:31:45,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:45,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:31:45,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258867588] [2019-11-20 03:31:45,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:31:45,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:45,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:31:45,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:45,852 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-20 03:31:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:45,926 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-20 03:31:45,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:31:45,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-20 03:31:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:45,928 INFO L225 Difference]: With dead ends: 39 [2019-11-20 03:31:45,928 INFO L226 Difference]: Without dead ends: 37 [2019-11-20 03:31:45,928 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-20 03:31:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-20 03:31:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-20 03:31:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-20 03:31:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-20 03:31:45,934 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2019-11-20 03:31:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:45,934 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-20 03:31:45,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:31:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-20 03:31:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 03:31:45,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:45,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:45,935 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-20 03:31:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-11-20 03:31:45,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:45,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639619036] [2019-11-20 03:31:45,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:46,143 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-20 03:31:46,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639619036] [2019-11-20 03:31:46,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:46,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 03:31:46,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781299608] [2019-11-20 03:31:46,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:31:46,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:31:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:31:46,145 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2019-11-20 03:31:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:46,498 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-11-20 03:31:46,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:31:46,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-20 03:31:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:46,501 INFO L225 Difference]: With dead ends: 78 [2019-11-20 03:31:46,501 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 03:31:46,501 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-20 03:31:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 03:31:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-11-20 03:31:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-20 03:31:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-20 03:31:46,517 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 10 [2019-11-20 03:31:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:46,517 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-20 03:31:46,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:31:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-20 03:31:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:31:46,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:46,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:46,519 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-20 03:31:46,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-11-20 03:31:46,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:46,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685081353] [2019-11-20 03:31:46,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:46,664 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-20 03:31:46,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685081353] [2019-11-20 03:31:46,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:46,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:31:46,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494309984] [2019-11-20 03:31:46,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:31:46,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:46,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:31:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:46,666 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-11-20 03:31:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:46,773 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-20 03:31:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:31:46,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 03:31:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:46,778 INFO L225 Difference]: With dead ends: 55 [2019-11-20 03:31:46,779 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 03:31:46,779 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-20 03:31:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 03:31:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-20 03:31:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 03:31:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-20 03:31:46,786 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 11 [2019-11-20 03:31:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:46,786 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-20 03:31:46,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:31:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-20 03:31:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 03:31:46,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:46,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:46,788 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-20 03:31:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:46,788 INFO L82 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2019-11-20 03:31:46,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:46,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296575459] [2019-11-20 03:31:46,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:46,859 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-20 03:31:46,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296575459] [2019-11-20 03:31:46,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:46,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:31:46,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738023395] [2019-11-20 03:31:46,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:31:46,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:31:46,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:31:46,861 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2019-11-20 03:31:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:46,971 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-11-20 03:31:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:31:46,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-20 03:31:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:46,973 INFO L225 Difference]: With dead ends: 53 [2019-11-20 03:31:46,973 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 03:31:46,974 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-20 03:31:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 03:31:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-20 03:31:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 03:31:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-20 03:31:46,992 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 13 [2019-11-20 03:31:46,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:46,992 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-20 03:31:46,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:31:46,993 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-20 03:31:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:31:46,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:46,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:46,996 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-20 03:31:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-11-20 03:31:46,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:46,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162201858] [2019-11-20 03:31:46,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:47,125 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-20 03:31:47,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162201858] [2019-11-20 03:31:47,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:31:47,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:31:47,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214896101] [2019-11-20 03:31:47,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:31:47,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:31:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:31:47,127 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-11-20 03:31:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:47,245 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-11-20 03:31:47,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:31:47,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-20 03:31:47,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:47,246 INFO L225 Difference]: With dead ends: 66 [2019-11-20 03:31:47,246 INFO L226 Difference]: Without dead ends: 54 [2019-11-20 03:31:47,247 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-20 03:31:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-20 03:31:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-11-20 03:31:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 03:31:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-20 03:31:47,253 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 14 [2019-11-20 03:31:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:47,254 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-20 03:31:47,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:31:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-20 03:31:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:31:47,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:47,255 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:31:47,256 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-20 03:31:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-11-20 03:31:47,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:47,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7760103] [2019-11-20 03:31:47,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:47,309 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-20 03:31:47,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7760103] [2019-11-20 03:31:47,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19109345] [2019-11-20 03:31:47,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/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-20 03:31:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:47,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 03:31:47,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:31:47,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:47,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:47,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:47,449 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-20 03:31:47,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:47,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:47,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:47,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:47,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:47,471 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-20 03:31:47,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:47,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:47,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:31:47,482 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-11-20 03:31:47,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:47,546 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-20 03:31:47,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:47,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:47,563 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 03:31:47,563 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-20 03:31:47,564 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:47,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:47,570 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-20 03:31:47,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-11-20 03:31:47,574 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-20 03:31:47,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:31:47,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-20 03:31:47,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597244005] [2019-11-20 03:31:47,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:31:47,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:47,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:31:47,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:31:47,576 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 7 states. [2019-11-20 03:31:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:47,822 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-20 03:31:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:31:47,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-20 03:31:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:47,824 INFO L225 Difference]: With dead ends: 75 [2019-11-20 03:31:47,824 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 03:31:47,824 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-20 03:31:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 03:31:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-20 03:31:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 03:31:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-20 03:31:47,830 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 17 [2019-11-20 03:31:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:47,830 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-20 03:31:47,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:31:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-20 03:31:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:31:47,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:47,831 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-20 03:31:48,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:31:48,035 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-20 03:31:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2019-11-20 03:31:48,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:48,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9087389] [2019-11-20 03:31:48,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:48,355 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-20 03:31:48,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9087389] [2019-11-20 03:31:48,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850638052] [2019-11-20 03:31:48,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/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-20 03:31:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:48,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 03:31:48,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:31:48,449 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:31:48,449 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-20 03:31:48,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:48,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,466 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-20 03:31:48,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:48,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,478 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-20 03:31:48,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-20 03:31:48,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,547 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-20 03:31:48,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:48,631 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-11-20 03:31:48,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:48,644 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:48,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,689 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-20 03:31:48,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,725 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-20 03:31:48,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:48,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,779 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-20 03:31:48,780 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:48,830 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-11-20 03:31:48,832 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-20 03:31:48,832 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2019-11-20 03:31:48,906 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,907 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-20 03:31:48,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:48,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:48,950 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-20 03:31:48,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:48,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:49,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:49,009 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-20 03:31:49,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:49,049 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-20 03:31:49,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:49,076 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-20 03:31:49,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:49,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:49,186 INFO L343 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-11-20 03:31:49,186 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-20 03:31:49,187 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:49,239 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2019-11-20 03:31:49,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:49,244 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-20 03:31:49,244 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2019-11-20 03:31:49,334 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-20 03:31:49,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:49,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:49,343 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-20 03:31:49,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-11-20 03:31:49,350 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-20 03:31:49,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:31:49,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-20 03:31:49,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24558869] [2019-11-20 03:31:49,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 03:31:49,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:49,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 03:31:49,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:31:49,352 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 12 states. [2019-11-20 03:31:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:50,048 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-20 03:31:50,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:31:50,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-20 03:31:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:50,049 INFO L225 Difference]: With dead ends: 85 [2019-11-20 03:31:50,049 INFO L226 Difference]: Without dead ends: 83 [2019-11-20 03:31:50,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:31:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-20 03:31:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 35. [2019-11-20 03:31:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 03:31:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-20 03:31:50,055 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2019-11-20 03:31:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:50,055 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-20 03:31:50,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 03:31:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-20 03:31:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 03:31:50,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:50,056 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-20 03:31:50,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:31:50,257 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-20 03:31:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2019-11-20 03:31:50,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:50,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698183127] [2019-11-20 03:31:50,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:50,498 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-20 03:31:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698183127] [2019-11-20 03:31:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936759509] [2019-11-20 03:31:50,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/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-20 03:31:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:50,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-20 03:31:50,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:31:50,593 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:31:50,594 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-20 03:31:50,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:50,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:50,604 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-20 03:31:50,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2019-11-20 03:31:50,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:50,667 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-20 03:31:50,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:50,752 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.4 percent of original size [2019-11-20 03:31:50,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:50,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:50,772 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:31:50,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:50,788 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-20 03:31:50,788 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:50,855 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.2 percent of original size [2019-11-20 03:31:50,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:50,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:50,881 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-20 03:31:50,882 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:50,928 INFO L567 ElimStorePlain]: treesize reduction 24, result has 73.3 percent of original size [2019-11-20 03:31:50,928 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-20 03:31:50,929 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:63 [2019-11-20 03:31:51,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:51,054 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-20 03:31:51,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:51,234 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 03:31:51,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:51,239 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-20 03:31:51,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:51,284 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-20 03:31:51,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:51,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:51,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:51,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:51,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:51,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:51,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:51,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:51,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:51,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:51,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:51,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:51,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-20 03:31:51,893 WARN L191 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-11-20 03:31:51,893 INFO L567 ElimStorePlain]: treesize reduction 3609, result has 10.4 percent of original size [2019-11-20 03:31:51,909 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 413 treesize of output 395 [2019-11-20 03:31:51,910 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:52,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:52,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:52,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:52,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:52,011 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:31:52,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:52,075 INFO L343 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-11-20 03:31:52,075 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-20 03:31:52,076 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:52,218 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-20 03:31:52,218 INFO L567 ElimStorePlain]: treesize reduction 41, result has 86.2 percent of original size [2019-11-20 03:31:52,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:52,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:52,359 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-20 03:31:52,359 INFO L343 Elim1Store]: treesize reduction 33, result has 82.0 percent of original size [2019-11-20 03:31:52,359 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-20 03:31:52,361 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:52,477 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-20 03:31:52,477 INFO L567 ElimStorePlain]: treesize reduction 168, result has 38.5 percent of original size [2019-11-20 03:31:52,478 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-20 03:31:52,478 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:454, output treesize:102 [2019-11-20 03:31:52,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:52,660 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-20 03:31:52,661 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-20 03:31:52,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:52,691 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-20 03:31:52,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:172, output treesize:88 [2019-11-20 03:31:52,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:52,810 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-20 03:31:52,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:52,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:52,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:52,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:52,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:52,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:52,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:31:52,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:52,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:52,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:52,823 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-20 03:31:52,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:4 [2019-11-20 03:31:52,839 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-20 03:31:52,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:31:52,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-20 03:31:52,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468539796] [2019-11-20 03:31:52,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 03:31:52,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:52,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 03:31:52,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-20 03:31:52,841 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-11-20 03:31:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:54,050 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-11-20 03:31:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 03:31:54,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-11-20 03:31:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:54,052 INFO L225 Difference]: With dead ends: 105 [2019-11-20 03:31:54,052 INFO L226 Difference]: Without dead ends: 103 [2019-11-20 03:31:54,052 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-20 03:31:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-20 03:31:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2019-11-20 03:31:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 03:31:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-11-20 03:31:54,059 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 28 [2019-11-20 03:31:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:54,060 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-11-20 03:31:54,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 03:31:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-11-20 03:31:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 03:31:54,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:54,061 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-20 03:31:54,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:31:54,266 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-20 03:31:54,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1572363688, now seen corresponding path program 1 times [2019-11-20 03:31:54,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:54,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524563150] [2019-11-20 03:31:54,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:54,690 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-11-20 03:31:55,051 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-20 03:31:55,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524563150] [2019-11-20 03:31:55,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635134367] [2019-11-20 03:31:55,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/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-20 03:31:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:55,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 03:31:55,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:31:55,155 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:31:55,156 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-20 03:31:55,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,165 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-20 03:31:55,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-11-20 03:31:55,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,233 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-20 03:31:55,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:55,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:55,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:31:55,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,296 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-20 03:31:55,296 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,335 INFO L567 ElimStorePlain]: treesize reduction 22, result has 85.2 percent of original size [2019-11-20 03:31:55,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:55,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:55,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,363 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-20 03:31:55,363 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,395 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-20 03:31:55,396 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-20 03:31:55,396 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:203, output treesize:45 [2019-11-20 03:31:55,440 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|]} [2019-11-20 03:31:55,452 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-20 03:31:55,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,531 INFO L343 Elim1Store]: treesize reduction 74, result has 47.5 percent of original size [2019-11-20 03:31:55,531 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-20 03:31:55,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:31:55,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,553 INFO L567 ElimStorePlain]: treesize reduction 40, result has 71.2 percent of original size [2019-11-20 03:31:55,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,566 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-20 03:31:55,567 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,583 INFO L567 ElimStorePlain]: treesize reduction 64, result has 48.4 percent of original size [2019-11-20 03:31:55,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,584 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:60 [2019-11-20 03:31:55,684 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,684 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-20 03:31:55,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,693 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-20 03:31:55,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,700 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-20 03:31:55,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:9 [2019-11-20 03:31:55,723 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-20 03:31:55,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:55,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:55,727 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-20 03:31:55,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 03:31:55,751 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-20 03:31:55,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:31:55,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-11-20 03:31:55,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140196809] [2019-11-20 03:31:55,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 03:31:55,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:31:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 03:31:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-11-20 03:31:55,752 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 21 states. [2019-11-20 03:31:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:31:57,642 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-11-20 03:31:57,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 03:31:57,643 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-20 03:31:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:31:57,645 INFO L225 Difference]: With dead ends: 127 [2019-11-20 03:31:57,645 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 03:31:57,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 03:31:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 03:31:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 78. [2019-11-20 03:31:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-20 03:31:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-11-20 03:31:57,668 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 28 [2019-11-20 03:31:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:31:57,668 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-11-20 03:31:57,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 03:31:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-11-20 03:31:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 03:31:57,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:31:57,674 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-20 03:31:57,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:31:57,879 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-20 03:31:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:31:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash 120690651, now seen corresponding path program 2 times [2019-11-20 03:31:57,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:31:57,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351496100] [2019-11-20 03:31:57,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:31:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:31:58,169 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-20 03:31:58,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351496100] [2019-11-20 03:31:58,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471579208] [2019-11-20 03:31:58,170 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/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-20 03:31:58,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:31:58,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:31:58,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-20 03:31:58,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:31:58,273 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 03:31:58,273 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-20 03:31:58,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:58,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:58,288 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-20 03:31:58,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-20 03:31:58,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:58,361 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-20 03:31:58,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:58,456 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-11-20 03:31:58,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:58,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 03:31:58,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:58,488 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-20 03:31:58,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:58,583 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-11-20 03:31:58,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:31:58,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:58,601 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-20 03:31:58,602 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:58,664 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-11-20 03:31:58,664 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-20 03:31:58,664 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:66 [2019-11-20 03:31:58,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:58,793 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-20 03:31:58,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:31:59,187 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-20 03:31:59,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:59,194 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-20 03:31:59,207 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-20 03:31:59,723 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-20 03:31:59,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:31:59,815 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-20 03:31:59,815 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:00,063 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-20 03:32:00,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:00,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:00,106 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-20 03:32:00,107 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:00,302 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-20 03:32:00,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:00,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:00,320 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-20 03:32:00,320 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:00,614 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-20 03:32:00,614 INFO L567 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2019-11-20 03:32:00,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:00,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 03:32:00,625 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:00,843 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-20 03:32:00,843 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2019-11-20 03:32:00,863 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-20 03:32:00,864 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:00,969 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-20 03:32:00,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:01,116 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-20 03:32:01,117 INFO L343 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2019-11-20 03:32:01,117 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-20 03:32:01,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,125 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-20 03:32:01,260 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-11-20 03:32:01,260 INFO L567 ElimStorePlain]: treesize reduction 1788, result has 16.4 percent of original size [2019-11-20 03:32:01,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:01,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:01,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:01,273 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 145 treesize of output 115 [2019-11-20 03:32:01,274 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:01,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:01,315 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-20 03:32:01,315 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:131 [2019-11-20 03:32:01,397 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-11-20 03:32:01,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:01,406 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-20 03:32:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:32:01,409 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-20 03:32:01,450 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-11-20 03:32:01,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 03:32:01,453 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-20 03:32:01,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:01,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:01,468 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-20 03:32:01,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2019-11-20 03:32:01,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:32:01,496 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-20 03:32:01,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:32:01,503 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-20 03:32:01,503 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-20 03:32:01,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-20 03:32:01,527 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-20 03:32:01,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:32:01,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-20 03:32:01,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764644539] [2019-11-20 03:32:01,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 03:32:01,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:32:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 03:32:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:32:01,529 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 14 states. [2019-11-20 03:32:02,111 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-20 03:32:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:32:02,392 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-11-20 03:32:02,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:32:02,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-20 03:32:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:32:02,393 INFO L225 Difference]: With dead ends: 124 [2019-11-20 03:32:02,394 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 03:32:02,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-20 03:32:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 03:32:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2019-11-20 03:32:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 03:32:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2019-11-20 03:32:02,414 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 31 [2019-11-20 03:32:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:32:02,414 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2019-11-20 03:32:02,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 03:32:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2019-11-20 03:32:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 03:32:02,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:32:02,417 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-20 03:32:02,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:32:02,622 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-20 03:32:02,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:32:02,622 INFO L82 PathProgramCache]: Analyzing trace with hash -994395513, now seen corresponding path program 1 times [2019-11-20 03:32:02,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:32:02,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677198235] [2019-11-20 03:32:02,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:32:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:32:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:32:02,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:32:02,700 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 03:32:02,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:32:02 BoogieIcfgContainer [2019-11-20 03:32:02,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:32:02,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:32:02,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:32:02,753 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:32:02,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:31:45" (3/4) ... [2019-11-20 03:32:02,755 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 03:32:02,808 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_873ba516-676f-45ec-bf9b-ca210095284d/bin/uautomizer/witness.graphml [2019-11-20 03:32:02,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:32:02,810 INFO L168 Benchmark]: Toolchain (without parser) took 18737.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -249.5 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:32:02,810 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:32:02,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:32:02,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:32:02,812 INFO L168 Benchmark]: Boogie Preprocessor took 34.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:32:02,812 INFO L168 Benchmark]: RCFGBuilder took 513.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:32:02,812 INFO L168 Benchmark]: TraceAbstraction took 17614.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:32:02,813 INFO L168 Benchmark]: Witness Printer took 56.26 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: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:32:02,815 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 513.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17614.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Witness Printer took 56.26 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: 2.8 MB). Peak memory consumption was 2.8 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.5s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 5.9s, 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.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 160 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.4s 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...