./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/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 d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-5842f4b [2018-11-18 08:52:37,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:52:37,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:52:37,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:52:37,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:52:38,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:52:38,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:52:38,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:52:38,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:52:38,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:52:38,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:52:38,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:52:38,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:52:38,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:52:38,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:52:38,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:52:38,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:52:38,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:52:38,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:52:38,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:52:38,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:52:38,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:52:38,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:52:38,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:52:38,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:52:38,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:52:38,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:52:38,016 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:52:38,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:52:38,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:52:38,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:52:38,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:52:38,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:52:38,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:52:38,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:52:38,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:52:38,019 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 08:52:38,029 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:52:38,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:52:38,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:52:38,030 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 08:52:38,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:52:38,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:52:38,030 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:52:38,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:52:38,031 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:52:38,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:52:38,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:52:38,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:52:38,031 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:52:38,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:52:38,031 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:52:38,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:52:38,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:52:38,032 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:52:38,032 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:52:38,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:52:38,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:52:38,032 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:52:38,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:52:38,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:52:38,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:52:38,033 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:52:38,033 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:52:38,033 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:52:38,033 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:52:38,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:52:38,033 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/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 -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2018-11-18 08:52:38,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:52:38,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:52:38,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:52:38,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:52:38,068 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:52:38,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-18 08:52:38,103 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/data/decc425db/5f926590a29e4ad28e45193295f261ab/FLAG8daa9cefa [2018-11-18 08:52:38,537 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:52:38,538 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-18 08:52:38,545 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/data/decc425db/5f926590a29e4ad28e45193295f261ab/FLAG8daa9cefa [2018-11-18 08:52:38,553 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/data/decc425db/5f926590a29e4ad28e45193295f261ab [2018-11-18 08:52:38,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:52:38,556 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:52:38,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:52:38,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:52:38,559 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:52:38,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcb2ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38, skipping insertion in model container [2018-11-18 08:52:38,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:52:38,594 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:52:38,777 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:52:38,784 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:52:38,815 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:52:38,889 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:52:38,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38 WrapperNode [2018-11-18 08:52:38,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:52:38,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:52:38,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:52:38,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:52:38,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (1/1) ... [2018-11-18 08:52:38,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:52:38,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:52:38,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:52:38,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:52:38,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/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 [2018-11-18 08:52:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:52:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:52:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:52:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 08:52:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 08:52:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 08:52:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 08:52:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 08:52:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 08:52:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 08:52:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 08:52:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 08:52:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 08:52:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 08:52:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 08:52:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 08:52:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 08:52:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 08:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 08:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 08:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 08:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 08:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 08:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 08:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 08:52:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 08:52:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 08:52:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 08:52:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 08:52:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:52:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:52:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:52:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:52:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 08:52:39,273 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:52:39,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:39 BoogieIcfgContainer [2018-11-18 08:52:39,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:52:39,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:52:39,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:52:39,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:52:39,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:52:38" (1/3) ... [2018-11-18 08:52:39,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453a99c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:52:39, skipping insertion in model container [2018-11-18 08:52:39,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:38" (2/3) ... [2018-11-18 08:52:39,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453a99c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:52:39, skipping insertion in model container [2018-11-18 08:52:39,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:39" (3/3) ... [2018-11-18 08:52:39,277 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-18 08:52:39,283 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:52:39,288 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-18 08:52:39,296 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-18 08:52:39,316 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:52:39,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:52:39,317 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:52:39,317 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:52:39,317 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:52:39,317 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:52:39,317 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:52:39,317 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:52:39,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:52:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-18 08:52:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 08:52:39,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:39,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:52:39,336 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:39,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1661948617, now seen corresponding path program 1 times [2018-11-18 08:52:39,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:39,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:39,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:52:39,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:52:39,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 08:52:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 08:52:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 08:52:39,446 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-18 08:52:39,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:52:39,460 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2018-11-18 08:52:39,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 08:52:39,461 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 08:52:39,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:52:39,469 INFO L225 Difference]: With dead ends: 76 [2018-11-18 08:52:39,469 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 08:52:39,471 INFO L604 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 [2018-11-18 08:52:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 08:52:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 08:52:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 08:52:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-18 08:52:39,492 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 11 [2018-11-18 08:52:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:52:39,493 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-18 08:52:39,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 08:52:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 08:52:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 08:52:39,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:39,493 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:52:39,493 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:39,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:39,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1467291523, now seen corresponding path program 1 times [2018-11-18 08:52:39,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:39,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:39,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:39,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:52:39,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:52:39,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:52:39,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:52:39,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:52:39,559 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-11-18 08:52:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:52:39,634 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-18 08:52:39,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:52:39,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-18 08:52:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:52:39,635 INFO L225 Difference]: With dead ends: 43 [2018-11-18 08:52:39,635 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 08:52:39,636 INFO L604 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 [2018-11-18 08:52:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 08:52:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-11-18 08:52:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 08:52:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-18 08:52:39,639 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2018-11-18 08:52:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:52:39,640 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-18 08:52:39,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:52:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-18 08:52:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 08:52:39,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:39,640 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:52:39,641 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:39,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2099325391, now seen corresponding path program 1 times [2018-11-18 08:52:39,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:39,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:39,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:39,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:39,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:52:39,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:52:39,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:52:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:52:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:52:39,794 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 6 states. [2018-11-18 08:52:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:52:39,975 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-18 08:52:39,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:52:39,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 08:52:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:52:39,977 INFO L225 Difference]: With dead ends: 72 [2018-11-18 08:52:39,978 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 08:52:39,978 INFO L604 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 [2018-11-18 08:52:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 08:52:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 43. [2018-11-18 08:52:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 08:52:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-18 08:52:39,986 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 16 [2018-11-18 08:52:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:52:39,986 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-18 08:52:39,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:52:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 08:52:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 08:52:39,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:39,987 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:52:39,987 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:39,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:39,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2081243530, now seen corresponding path program 1 times [2018-11-18 08:52:39,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:39,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:39,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:40,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:52:40,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:52:40,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:40,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:52:40,267 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 08:52:40,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-11-18 08:52:40,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-18 08:52:40,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 08:52:40,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,328 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 08:52:40,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-18 08:52:40,336 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 08:52:40,375 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:43, output treesize:29 [2018-11-18 08:52:40,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:40,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:40,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 08:52:40,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-18 08:52:40,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:40,428 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:40,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:40,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 08:52:40,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-18 08:52:40,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 08:52:40,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-11-18 08:52:40,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 08:52:40,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,484 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 08:52:40,499 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:62, output treesize:40 [2018-11-18 08:52:40,563 INFO L477 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 41 [2018-11-18 08:52:40,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-11-18 08:52:40,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-18 08:52:40,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-11-18 08:52:40,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:40,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-11-18 08:52:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:40,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:52:40,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-11-18 08:52:40,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 08:52:40,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 08:52:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:52:40,605 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 12 states. [2018-11-18 08:52:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:52:40,989 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-18 08:52:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:52:40,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-18 08:52:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:52:40,990 INFO L225 Difference]: With dead ends: 80 [2018-11-18 08:52:40,990 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 08:52:40,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-11-18 08:52:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 08:52:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 31. [2018-11-18 08:52:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 08:52:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-18 08:52:40,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-11-18 08:52:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:52:40,996 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 08:52:40,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 08:52:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-18 08:52:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 08:52:40,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:40,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:52:40,999 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:40,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1966146467, now seen corresponding path program 1 times [2018-11-18 08:52:40,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:40,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:41,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:41,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:41,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:41,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:52:41,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:52:41,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:52:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:52:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:52:41,072 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-11-18 08:52:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:52:41,120 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-18 08:52:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:52:41,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 08:52:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:52:41,120 INFO L225 Difference]: With dead ends: 49 [2018-11-18 08:52:41,121 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 08:52:41,121 INFO L604 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 [2018-11-18 08:52:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 08:52:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-18 08:52:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 08:52:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-18 08:52:41,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 22 [2018-11-18 08:52:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:52:41,125 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-18 08:52:41,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:52:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-18 08:52:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:52:41,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:41,127 INFO L375 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] [2018-11-18 08:52:41,127 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:41,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash -294845851, now seen corresponding path program 1 times [2018-11-18 08:52:41,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:41,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:41,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:41,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:52:41,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:52:41,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:41,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:52:41,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 08:52:41,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:41,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,238 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 08:52:41,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-11-18 08:52:41,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-11-18 08:52:41,260 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 08:52:41,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:52:41,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:52:41,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 08:52:41,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:41,290 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,302 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 08:52:41,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-11-18 08:52:41,309 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-18 08:52:41,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 08:52:41,323 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,332 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:52:41,363 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:52:41,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 08:52:41,378 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:55, output treesize:107 [2018-11-18 08:52:41,422 INFO L477 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 29 treesize of output 25 [2018-11-18 08:52:41,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 08:52:41,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,441 INFO L477 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 18 treesize of output 14 [2018-11-18 08:52:41,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 08:52:41,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:73, output treesize:7 [2018-11-18 08:52:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:41,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:52:41,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 08:52:41,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 08:52:41,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:52:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:52:41,472 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 7 states. [2018-11-18 08:52:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:52:41,578 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-18 08:52:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:52:41,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-18 08:52:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:52:41,581 INFO L225 Difference]: With dead ends: 64 [2018-11-18 08:52:41,581 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 08:52:41,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:52:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 08:52:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 08:52:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 08:52:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-18 08:52:41,585 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 26 [2018-11-18 08:52:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:52:41,585 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-18 08:52:41,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 08:52:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-18 08:52:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 08:52:41,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:41,586 INFO L375 BasicCegarLoop]: trace histogram [2, 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] [2018-11-18 08:52:41,586 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:41,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:41,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1554757814, now seen corresponding path program 1 times [2018-11-18 08:52:41,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:41,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:41,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:41,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:41,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:41,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:52:41,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:52:41,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:41,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:52:41,831 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 08:52:41,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-11-18 08:52:41,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,851 INFO L267 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. [2018-11-18 08:52:41,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-11-18 08:52:41,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:41,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:41,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:52:41,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 08:52:41,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:41,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,884 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 08:52:41,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:41,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,891 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 08:52:41,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 08:52:41,906 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,913 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 08:52:41,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:41,915 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,921 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,924 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,931 INFO L267 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. [2018-11-18 08:52:41,931 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:68, output treesize:29 [2018-11-18 08:52:41,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-18 08:52:41,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 08:52:41,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:41,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2018-11-18 08:52:41,995 INFO L477 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 38 treesize of output 30 [2018-11-18 08:52:41,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 19 [2018-11-18 08:52:41,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,017 INFO L477 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 22 treesize of output 20 [2018-11-18 08:52:42,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 08:52:42,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:11 [2018-11-18 08:52:42,044 INFO L477 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 15 treesize of output 11 [2018-11-18 08:52:42,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 08:52:42,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 08:52:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:42,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:52:42,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-11-18 08:52:42,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 08:52:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 08:52:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-11-18 08:52:42,075 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 17 states. [2018-11-18 08:52:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:52:42,570 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-18 08:52:42,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 08:52:42,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-18 08:52:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:52:42,572 INFO L225 Difference]: With dead ends: 92 [2018-11-18 08:52:42,572 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 08:52:42,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-11-18 08:52:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 08:52:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 52. [2018-11-18 08:52:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 08:52:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-18 08:52:42,579 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 30 [2018-11-18 08:52:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:52:42,579 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-18 08:52:42,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 08:52:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-18 08:52:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 08:52:42,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:42,580 INFO L375 BasicCegarLoop]: trace histogram [2, 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] [2018-11-18 08:52:42,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:42,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1132055988, now seen corresponding path program 1 times [2018-11-18 08:52:42,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:42,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:42,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:42,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:52:42,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:52:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:52:42,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:52:42,762 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 08:52:42,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-11-18 08:52:42,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2018-11-18 08:52:42,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:42,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:42,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:42,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-18 08:52:42,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 08:52:42,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:42,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 08:52:42,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:42,875 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 08:52:42,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:42,903 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 08:52:42,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 08:52:42,913 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,917 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,920 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,934 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:82, output treesize:58 [2018-11-18 08:52:42,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:42,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:42,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:42,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:42,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-18 08:52:42,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:42,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:52:43,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 116 [2018-11-18 08:52:43,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 treesize of output 16 [2018-11-18 08:52:43,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,027 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 105 [2018-11-18 08:52:43,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:52:43,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,046 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,083 INFO L477 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 62 treesize of output 44 [2018-11-18 08:52:43,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 11 [2018-11-18 08:52:43,088 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,100 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-11-18 08:52:43,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 08:52:43,103 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,110 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,115 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:52:43,127 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:156, output treesize:94 [2018-11-18 08:52:43,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 08:52:43,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 08:52:43,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-18 08:52:43,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 08:52:43,210 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:108, output treesize:82 [2018-11-18 08:52:43,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 48 [2018-11-18 08:52:43,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-18 08:52:43,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 15 [2018-11-18 08:52:43,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-18 08:52:43,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:52:43,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:4 [2018-11-18 08:52:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:52:43,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:52:43,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-11-18 08:52:43,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 08:52:43,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 08:52:43,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-18 08:52:43,302 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 15 states. [2018-11-18 08:52:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:52:43,671 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-18 08:52:43,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 08:52:43,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-11-18 08:52:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:52:43,672 INFO L225 Difference]: With dead ends: 103 [2018-11-18 08:52:43,672 INFO L226 Difference]: Without dead ends: 101 [2018-11-18 08:52:43,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-11-18 08:52:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-18 08:52:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2018-11-18 08:52:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 08:52:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-11-18 08:52:43,682 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 30 [2018-11-18 08:52:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:52:43,683 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-18 08:52:43,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 08:52:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-18 08:52:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 08:52:43,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:52:43,684 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2018-11-18 08:52:43,684 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:52:43,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:52:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash -992731277, now seen corresponding path program 1 times [2018-11-18 08:52:43,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:52:43,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:52:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:52:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:52:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:52:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:52:43,724 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 08:52:43,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:52:43 BoogieIcfgContainer [2018-11-18 08:52:43,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:52:43,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:52:43,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:52:43,752 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:52:43,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:39" (3/4) ... [2018-11-18 08:52:43,754 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 08:52:43,783 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8e160853-9929-4e6c-bb3a-2a73f89b3ff5/bin-2019/uautomizer/witness.graphml [2018-11-18 08:52:43,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:52:43,784 INFO L168 Benchmark]: Toolchain (without parser) took 5228.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -115.0 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:52:43,784 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:52:43,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:52:43,785 INFO L168 Benchmark]: Boogie Preprocessor took 46.11 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:52:43,785 INFO L168 Benchmark]: RCFGBuilder took 336.80 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:52:43,785 INFO L168 Benchmark]: TraceAbstraction took 4478.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:52:43,785 INFO L168 Benchmark]: Witness Printer took 31.29 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: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:52:43,787 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.11 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 336.80 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4478.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * Witness Printer took 31.29 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: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) [L994] SLL* null = malloc(sizeof(SLL)); [L995] FCALL null->colour = BLACK [L996] FCALL null->next = ((void*)0) [L998] EXPR, FCALL malloc(sizeof(SLL)) [L998] SLL* list = malloc(sizeof(SLL)); [L999] FCALL list->next = null [L1000] FCALL list->colour = BLACK [L1002] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] EXPR, FCALL malloc(sizeof(SLL)) [L1008] FCALL end->next = malloc(sizeof(SLL)) [L1009] EXPR, FCALL end->next [L1009] end = end->next [L1010] FCALL end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] FCALL end->colour = RED [L1019] EXPR, FCALL malloc(sizeof(SLL)) [L1019] FCALL end->next = malloc(sizeof(SLL)) [L1020] EXPR, FCALL end->next [L1020] end = end->next [L1021] FCALL end->next = null [L1022] FCALL end->colour = BLACK VAL [end={14:0}, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1030] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1031] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1033] COND TRUE null != end [L1035] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR, FCALL end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR, FCALL end->colour VAL [end={10:0}, end->colour=0, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1035] COND TRUE RED == end->colour [L1037] EXPR, FCALL end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) VAL [end={14:0}, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1038] COND FALSE !(0) VAL [end={14:0}, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1039] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() VAL [end={14:0}, list={12:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}, null={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 4 error locations. UNSAFE Result, 4.4s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 263 SDtfs, 438 SDslu, 1078 SDs, 0 SdLazy, 802 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 138 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 262 ConstructedInterpolants, 25 QuantifiedInterpolants, 141978 SizeOfPredicates, 52 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 2/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...