./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/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_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/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-1dbac8b [2018-11-10 09:37:00,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:37:00,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:37:00,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:37:00,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:37:00,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:37:00,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:37:00,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:37:00,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:37:00,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:37:00,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:37:00,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:37:00,973 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:37:00,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:37:00,974 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:37:00,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:37:00,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:37:00,977 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:37:00,978 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:37:00,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:37:00,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:37:00,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:37:00,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:37:00,982 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:37:00,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:37:00,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:37:00,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:37:00,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:37:00,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:37:00,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:37:00,986 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:37:00,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:37:00,986 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:37:00,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:37:00,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:37:00,988 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:37:00,988 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 09:37:00,998 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:37:00,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:37:00,999 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:37:00,999 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 09:37:00,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:37:00,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:37:01,000 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:37:01,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:37:01,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:37:01,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:37:01,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:37:01,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:37:01,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:37:01,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:37:01,001 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:37:01,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:37:01,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:37:01,001 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:37:01,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:37:01,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:37:01,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:37:01,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:37:01,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:37:01,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:37:01,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:37:01,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:37:01,002 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:37:01,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:37:01,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:37:01,003 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_c4980ca9-30c3-4a4a-a665-b7551586dd9d/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-10 09:37:01,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:37:01,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:37:01,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:37:01,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:37:01,040 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:37:01,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-10 09:37:01,087 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/data/95ac2bca4/2e985841535143c7b141980052045506/FLAGbfc9b1429 [2018-11-10 09:37:01,460 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:37:01,461 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-10 09:37:01,471 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/data/95ac2bca4/2e985841535143c7b141980052045506/FLAGbfc9b1429 [2018-11-10 09:37:01,480 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/data/95ac2bca4/2e985841535143c7b141980052045506 [2018-11-10 09:37:01,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:37:01,484 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 09:37:01,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:37:01,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:37:01,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:37:01,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604393ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01, skipping insertion in model container [2018-11-10 09:37:01,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:37:01,531 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:37:01,703 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:37:01,710 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:37:01,737 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:37:01,763 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:37:01,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01 WrapperNode [2018-11-10 09:37:01,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:37:01,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:37:01,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:37:01,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:37:01,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (1/1) ... [2018-11-10 09:37:01,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:37:01,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:37:01,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:37:01,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:37:01,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/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-10 09:37:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:37:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:37:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 09:37:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 09:37:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 09:37:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 09:37:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 09:37:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 09:37:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 09:37:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 09:37:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 09:37:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 09:37:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 09:37:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 09:37:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 09:37:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:37:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:37:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 09:37:02,216 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:37:02,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:37:02 BoogieIcfgContainer [2018-11-10 09:37:02,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:37:02,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:37:02,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:37:02,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:37:02,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:37:01" (1/3) ... [2018-11-10 09:37:02,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4b78e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:37:02, skipping insertion in model container [2018-11-10 09:37:02,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:37:01" (2/3) ... [2018-11-10 09:37:02,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4b78e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:37:02, skipping insertion in model container [2018-11-10 09:37:02,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:37:02" (3/3) ... [2018-11-10 09:37:02,223 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-10 09:37:02,233 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:37:02,240 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-10 09:37:02,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-10 09:37:02,276 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:37:02,277 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:37:02,277 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:37:02,277 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:37:02,277 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:37:02,277 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:37:02,278 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:37:02,278 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:37:02,278 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:37:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2018-11-10 09:37:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 09:37:02,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:02,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:37:02,298 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:02,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash -480902525, now seen corresponding path program 1 times [2018-11-10 09:37:02,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:02,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:02,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:02,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:02,409 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-10 09:37:02,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:37:02,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:37:02,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 09:37:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 09:37:02,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 09:37:02,423 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2018-11-10 09:37:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:02,438 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2018-11-10 09:37:02,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 09:37:02,439 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-10 09:37:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:02,446 INFO L225 Difference]: With dead ends: 134 [2018-11-10 09:37:02,446 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 09:37:02,449 INFO L605 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-10 09:37:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 09:37:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-10 09:37:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 09:37:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-11-10 09:37:02,481 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 19 [2018-11-10 09:37:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:02,481 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-11-10 09:37:02,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 09:37:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-11-10 09:37:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 09:37:02,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:02,482 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] [2018-11-10 09:37:02,482 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:02,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:02,482 INFO L82 PathProgramCache]: Analyzing trace with hash 883176745, now seen corresponding path program 1 times [2018-11-10 09:37:02,482 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:02,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:02,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:02,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:02,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:02,608 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-10 09:37:02,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:37:02,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 09:37:02,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:37:02,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:37:02,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:37:02,610 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 7 states. [2018-11-10 09:37:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:02,793 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-11-10 09:37:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:37:02,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-10 09:37:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:02,795 INFO L225 Difference]: With dead ends: 79 [2018-11-10 09:37:02,795 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 09:37:02,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:37:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 09:37:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2018-11-10 09:37:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 09:37:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-11-10 09:37:02,803 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 21 [2018-11-10 09:37:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:02,803 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-11-10 09:37:02,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:37:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-10 09:37:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:37:02,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:02,804 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, 1, 1, 1] [2018-11-10 09:37:02,804 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:02,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash 924415214, now seen corresponding path program 1 times [2018-11-10 09:37:02,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:02,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:02,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:02,982 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-10 09:37:02,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:37:02,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 09:37:02,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 09:37:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:37:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:37:02,983 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 10 states. [2018-11-10 09:37:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:03,217 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-11-10 09:37:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:37:03,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-10 09:37:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:03,219 INFO L225 Difference]: With dead ends: 118 [2018-11-10 09:37:03,219 INFO L226 Difference]: Without dead ends: 116 [2018-11-10 09:37:03,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-10 09:37:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-10 09:37:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 79. [2018-11-10 09:37:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 09:37:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-10 09:37:03,228 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 25 [2018-11-10 09:37:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:03,228 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-10 09:37:03,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 09:37:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-10 09:37:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 09:37:03,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:03,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:37:03,230 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:03,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:03,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2069445202, now seen corresponding path program 1 times [2018-11-10 09:37:03,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:03,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:03,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:03,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:03,338 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-10 09:37:03,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:37:03,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:37:03,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:37:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:37:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:37:03,340 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-11-10 09:37:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:03,391 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-10 09:37:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:37:03,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 09:37:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:03,397 INFO L225 Difference]: With dead ends: 112 [2018-11-10 09:37:03,397 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 09:37:03,397 INFO L605 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-10 09:37:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 09:37:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-11-10 09:37:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 09:37:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-11-10 09:37:03,404 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 34 [2018-11-10 09:37:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:03,405 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-11-10 09:37:03,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:37:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-11-10 09:37:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 09:37:03,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:03,406 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:37:03,406 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:03,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:03,406 INFO L82 PathProgramCache]: Analyzing trace with hash -229254952, now seen corresponding path program 1 times [2018-11-10 09:37:03,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:03,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:03,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:03,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:03,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:37:03,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:37:03,487 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/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-10 09:37:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:03,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:37:03,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:37:03,562 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-10 09:37:03,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:37:03,576 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-10 09:37:03,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-10 09:37:03,599 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-10 09:37:03,601 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-10 09:37:03,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,608 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-10 09:37:03,610 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-10 09:37:03,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:03,614 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-10 09:37:03,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-10 09:37:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:37:03,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:37:03,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 09:37:03,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:37:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:37:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:37:03,646 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-11-10 09:37:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:03,738 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-11-10 09:37:03,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 09:37:03,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-10 09:37:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:03,739 INFO L225 Difference]: With dead ends: 123 [2018-11-10 09:37:03,739 INFO L226 Difference]: Without dead ends: 88 [2018-11-10 09:37:03,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:37:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-10 09:37:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-10 09:37:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 09:37:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-11-10 09:37:03,746 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 40 [2018-11-10 09:37:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:03,746 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-11-10 09:37:03,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:37:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-10 09:37:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 09:37:03,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:03,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:37:03,748 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:03,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash 484957454, now seen corresponding path program 1 times [2018-11-10 09:37:03,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:03,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:03,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:04,228 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-10 09:37:04,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:37:04,228 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/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-10 09:37:04,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:04,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:37:04,258 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 6 treesize of output 5 [2018-11-10 09:37:04,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 09:37:04,312 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 09:37:04,314 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-10 09:37:04,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 09:37:04,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:04,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:04,343 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-10 09:37:04,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-10 09:37:04,380 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:37:04,381 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-10 09:37:04,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,390 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-10 09:37:04,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-11-10 09:37:04,414 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 25 treesize of output 19 [2018-11-10 09:37:04,416 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 19 treesize of output 10 [2018-11-10 09:37:04,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,424 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-10 09:37:04,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:24 [2018-11-10 09:37:04,463 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 23 treesize of output 24 [2018-11-10 09:37:04,464 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-10 09:37:04,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-11-10 09:37:04,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:04,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:04,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:04,494 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-10 09:37:04,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-11-10 09:37:04,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:37:04,521 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-10 09:37:04,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,530 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-10 09:37:04,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:39 [2018-11-10 09:37:04,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 18 [2018-11-10 09:37:04,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 9 [2018-11-10 09:37:04,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:37:04,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2018-11-10 09:37:04,635 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-10 09:37:04,637 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-10 09:37:04,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 09:37:04,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-11-10 09:37:04,728 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-10 09:37:04,731 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-10 09:37:04,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,742 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-10 09:37:04,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,749 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-10 09:37:04,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:04,757 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-10 09:37:04,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-11-10 09:37:04,770 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-10 09:37:04,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:37:04,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-11-10 09:37:04,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 09:37:04,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 09:37:04,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 09:37:04,800 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 34 states. [2018-11-10 09:37:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:06,548 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-11-10 09:37:06,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 09:37:06,549 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2018-11-10 09:37:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:06,550 INFO L225 Difference]: With dead ends: 158 [2018-11-10 09:37:06,550 INFO L226 Difference]: Without dead ends: 156 [2018-11-10 09:37:06,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=897, Invalid=3525, Unknown=0, NotChecked=0, Total=4422 [2018-11-10 09:37:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-10 09:37:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 66. [2018-11-10 09:37:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 09:37:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-10 09:37:06,555 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 42 [2018-11-10 09:37:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:06,555 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-10 09:37:06,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 09:37:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-10 09:37:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 09:37:06,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:06,556 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:37:06,557 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:06,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 233738357, now seen corresponding path program 1 times [2018-11-10 09:37:06,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:06,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:06,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:37:06,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:37:06,981 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/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-10 09:37:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:07,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:37:07,027 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 6 treesize of output 5 [2018-11-10 09:37:07,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 09:37:07,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:07,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:07,065 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-10 09:37:07,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-10 09:37:07,090 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 11 treesize of output 8 [2018-11-10 09:37:07,092 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-10 09:37:07,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,102 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 11 treesize of output 8 [2018-11-10 09:37:07,104 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-10 09:37:07,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-11-10 09:37:07,135 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 24 [2018-11-10 09:37:07,137 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-10 09:37:07,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,151 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 30 treesize of output 31 [2018-11-10 09:37:07,153 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-10 09:37:07,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-11-10 09:37:07,180 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-10 09:37:07,182 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-10 09:37:07,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2018-11-10 09:37:07,224 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-10 09:37:07,226 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-10 09:37:07,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,237 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-10 09:37:07,240 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-10 09:37:07,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,251 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-10 09:37:07,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:11 [2018-11-10 09:37:07,289 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-10 09:37:07,291 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-10 09:37:07,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:07,293 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-10 09:37:07,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 09:37:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:37:07,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:37:07,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 27 [2018-11-10 09:37:07,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 09:37:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 09:37:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-11-10 09:37:07,325 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 27 states. [2018-11-10 09:37:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:08,320 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-11-10 09:37:08,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 09:37:08,321 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-11-10 09:37:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:08,322 INFO L225 Difference]: With dead ends: 147 [2018-11-10 09:37:08,322 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 09:37:08,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1793, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 09:37:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 09:37:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 91. [2018-11-10 09:37:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 09:37:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-11-10 09:37:08,330 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 51 [2018-11-10 09:37:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:08,330 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-11-10 09:37:08,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 09:37:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-10 09:37:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 09:37:08,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:08,333 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:37:08,333 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:08,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1797663928, now seen corresponding path program 1 times [2018-11-10 09:37:08,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:08,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:08,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:37:08,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:37:08,831 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/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-10 09:37:08,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:08,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:37:08,864 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 6 treesize of output 5 [2018-11-10 09:37:08,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:08,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:08,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 09:37:08,909 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-10 09:37:08,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:08,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:08,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-11-10 09:37:08,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:08,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:08,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:08,974 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-10 09:37:08,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:08,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:08,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:30 [2018-11-10 09:37:09,009 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:37:09,010 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-10 09:37:09,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:37:09,025 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-10 09:37:09,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,034 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-10 09:37:09,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-11-10 09:37:09,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:09,122 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 44 treesize of output 45 [2018-11-10 09:37:09,124 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 11 [2018-11-10 09:37:09,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:09,152 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 30 treesize of output 35 [2018-11-10 09:37:09,159 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 15 [2018-11-10 09:37:09,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:76 [2018-11-10 09:37:09,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:09,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:09,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:09,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:09,219 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-10 09:37:09,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:73 [2018-11-10 09:37:09,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:09,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:09,265 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 74 [2018-11-10 09:37:09,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-10 09:37:09,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2018-11-10 09:37:09,294 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 22 treesize of output 23 [2018-11-10 09:37:09,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,308 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-10 09:37:09,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:71 [2018-11-10 09:37:09,402 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 110 [2018-11-10 09:37:09,404 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 20 treesize of output 19 [2018-11-10 09:37:09,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,423 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 107 treesize of output 95 [2018-11-10 09:37:09,425 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 20 treesize of output 19 [2018-11-10 09:37:09,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:37:09,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:88 [2018-11-10 09:37:09,608 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 19 treesize of output 15 [2018-11-10 09:37:09,610 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-10 09:37:09,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:37:09,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:91 [2018-11-10 09:37:09,694 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 79 treesize of output 69 [2018-11-10 09:37:09,696 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 69 treesize of output 56 [2018-11-10 09:37:09,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,707 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-10 09:37:09,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:79 [2018-11-10 09:37:09,794 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-10 09:37:09,796 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 21 treesize of output 15 [2018-11-10 09:37:09,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 9 [2018-11-10 09:37:09,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,805 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-10 09:37:09,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:09,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:4 [2018-11-10 09:37:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:37:09,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:37:09,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2018-11-10 09:37:09,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-10 09:37:09,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-10 09:37:09,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 09:37:09,852 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 45 states. [2018-11-10 09:37:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:12,882 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-11-10 09:37:12,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 09:37:12,882 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 57 [2018-11-10 09:37:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:12,883 INFO L225 Difference]: With dead ends: 170 [2018-11-10 09:37:12,883 INFO L226 Difference]: Without dead ends: 168 [2018-11-10 09:37:12,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=885, Invalid=4967, Unknown=0, NotChecked=0, Total=5852 [2018-11-10 09:37:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-10 09:37:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2018-11-10 09:37:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 09:37:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-11-10 09:37:12,891 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 57 [2018-11-10 09:37:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:12,891 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-11-10 09:37:12,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-10 09:37:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-11-10 09:37:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 09:37:12,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:12,892 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:37:12,893 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:12,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash -199871905, now seen corresponding path program 2 times [2018-11-10 09:37:12,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:12,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:12,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:37:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:37:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:37:13,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:37:13,048 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:37:13,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:37:13,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:37:13,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:37:13,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:37:13,124 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 6 treesize of output 5 [2018-11-10 09:37:13,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 09:37:13,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:13,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:37:13,189 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-10 09:37:13,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-10 09:37:13,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:37:13,224 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-10 09:37:13,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,235 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:37:13,236 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-10 09:37:13,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,245 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-10 09:37:13,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:21 [2018-11-10 09:37:13,313 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-10 09:37:13,314 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-10 09:37:13,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,326 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 39 treesize of output 40 [2018-11-10 09:37:13,328 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-10 09:37:13,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:45 [2018-11-10 09:37:13,452 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-11-10 09:37:13,454 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 19 treesize of output 3 [2018-11-10 09:37:13,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,461 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-10 09:37:13,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:37:13,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:37:13,478 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 23 treesize of output 19 [2018-11-10 09:37:13,480 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:37:13,480 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:37:13,485 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-10 09:37:13,485 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,487 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:37:13,492 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:72, output treesize:10 [2018-11-10 09:37:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:37:13,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:37:13,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-11-10 09:37:13,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 09:37:13,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 09:37:13,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2018-11-10 09:37:13,556 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 30 states. [2018-11-10 09:37:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:37:14,128 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-11-10 09:37:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 09:37:14,128 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2018-11-10 09:37:14,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:37:14,129 INFO L225 Difference]: With dead ends: 156 [2018-11-10 09:37:14,129 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 09:37:14,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1741, Unknown=0, NotChecked=0, Total=2070 [2018-11-10 09:37:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 09:37:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2018-11-10 09:37:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-10 09:37:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-11-10 09:37:14,137 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 57 [2018-11-10 09:37:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:37:14,137 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-11-10 09:37:14,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 09:37:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-11-10 09:37:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 09:37:14,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:37:14,138 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:37:14,138 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:37:14,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:37:14,139 INFO L82 PathProgramCache]: Analyzing trace with hash -440343875, now seen corresponding path program 1 times [2018-11-10 09:37:14,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:37:14,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:37:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:14,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:37:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:37:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:37:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:37:14,173 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 09:37:14,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:37:14 BoogieIcfgContainer [2018-11-10 09:37:14,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:37:14,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:37:14,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:37:14,207 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:37:14,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:37:02" (3/4) ... [2018-11-10 09:37:14,210 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 09:37:14,243 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c4980ca9-30c3-4a4a-a665-b7551586dd9d/bin-2019/uautomizer/witness.graphml [2018-11-10 09:37:14,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:37:14,244 INFO L168 Benchmark]: Toolchain (without parser) took 12760.39 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 442.5 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -62.8 MB). Peak memory consumption was 379.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:37:14,246 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:37:14,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.37 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 933.4 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:37:14,246 INFO L168 Benchmark]: Boogie Preprocessor took 74.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 933.4 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:37:14,246 INFO L168 Benchmark]: RCFGBuilder took 377.90 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: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:37:14,246 INFO L168 Benchmark]: TraceAbstraction took 11988.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.9 MB). Peak memory consumption was 353.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:37:14,247 INFO L168 Benchmark]: Witness Printer took 36.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:37:14,248 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.37 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 933.4 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 933.4 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 377.90 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: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11988.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.9 MB). Peak memory consumption was 353.5 MB. Max. memory is 11.5 GB. * Witness Printer took 36.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 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)) VAL [malloc(sizeof(SLL))={11:0}] [L994] SLL* null = malloc(sizeof(SLL)); VAL [malloc(sizeof(SLL))={11:0}, null={11:0}] [L995] FCALL null->colour = BLACK VAL [malloc(sizeof(SLL))={11:0}, null={11:0}] [L996] FCALL null->next = ((void*)0) VAL [malloc(sizeof(SLL))={11:0}, null={11:0}] [L998] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L998] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L999] FCALL list->next = null VAL [list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1000] FCALL list->colour = BLACK VAL [list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1002] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1008] FCALL end->next = malloc(sizeof(SLL)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1009] EXPR, FCALL end->next VAL [end={10:0}, end->next={13:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1009] end = end->next [L1010] FCALL end->next = null VAL [end={13:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] FCALL end->colour = RED VAL [end={13:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1019] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={13:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1019] FCALL end->next = malloc(sizeof(SLL)) VAL [end={13:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1020] EXPR, FCALL end->next VAL [end={13:0}, end->next={12:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1020] end = end->next [L1021] FCALL end->next = null VAL [end={12:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1022] FCALL end->colour = BLACK VAL [end={12:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1030] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1031] EXPR, FCALL end->colour VAL [end={10:0}, end->colour=1, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1033] COND TRUE null != end VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1035] EXPR, FCALL end->colour VAL [end={10:0}, end->colour=1, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR, FCALL end->next VAL [end={10:0}, end->next={13:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1042] end = end->next [L1033] COND TRUE null != end VAL [end={13:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1035] EXPR, FCALL end->colour VAL [end={13:0}, end->colour=0, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1035] COND TRUE RED == end->colour [L1037] EXPR, FCALL end->next VAL [end={13:0}, end->next={12:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) VAL [end={12:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1038] COND FALSE !(0) VAL [end={12:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1039] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() VAL [end={12:0}, list={10:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, null={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 4 error locations. UNSAFE Result, 11.9s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 483 SDtfs, 3397 SDslu, 3770 SDs, 0 SdLazy, 4236 SolverSat, 699 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 189 SyntacticMatches, 18 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2683 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred 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, 9 MinimizatonAttempts, 243 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 654 NumberOfCodeBlocks, 654 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 579 ConstructedInterpolants, 41 QuantifiedInterpolants, 570115 SizeOfPredicates, 88 NumberOfNonLiveVariables, 699 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 12/76 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...