./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_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_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b97bc973900e2f9596f533e03f1df56d5945f81 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b97bc973900e2f9596f533e03f1df56d5945f81 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-10-26 22:13:00,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:13:00,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:13:00,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:13:00,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:13:00,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:13:00,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:13:00,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:13:00,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:13:00,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:13:00,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:13:00,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:13:00,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:13:00,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:13:00,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:13:00,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:13:00,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:13:00,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:13:00,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:13:00,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:13:01,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:13:01,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:13:01,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:13:01,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:13:01,004 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:13:01,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:13:01,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:13:01,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:13:01,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:13:01,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:13:01,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:13:01,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:13:01,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:13:01,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:13:01,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:13:01,014 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:13:01,014 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:13:01,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:13:01,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:13:01,031 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:13:01,031 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:13:01,032 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:13:01,032 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:13:01,032 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:13:01,032 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:13:01,032 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:13:01,032 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:13:01,032 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:13:01,033 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:13:01,033 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:13:01,033 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:13:01,033 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:13:01,033 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:13:01,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:13:01,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:13:01,034 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:13:01,034 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:13:01,034 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:13:01,036 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:13:01,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:13:01,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:13:01,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:13:01,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:13:01,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:13:01,037 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:13:01,037 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:13:01,037 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:13:01,037 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:13:01,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:13:01,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:13:01,040 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:13:01,040 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan 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 -> Taipan 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 -> 1b97bc973900e2f9596f533e03f1df56d5945f81 [2018-10-26 22:13:01,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:13:01,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:13:01,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:13:01,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:13:01,101 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:13:01,101 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:13:01,156 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data/3a3b9efcc/90f610ea9a78409686ecebdda26f599c/FLAG20c15b2eb [2018-10-26 22:13:01,575 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:13:01,575 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:13:01,586 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data/3a3b9efcc/90f610ea9a78409686ecebdda26f599c/FLAG20c15b2eb [2018-10-26 22:13:01,598 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data/3a3b9efcc/90f610ea9a78409686ecebdda26f599c [2018-10-26 22:13:01,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:13:01,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:13:01,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:13:01,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:13:01,607 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:13:01,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:01,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70007b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01, skipping insertion in model container [2018-10-26 22:13:01,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:01,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:13:01,660 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:13:01,900 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:13:01,906 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:13:01,945 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:13:01,982 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:13:01,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01 WrapperNode [2018-10-26 22:13:01,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:13:01,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:13:01,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:13:01,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:13:01,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:13:02,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:13:02,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:13:02,093 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:13:02,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... [2018-10-26 22:13:02,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:13:02,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:13:02,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:13:02,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:13:02,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/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-10-26 22:13:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-26 22:13:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-26 22:13:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-10-26 22:13:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-10-26 22:13:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 22:13:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 22:13:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-26 22:13:02,186 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-26 22:13:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:13:02,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:13:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2018-10-26 22:13:02,186 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2018-10-26 22:13:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:13:02,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:13:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:13:02,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:13:02,187 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-10-26 22:13:02,187 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-10-26 22:13:02,870 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:13:02,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:02 BoogieIcfgContainer [2018-10-26 22:13:02,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:13:02,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:13:02,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:13:02,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:13:02,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:13:01" (1/3) ... [2018-10-26 22:13:02,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33a785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:13:02, skipping insertion in model container [2018-10-26 22:13:02,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:01" (2/3) ... [2018-10-26 22:13:02,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33a785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:13:02, skipping insertion in model container [2018-10-26 22:13:02,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:02" (3/3) ... [2018-10-26 22:13:02,878 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:13:02,885 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:13:02,891 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:13:02,904 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:13:02,927 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:13:02,927 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:13:02,927 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:13:02,927 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:13:02,928 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:13:02,928 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:13:02,928 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:13:02,928 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:13:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-10-26 22:13:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 22:13:02,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:02,948 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:13:02,951 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:02,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:02,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1371276736, now seen corresponding path program 1 times [2018-10-26 22:13:02,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:02,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:02,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:13:03,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:03,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:13:03,073 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-26 22:13:03,076 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [40], [42], [43], [44], [65], [67], [68], [104], [106], [108], [131], [133], [135], [138], [143], [146], [158], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-10-26 22:13:03,129 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:13:03,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:13:03,274 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:13:03,275 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 41 variables. [2018-10-26 22:13:03,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:03,303 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:13:03,383 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 93.65% of their original sizes. [2018-10-26 22:13:03,384 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:13:03,434 INFO L415 sIntCurrentIteration]: We unified 36 AI predicates to 36 [2018-10-26 22:13:03,434 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:13:03,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:13:03,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [2] total 4 [2018-10-26 22:13:03,436 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:13:03,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:13:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:13:03,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:13:03,444 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2018-10-26 22:13:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:03,666 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-10-26 22:13:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:13:03,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-26 22:13:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:03,677 INFO L225 Difference]: With dead ends: 155 [2018-10-26 22:13:03,677 INFO L226 Difference]: Without dead ends: 73 [2018-10-26 22:13:03,680 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:13:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-26 22:13:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-10-26 22:13:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-26 22:13:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-10-26 22:13:03,722 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 37 [2018-10-26 22:13:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:03,722 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-10-26 22:13:03,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:13:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-10-26 22:13:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 22:13:03,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:03,724 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-10-26 22:13:03,725 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:03,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:03,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1168073775, now seen corresponding path program 1 times [2018-10-26 22:13:03,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:03,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:03,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:03,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:03,727 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:13:03,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:03,875 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:13:03,875 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-10-26 22:13:03,876 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [32], [36], [42], [43], [44], [48], [50], [53], [67], [68], [104], [106], [108], [112], [114], [117], [123], [133], [135], [138], [143], [146], [150], [154], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-10-26 22:13:03,878 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:13:03,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:13:03,896 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:13:03,896 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Never found a fixpoint. Largest state had 43 variables. [2018-10-26 22:13:03,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:03,911 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:13:03,952 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 89.14% of their original sizes. [2018-10-26 22:13:03,952 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:13:04,115 INFO L415 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-10-26 22:13:04,115 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:13:04,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:13:04,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-10-26 22:13:04,116 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:13:04,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:13:04,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:13:04,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:13:04,118 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2018-10-26 22:13:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:04,516 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-10-26 22:13:04,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:13:04,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-10-26 22:13:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:04,517 INFO L225 Difference]: With dead ends: 132 [2018-10-26 22:13:04,517 INFO L226 Difference]: Without dead ends: 73 [2018-10-26 22:13:04,519 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:13:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-26 22:13:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-10-26 22:13:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-26 22:13:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-10-26 22:13:04,529 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2018-10-26 22:13:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:04,529 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-10-26 22:13:04,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:13:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-10-26 22:13:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 22:13:04,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:04,532 INFO L375 BasicCegarLoop]: trace histogram [2, 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] [2018-10-26 22:13:04,532 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:04,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1755086223, now seen corresponding path program 1 times [2018-10-26 22:13:04,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:04,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:04,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:04,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:04,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:05,159 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-26 22:13:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:13:05,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:05,180 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:13:05,180 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-10-26 22:13:05,180 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [30], [32], [36], [42], [43], [44], [48], [50], [53], [67], [68], [104], [106], [108], [112], [114], [117], [123], [133], [135], [138], [143], [146], [150], [154], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-10-26 22:13:05,182 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:13:05,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:13:05,231 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:13:05,231 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 43 variables. [2018-10-26 22:13:05,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:05,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:13:05,346 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 79.31% of their original sizes. [2018-10-26 22:13:05,347 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:13:06,247 INFO L415 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-10-26 22:13:06,247 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:13:06,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:13:06,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2018-10-26 22:13:06,248 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:13:06,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 22:13:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 22:13:06,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:13:06,249 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 14 states. [2018-10-26 22:13:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:11,156 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2018-10-26 22:13:11,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:13:11,156 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-10-26 22:13:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:11,157 INFO L225 Difference]: With dead ends: 148 [2018-10-26 22:13:11,157 INFO L226 Difference]: Without dead ends: 104 [2018-10-26 22:13:11,158 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-10-26 22:13:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-26 22:13:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2018-10-26 22:13:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-26 22:13:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-10-26 22:13:11,177 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 49 [2018-10-26 22:13:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:11,178 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-10-26 22:13:11,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 22:13:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-10-26 22:13:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 22:13:11,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:11,179 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 22:13:11,179 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:11,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:11,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1063567847, now seen corresponding path program 1 times [2018-10-26 22:13:11,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:11,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:11,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:13:11,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:11,292 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:13:11,292 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-26 22:13:11,293 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [30], [32], [36], [38], [42], [43], [44], [48], [50], [53], [67], [68], [104], [106], [108], [112], [114], [117], [123], [133], [135], [138], [143], [146], [150], [154], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-10-26 22:13:11,295 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:13:11,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:13:11,402 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:13:11,402 INFO L272 AbstractInterpreter]: Visited 22 different actions 67 times. Merged at 10 different actions 27 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 43 variables. [2018-10-26 22:13:11,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:11,407 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:13:11,484 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 79.36% of their original sizes. [2018-10-26 22:13:11,484 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:13:12,306 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-10-26 22:13:12,306 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:13:12,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:13:12,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-10-26 22:13:12,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:13:12,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:13:12,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:13:12,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:13:12,307 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 17 states. [2018-10-26 22:13:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:18,911 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2018-10-26 22:13:18,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:13:18,911 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-10-26 22:13:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:18,912 INFO L225 Difference]: With dead ends: 135 [2018-10-26 22:13:18,912 INFO L226 Difference]: Without dead ends: 91 [2018-10-26 22:13:18,913 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:13:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-26 22:13:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-10-26 22:13:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-26 22:13:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-10-26 22:13:18,927 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 53 [2018-10-26 22:13:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:18,927 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-10-26 22:13:18,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:13:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-10-26 22:13:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 22:13:18,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:18,929 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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-10-26 22:13:18,929 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:18,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2007461340, now seen corresponding path program 1 times [2018-10-26 22:13:18,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:18,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:18,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:18,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:18,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:13:19,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:13:19,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 22:13:19,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:13:19,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:13:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:13:19,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:13:19,070 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 10 states. [2018-10-26 22:13:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:19,414 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2018-10-26 22:13:19,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:13:19,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-10-26 22:13:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:19,416 INFO L225 Difference]: With dead ends: 96 [2018-10-26 22:13:19,416 INFO L226 Difference]: Without dead ends: 92 [2018-10-26 22:13:19,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:13:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-26 22:13:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2018-10-26 22:13:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-26 22:13:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2018-10-26 22:13:19,435 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 54 [2018-10-26 22:13:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:19,435 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2018-10-26 22:13:19,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:13:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2018-10-26 22:13:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 22:13:19,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:19,436 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-10-26 22:13:19,436 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:19,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:19,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1331625310, now seen corresponding path program 1 times [2018-10-26 22:13:19,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:19,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:19,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:13:19,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:19,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:13:19,699 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-26 22:13:19,700 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [30], [32], [36], [42], [43], [44], [48], [50], [53], [55], [61], [63], [67], [68], [104], [106], [108], [112], [114], [117], [123], [133], [135], [138], [143], [146], [150], [154], [156], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-10-26 22:13:19,701 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:13:19,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:13:19,809 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:13:19,809 INFO L272 AbstractInterpreter]: Visited 34 different actions 61 times. Merged at 8 different actions 16 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 43 variables. [2018-10-26 22:13:19,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:19,818 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:13:19,928 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 81.29% of their original sizes. [2018-10-26 22:13:19,928 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:13:20,584 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-10-26 22:13:20,584 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:13:20,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:13:20,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [10] total 36 [2018-10-26 22:13:20,585 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:13:20,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-26 22:13:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-26 22:13:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2018-10-26 22:13:20,586 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 28 states. [2018-10-26 22:13:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:27,265 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-10-26 22:13:27,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 22:13:27,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-10-26 22:13:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:27,266 INFO L225 Difference]: With dead ends: 202 [2018-10-26 22:13:27,266 INFO L226 Difference]: Without dead ends: 152 [2018-10-26 22:13:27,267 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=222, Invalid=1940, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:13:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-26 22:13:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2018-10-26 22:13:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-26 22:13:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2018-10-26 22:13:27,294 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 56 [2018-10-26 22:13:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:27,294 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2018-10-26 22:13:27,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-26 22:13:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2018-10-26 22:13:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 22:13:27,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:27,296 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-10-26 22:13:27,296 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:27,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash -806050654, now seen corresponding path program 1 times [2018-10-26 22:13:27,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:27,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:27,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:27,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:27,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 22:13:27,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:27,393 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:13:27,393 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-26 22:13:27,393 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [30], [36], [42], [43], [44], [48], [50], [53], [55], [61], [63], [67], [68], [104], [106], [108], [112], [114], [119], [123], [133], [135], [138], [143], [146], [150], [154], [156], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-10-26 22:13:27,396 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:13:27,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:13:27,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:13:27,640 INFO L272 AbstractInterpreter]: Visited 46 different actions 180 times. Merged at 15 different actions 110 times. Widened at 1 different actions 10 times. Found 17 fixpoints after 5 different actions. Largest state had 43 variables. [2018-10-26 22:13:27,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:27,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:13:27,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:27,643 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/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-10-26 22:13:27,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:27,650 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:13:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:27,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:13:27,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:13:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 22:13:28,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:13:28,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2018-10-26 22:13:28,074 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:13:28,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:13:28,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:13:28,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:13:28,075 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 10 states. [2018-10-26 22:13:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:28,855 INFO L93 Difference]: Finished difference Result 213 states and 248 transitions. [2018-10-26 22:13:28,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:13:28,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-10-26 22:13:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:28,856 INFO L225 Difference]: With dead ends: 213 [2018-10-26 22:13:28,857 INFO L226 Difference]: Without dead ends: 133 [2018-10-26 22:13:28,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:13:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-26 22:13:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-10-26 22:13:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-26 22:13:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-10-26 22:13:28,879 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 56 [2018-10-26 22:13:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:28,879 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-10-26 22:13:28,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:13:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-10-26 22:13:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-26 22:13:28,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:28,881 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 22:13:28,881 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:28,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash -845145385, now seen corresponding path program 2 times [2018-10-26 22:13:28,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:13:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:28,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:13:28,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:13:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:28,918 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.smtinterpol.util.Coercion.buildApp(Coercion.java:60) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo$PathEnd.mergeCongPath(CCInterpolator.java:293) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo$PathEnd.access$0(CCInterpolator.java:241) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo.interpolatePathInfo(CCInterpolator.java:376) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo$PathEnd.mergeCongPath(CCInterpolator.java:258) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo$PathEnd.access$0(CCInterpolator.java:241) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo.interpolatePathInfo(CCInterpolator.java:376) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.computeInterpolants(CCInterpolator.java:507) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:282) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 22:13:28,925 INFO L168 Benchmark]: Toolchain (without parser) took 27323.08 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 439.9 MB). Free memory was 958.1 MB in the beginning and 1.2 GB in the end (delta: -243.5 MB). Peak memory consumption was 196.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:28,926 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:13:28,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 932.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:28,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -214.0 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:28,927 INFO L168 Benchmark]: Boogie Preprocessor took 48.71 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: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:28,927 INFO L168 Benchmark]: RCFGBuilder took 729.20 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:28,928 INFO L168 Benchmark]: TraceAbstraction took 26052.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.9 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:13:28,930 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 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 932.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -214.0 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.71 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: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 729.20 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26052.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.9 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.smtinterpol.util.Coercion.buildApp(Coercion.java:60) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:13:30,749 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:13:30,751 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:13:30,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:13:30,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:13:30,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:13:30,761 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:13:30,763 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:13:30,764 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:13:30,765 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:13:30,765 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:13:30,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:13:30,767 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:13:30,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:13:30,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:13:30,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:13:30,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:13:30,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:13:30,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:13:30,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:13:30,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:13:30,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:13:30,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:13:30,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:13:30,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:13:30,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:13:30,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:13:30,780 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:13:30,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:13:30,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:13:30,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:13:30,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:13:30,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:13:30,786 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:13:30,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:13:30,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:13:30,788 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 22:13:30,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:13:30,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:13:30,808 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:13:30,808 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:13:30,808 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:13:30,809 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:13:30,809 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:13:30,810 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:13:30,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:13:30,811 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:13:30,811 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:13:30,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:13:30,812 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:13:30,812 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:13:30,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:13:30,812 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 22:13:30,813 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 22:13:30,813 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:13:30,813 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:13:30,813 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:13:30,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:13:30,813 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:13:30,814 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:13:30,814 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:13:30,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:13:30,814 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:13:30,814 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:13:30,814 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:13:30,814 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 22:13:30,814 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:13:30,815 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 22:13:30,815 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 22:13:30,815 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_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan 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 -> Taipan 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 -> 1b97bc973900e2f9596f533e03f1df56d5945f81 [2018-10-26 22:13:30,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:13:30,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:13:30,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:13:30,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:13:30,871 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:13:30,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:13:30,922 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data/0dcaa1230/3887329215b54f36b3002867f2064250/FLAG5c91714b5 [2018-10-26 22:13:31,395 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:13:31,396 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:13:31,404 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data/0dcaa1230/3887329215b54f36b3002867f2064250/FLAG5c91714b5 [2018-10-26 22:13:31,418 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/data/0dcaa1230/3887329215b54f36b3002867f2064250 [2018-10-26 22:13:31,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:13:31,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:13:31,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:13:31,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:13:31,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:13:31,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41dcc8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31, skipping insertion in model container [2018-10-26 22:13:31,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:13:31,472 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:13:31,730 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:13:31,738 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:13:31,803 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:13:31,856 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:13:31,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31 WrapperNode [2018-10-26 22:13:31,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:13:31,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:13:31,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:13:31,857 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:13:31,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:13:31,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:13:31,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:13:31,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:13:31,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... [2018-10-26 22:13:31,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:13:31,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:13:31,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:13:31,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:13:31,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/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-10-26 22:13:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-26 22:13:32,086 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-26 22:13:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-10-26 22:13:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-10-26 22:13:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 22:13:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 22:13:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-26 22:13:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-26 22:13:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:13:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:13:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2018-10-26 22:13:32,087 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2018-10-26 22:13:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:13:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:13:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:13:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:13:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-10-26 22:13:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-10-26 22:13:32,762 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:13:32,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:32 BoogieIcfgContainer [2018-10-26 22:13:32,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:13:32,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:13:32,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:13:32,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:13:32,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:13:31" (1/3) ... [2018-10-26 22:13:32,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0b63dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:13:32, skipping insertion in model container [2018-10-26 22:13:32,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:13:31" (2/3) ... [2018-10-26 22:13:32,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0b63dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:13:32, skipping insertion in model container [2018-10-26 22:13:32,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:32" (3/3) ... [2018-10-26 22:13:32,770 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:13:32,779 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:13:32,785 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:13:32,798 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:13:32,823 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:13:32,824 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:13:32,824 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:13:32,824 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:13:32,824 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:13:32,824 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:13:32,824 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:13:32,824 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:13:32,825 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:13:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-10-26 22:13:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 22:13:32,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:32,852 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:13:32,855 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:32,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:32,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1832097035, now seen corresponding path program 1 times [2018-10-26 22:13:32,867 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:13:32,868 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:13:32,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:32,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 22:13:32,981 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Stream closed [2018-10-26 22:13:32,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:13:32,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:13:33,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:13:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:13:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:13:33,015 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-10-26 22:13:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:33,039 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2018-10-26 22:13:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:13:33,040 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-10-26 22:13:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:33,047 INFO L225 Difference]: With dead ends: 130 [2018-10-26 22:13:33,047 INFO L226 Difference]: Without dead ends: 53 [2018-10-26 22:13:33,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-10-26 22:13:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-26 22:13:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-26 22:13:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-26 22:13:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-10-26 22:13:33,094 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 36 [2018-10-26 22:13:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:33,095 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-10-26 22:13:33,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:13:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-10-26 22:13:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 22:13:33,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:33,097 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] [2018-10-26 22:13:33,097 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:33,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1903068379, now seen corresponding path program 1 times [2018-10-26 22:13:33,099 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:13:33,099 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:13:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:33,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:13:33,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:13:33,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:13:33,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 22:13:33,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:13:33,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:13:33,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:13:33,695 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 9 states. [2018-10-26 22:13:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:34,112 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2018-10-26 22:13:34,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:13:34,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-10-26 22:13:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:34,117 INFO L225 Difference]: With dead ends: 116 [2018-10-26 22:13:34,117 INFO L226 Difference]: Without dead ends: 80 [2018-10-26 22:13:34,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:13:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-26 22:13:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-10-26 22:13:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-26 22:13:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-10-26 22:13:34,132 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 42 [2018-10-26 22:13:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:34,133 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-10-26 22:13:34,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:13:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-10-26 22:13:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 22:13:34,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:34,135 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-26 22:13:34,135 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:34,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:34,136 INFO L82 PathProgramCache]: Analyzing trace with hash 375257663, now seen corresponding path program 1 times [2018-10-26 22:13:34,136 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:13:34,136 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:13:34,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:34,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:13:34,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:13:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:13:34,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:34,935 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/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-10-26 22:13:34,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:34,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:13:35,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:13:35,182 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 22:13:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:13:35,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:13:35,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10] total 17 [2018-10-26 22:13:35,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:13:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:13:35,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:13:35,250 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 17 states. [2018-10-26 22:13:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:36,409 INFO L93 Difference]: Finished difference Result 146 states and 187 transitions. [2018-10-26 22:13:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 22:13:36,409 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-10-26 22:13:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:36,411 INFO L225 Difference]: With dead ends: 146 [2018-10-26 22:13:36,411 INFO L226 Difference]: Without dead ends: 102 [2018-10-26 22:13:36,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:13:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-26 22:13:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 56. [2018-10-26 22:13:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-26 22:13:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-10-26 22:13:36,423 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 44 [2018-10-26 22:13:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:36,424 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-10-26 22:13:36,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:13:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-10-26 22:13:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 22:13:36,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:36,425 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-10-26 22:13:36,425 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:36,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash 86349913, now seen corresponding path program 1 times [2018-10-26 22:13:36,427 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:13:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:13:36,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:36,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:13:36,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:13:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 22:13:36,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:36,997 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:13:37,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:37,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:37,191 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-10-26 22:13:37,194 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-10-26 22:13:37,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:13:37,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:37,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:37,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-10-26 22:13:37,346 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 16 treesize of output 12 [2018-10-26 22:13:37,349 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 12 treesize of output 4 [2018-10-26 22:13:37,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:13:37,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:37,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:37,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-10-26 22:13:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:13:37,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:13:37,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:13:37,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10, 10] total 26 [2018-10-26 22:13:37,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-26 22:13:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-26 22:13:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:13:37,518 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 26 states. [2018-10-26 22:13:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:54,708 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2018-10-26 22:13:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-26 22:13:54,709 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-10-26 22:13:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:54,710 INFO L225 Difference]: With dead ends: 224 [2018-10-26 22:13:54,711 INFO L226 Difference]: Without dead ends: 185 [2018-10-26 22:13:54,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=239, Invalid=2413, Unknown=0, NotChecked=0, Total=2652 [2018-10-26 22:13:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-26 22:13:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 92. [2018-10-26 22:13:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-26 22:13:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2018-10-26 22:13:54,736 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 47 [2018-10-26 22:13:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:54,736 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2018-10-26 22:13:54,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-26 22:13:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2018-10-26 22:13:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 22:13:54,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:54,738 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 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] [2018-10-26 22:13:54,738 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:54,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1559442879, now seen corresponding path program 1 times [2018-10-26 22:13:54,740 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:13:54,740 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:13:54,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:54,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:13:55,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:13:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 22:13:55,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:13:55,577 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:13:55,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:55,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:13:55,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:13:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 22:13:56,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:13:56,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13, 13] total 35 [2018-10-26 22:13:56,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-26 22:13:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-26 22:13:56,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 22:13:56,784 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand 35 states. [2018-10-26 22:13:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:13:59,035 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2018-10-26 22:13:59,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 22:13:59,039 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 53 [2018-10-26 22:13:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:13:59,040 INFO L225 Difference]: With dead ends: 224 [2018-10-26 22:13:59,040 INFO L226 Difference]: Without dead ends: 159 [2018-10-26 22:13:59,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 22:13:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-26 22:13:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 80. [2018-10-26 22:13:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-26 22:13:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-10-26 22:13:59,060 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 53 [2018-10-26 22:13:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:13:59,060 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-10-26 22:13:59,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-26 22:13:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-10-26 22:13:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 22:13:59,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:13:59,061 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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] [2018-10-26 22:13:59,062 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:13:59,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:13:59,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1519683647, now seen corresponding path program 1 times [2018-10-26 22:13:59,064 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:13:59,064 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:13:59,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:13:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:13:59,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:13:59,213 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-10-26 22:13:59,215 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-10-26 22:13:59,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-10-26 22:13:59,308 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-10-26 22:13:59,310 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-10-26 22:13:59,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,354 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 3 case distinctions, treesize of input 20 treesize of output 32 [2018-10-26 22:13:59,357 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 21 treesize of output 20 [2018-10-26 22:13:59,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-10-26 22:13:59,495 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-10-26 22:13:59,508 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-10-26 22:13:59,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:13:59,519 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-10-26 22:13:59,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2018-10-26 22:13:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:13:59,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:02,116 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:14:02,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:1 [2018-10-26 22:14:02,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-26 22:14:02,252 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 9 treesize of output 8 [2018-10-26 22:14:02,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,334 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 20 treesize of output 16 [2018-10-26 22:14:02,337 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 13 treesize of output 4 [2018-10-26 22:14:02,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,343 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 20 treesize of output 16 [2018-10-26 22:14:02,345 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 13 treesize of output 4 [2018-10-26 22:14:02,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,352 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 21 treesize of output 19 [2018-10-26 22:14:02,354 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 6 treesize of output 1 [2018-10-26 22:14:02,354 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,360 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:14:02,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:14:02,397 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-10-26 22:14:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:14:02,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:02,493 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:14:02,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:14:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:14:02,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:02,547 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-10-26 22:14:02,550 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-10-26 22:14:02,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-10-26 22:14:02,595 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-10-26 22:14:02,609 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-10-26 22:14:02,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,727 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 3 case distinctions, treesize of input 20 treesize of output 32 [2018-10-26 22:14:02,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 18 [2018-10-26 22:14:02,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,757 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 17 treesize of output 16 [2018-10-26 22:14:02,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,779 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-10-26 22:14:02,822 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-10-26 22:14:02,825 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-10-26 22:14:02,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:02,836 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-10-26 22:14:02,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2018-10-26 22:14:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:14:02,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:03,161 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:14:03,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:1 [2018-10-26 22:14:03,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-10-26 22:14:03,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 9 treesize of output 8 [2018-10-26 22:14:03,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,339 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 20 treesize of output 16 [2018-10-26 22:14:03,342 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 13 treesize of output 4 [2018-10-26 22:14:03,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,349 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 20 treesize of output 16 [2018-10-26 22:14:03,351 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 13 treesize of output 4 [2018-10-26 22:14:03,351 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,355 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,357 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 21 treesize of output 19 [2018-10-26 22:14:03,361 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 6 treesize of output 1 [2018-10-26 22:14:03,361 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,367 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:03,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:14:03,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:14:03,411 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-10-26 22:14:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:14:03,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:14:03,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16, 13] total 26 [2018-10-26 22:14:03,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-26 22:14:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-26 22:14:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=570, Unknown=1, NotChecked=0, Total=650 [2018-10-26 22:14:03,451 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 26 states. [2018-10-26 22:14:06,643 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2018-10-26 22:14:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:13,128 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2018-10-26 22:14:13,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-26 22:14:13,129 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-10-26 22:14:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:13,130 INFO L225 Difference]: With dead ends: 121 [2018-10-26 22:14:13,130 INFO L226 Difference]: Without dead ends: 115 [2018-10-26 22:14:13,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=163, Invalid=1026, Unknown=1, NotChecked=0, Total=1190 [2018-10-26 22:14:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-26 22:14:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 82. [2018-10-26 22:14:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-26 22:14:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-10-26 22:14:13,143 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 54 [2018-10-26 22:14:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:13,144 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-10-26 22:14:13,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-26 22:14:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-10-26 22:14:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 22:14:13,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:14:13,145 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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] [2018-10-26 22:14:13,145 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:14:13,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1186417063, now seen corresponding path program 2 times [2018-10-26 22:14:13,146 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:14:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:14:13,178 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 22:14:13,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:14:13,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:14:13,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 22:14:13,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 22:14:13,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:13,692 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:14:13,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:14:13,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:14:13,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:14:13,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 22:14:13,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 22:14:13,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:14:13,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13, 15] total 20 [2018-10-26 22:14:13,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 22:14:13,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 22:14:13,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-26 22:14:13,924 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 20 states. [2018-10-26 22:14:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:14,916 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2018-10-26 22:14:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 22:14:14,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-10-26 22:14:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:14,919 INFO L225 Difference]: With dead ends: 160 [2018-10-26 22:14:14,919 INFO L226 Difference]: Without dead ends: 157 [2018-10-26 22:14:14,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 199 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:14:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-26 22:14:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2018-10-26 22:14:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-26 22:14:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 154 transitions. [2018-10-26 22:14:14,954 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 154 transitions. Word has length 56 [2018-10-26 22:14:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:14,955 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 154 transitions. [2018-10-26 22:14:14,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 22:14:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2018-10-26 22:14:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-26 22:14:14,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:14:14,957 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 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] [2018-10-26 22:14:14,957 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:14:14,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:14,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1000982003, now seen corresponding path program 3 times [2018-10-26 22:14:14,958 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:14:14,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:14:14,974 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-10-26 22:14:15,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 22:14:15,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:14:15,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:15,246 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-10-26 22:14:15,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:14:15,296 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-10-26 22:14:15,299 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-10-26 22:14:15,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,313 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-10-26 22:14:15,316 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-10-26 22:14:15,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-10-26 22:14:15,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-26 22:14:15,450 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-10-26 22:14:15,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,476 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-10-26 22:14:15,484 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-10-26 22:14:15,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:58 [2018-10-26 22:14:15,674 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 22:14:15,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:52 [2018-10-26 22:14:15,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,772 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 30 treesize of output 47 [2018-10-26 22:14:15,776 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-10-26 22:14:15,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,829 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,832 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,835 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:15,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 72 [2018-10-26 22:14:15,863 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 31 treesize of output 28 [2018-10-26 22:14:15,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:15,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:60 [2018-10-26 22:14:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:14:17,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:17,452 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-26 22:14:18,969 WARN L179 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-10-26 22:14:19,277 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-26 22:14:19,710 WARN L179 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-26 22:14:20,090 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-10-26 22:14:20,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 507 [2018-10-26 22:14:20,131 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 9 treesize of output 8 [2018-10-26 22:14:20,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:20,238 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:20,277 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 488 treesize of output 436 [2018-10-26 22:14:20,453 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2018-10-26 22:14:20,457 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 9 treesize of output 8 [2018-10-26 22:14:20,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:20,486 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:20,490 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 332 treesize of output 327 [2018-10-26 22:14:20,503 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 318 treesize of output 308 [2018-10-26 22:14:20,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:20,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:20,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:20,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:20,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 157 [2018-10-26 22:14:20,733 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 9 treesize of output 8 [2018-10-26 22:14:20,734 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:20,752 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:20,759 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 156 treesize of output 88 [2018-10-26 22:14:20,885 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-10-26 22:14:20,888 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 9 treesize of output 8 [2018-10-26 22:14:20,888 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:20,907 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:20,907 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:20,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:20,938 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:20,942 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:20,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 87 [2018-10-26 22:14:20,967 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 29 treesize of output 23 [2018-10-26 22:14:20,967 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,282 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:21,291 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:21,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-10-26 22:14:21,435 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 22 [2018-10-26 22:14:21,436 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 22:14:21,451 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 6 treesize of output 1 [2018-10-26 22:14:21,451 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,456 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,460 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,465 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,470 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:14:21,513 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1253, output treesize:24 [2018-10-26 22:14:21,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:21,576 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:14:21,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:14:21,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 22:14:21,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:14:21,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:21,657 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-10-26 22:14:21,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 22:14:21,798 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-10-26 22:14:21,802 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-10-26 22:14:21,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,815 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-10-26 22:14:21,817 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-10-26 22:14:21,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:21,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-10-26 22:14:21,987 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:21,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-26 22:14:22,000 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-10-26 22:14:22,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:22,032 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-10-26 22:14:22,035 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-10-26 22:14:22,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:52 [2018-10-26 22:14:22,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:22,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:22,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:22,277 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 20 treesize of output 21 [2018-10-26 22:14:22,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:51 [2018-10-26 22:14:22,440 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 42 treesize of output 59 [2018-10-26 22:14:22,446 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-10-26 22:14:22,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,502 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-10-26 22:14:22,506 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-10-26 22:14:22,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:22,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:107 [2018-10-26 22:14:25,377 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_length_#in~head.base|) |c_sll_length_#in~head.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_sll_length_#in~head.base|) |c_sll_length_#in~head.offset|))) (or (and (not (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) (_ bv0 32))) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_13| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_11|) |v_main_~#s~0.offset_BEFORE_CALL_13|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_11|) |v_main_~#s~0.offset_BEFORE_CALL_13|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3)) (not (= .cse2 .cse4)) (not (= .cse2 |v_main_~#s~0.base_BEFORE_CALL_11|)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (not (= .cse4 |v_main_~#s~0.base_BEFORE_CALL_11|))))))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| v_prenex_15) v_prenex_14)) (.cse9 (select (select |c_#memory_$Pointer$.offset| v_prenex_15) v_prenex_14))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9)) (.cse7 (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)) (not (= .cse8 v_prenex_15)) (not (= .cse6 .cse8)) (not (= .cse6 v_prenex_15)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)))))) (not (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) (_ bv0 32)))))) is different from true [2018-10-26 22:14:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:14:25,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:27,161 WARN L179 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-10-26 22:14:27,387 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-26 22:14:27,789 WARN L179 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-26 22:14:28,112 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-26 22:14:28,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 144 [2018-10-26 22:14:28,154 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 9 treesize of output 8 [2018-10-26 22:14:28,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:28,208 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:28,225 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 128 treesize of output 108 [2018-10-26 22:14:28,381 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-10-26 22:14:28,385 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 9 treesize of output 8 [2018-10-26 22:14:28,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:28,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:28,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 135 [2018-10-26 22:14:28,553 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:14:28,553 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:28,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:28,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 91 treesize of output 88 [2018-10-26 22:14:28,976 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:29,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 36 treesize of output 37 [2018-10-26 22:14:29,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:29,427 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:29,427 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:29,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-10-26 22:14:29,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:29,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 11 [2018-10-26 22:14:29,436 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:29,445 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:29,554 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:29,557 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 33 treesize of output 28 [2018-10-26 22:14:29,560 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 21 treesize of output 11 [2018-10-26 22:14:29,561 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:29,572 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 6 treesize of output 1 [2018-10-26 22:14:29,572 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:29,578 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:29,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:29,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:29,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2018-10-26 22:14:29,685 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:29,686 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:29,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:29,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 11 [2018-10-26 22:14:29,691 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:29,710 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:30,000 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 84 treesize of output 80 [2018-10-26 22:14:30,004 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 6 treesize of output 1 [2018-10-26 22:14:30,004 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:30,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 22:14:30,020 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:30,031 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:30,085 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:14:30,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:14:30,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:14:30,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 144 [2018-10-26 22:14:30,647 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 9 treesize of output 8 [2018-10-26 22:14:30,647 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:30,690 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:30,701 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 128 treesize of output 108 [2018-10-26 22:14:30,862 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-10-26 22:14:30,866 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 9 treesize of output 8 [2018-10-26 22:14:30,866 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:30,897 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:30,929 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:31,050 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 140 [2018-10-26 22:14:31,055 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:14:31,055 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:31,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:31,288 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:31,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 36 treesize of output 36 [2018-10-26 22:14:31,289 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:31,417 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:14:31,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 92 treesize of output 89 [2018-10-26 22:14:31,418 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:31,751 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:31,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-10-26 22:14:31,757 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 6 treesize of output 1 [2018-10-26 22:14:31,757 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:31,768 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 6 treesize of output 1 [2018-10-26 22:14:31,768 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:31,774 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:31,871 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:31,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-10-26 22:14:31,877 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 6 treesize of output 1 [2018-10-26 22:14:31,878 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:31,894 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 6 treesize of output 1 [2018-10-26 22:14:31,894 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:31,904 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,040 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:14:32,114 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:14:32,153 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:14:32,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2018-10-26 22:14:32,427 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 9 treesize of output 8 [2018-10-26 22:14:32,427 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:32,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-10-26 22:14:32,520 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 9 treesize of output 8 [2018-10-26 22:14:32,521 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,537 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:32,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-10-26 22:14:32,543 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 6 treesize of output 1 [2018-10-26 22:14:32,543 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,553 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 13 treesize of output 4 [2018-10-26 22:14:32,553 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,556 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,558 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,569 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 63 [2018-10-26 22:14:32,686 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 9 treesize of output 8 [2018-10-26 22:14:32,686 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,716 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:32,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-10-26 22:14:32,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 22:14:32,774 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,794 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:32,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-10-26 22:14:32,800 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 6 treesize of output 1 [2018-10-26 22:14:32,801 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,809 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 6 treesize of output 1 [2018-10-26 22:14:32,810 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,812 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,821 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,833 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:32,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-10-26 22:14:32,899 INFO L202 ElimStorePlain]: Needed 47 recursive calls to eliminate 14 variables, input treesize:399, output treesize:71 [2018-10-26 22:14:33,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:14:33,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-10-26 22:14:33,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-26 22:14:33,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-26 22:14:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2246, Unknown=12, NotChecked=96, Total=2550 [2018-10-26 22:14:33,021 INFO L87 Difference]: Start difference. First operand 124 states and 154 transitions. Second operand 34 states. [2018-10-26 22:14:35,899 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-10-26 22:14:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:37,492 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2018-10-26 22:14:37,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-26 22:14:37,493 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 58 [2018-10-26 22:14:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:37,495 INFO L225 Difference]: With dead ends: 198 [2018-10-26 22:14:37,495 INFO L226 Difference]: Without dead ends: 183 [2018-10-26 22:14:37,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 112 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=294, Invalid=3120, Unknown=12, NotChecked=114, Total=3540 [2018-10-26 22:14:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-26 22:14:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2018-10-26 22:14:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-26 22:14:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 208 transitions. [2018-10-26 22:14:37,522 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 208 transitions. Word has length 58 [2018-10-26 22:14:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:37,523 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 208 transitions. [2018-10-26 22:14:37,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-26 22:14:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2018-10-26 22:14:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-26 22:14:37,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:14:37,524 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2018-10-26 22:14:37,524 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:14:37,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:37,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1401907329, now seen corresponding path program 2 times [2018-10-26 22:14:37,525 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:14:37,525 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:14:37,547 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 22:14:37,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:14:37,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-10-26 22:14:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:14:37,910 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:14:37,940 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,941 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,942 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,943 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,950 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,950 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,951 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,951 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,951 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,951 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,952 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,952 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,952 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,952 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,953 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,953 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,953 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,953 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,953 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,954 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,954 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,957 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,957 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,957 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,957 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,958 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,958 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,958 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,958 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,959 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,959 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,959 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,960 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,960 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,960 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,960 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,960 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,961 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,961 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,961 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,961 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,961 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,975 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,975 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,976 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,976 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,976 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,976 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:37,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:14:37 BoogieIcfgContainer [2018-10-26 22:14:37,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:14:37,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:14:37,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:14:37,999 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:14:38,000 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:13:32" (3/4) ... [2018-10-26 22:14:38,002 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:14:38,004 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,005 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,005 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,005 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,006 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,006 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,007 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,008 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,009 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,009 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,009 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,009 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,009 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,010 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,015 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,015 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,016 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,017 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,017 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,017 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,017 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,018 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,023 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,023 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,023 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,024 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,025 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,031 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,032 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 22:14:38,075 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d20cef40-f77a-4f65-a52e-6a0e09a65cb5/bin-2019/utaipan/witness.graphml [2018-10-26 22:14:38,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:14:38,076 INFO L168 Benchmark]: Toolchain (without parser) took 66654.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.5 MB). Free memory was 946.5 MB in the beginning and 1.2 GB in the end (delta: -214.5 MB). Peak memory consumption was 142.0 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:38,077 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:14:38,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.43 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 925.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:38,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 1.0 GB. Free memory was 925.1 MB in the beginning and 919.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:38,077 INFO L168 Benchmark]: Boogie Preprocessor took 45.48 ms. Allocated memory is still 1.0 GB. Free memory is still 919.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:14:38,077 INFO L168 Benchmark]: RCFGBuilder took 798.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:38,078 INFO L168 Benchmark]: TraceAbstraction took 65234.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.7 MB). Peak memory consumption was 148.0 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:38,078 INFO L168 Benchmark]: Witness Printer took 76.59 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:14:38,079 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 433.43 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 925.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 1.0 GB. Free memory was 925.1 MB in the beginning and 919.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.48 ms. Allocated memory is still 1.0 GB. Free memory is still 919.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 798.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 919.7 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65234.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.7 MB). Peak memory consumption was 148.0 MB. Max. memory is 11.5 GB. * Witness Printer took 76.59 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L609] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] RET return len; VAL [\old(from)=2, \old(until)=5, \result=2, from=2, len=2, until=5] [L616] EXPR _get_nondet_int(2, 5) [L616] const int len = _get_nondet_int(2, 5); [L617] CALL SLL s = sll_create(len); [L617] RET SLL s = sll_create(len); [L617] CALL, EXPR sll_create(len) [L564] SLL head = ((void *)0); [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] CALL new_head->next = head [L570] RET new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] CALL new_head->next = head [L570] RET new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND FALSE !(len-- > 0) [L573] RET return head; [L617] EXPR sll_create(len) [L617] CALL SLL s = sll_create(len); [L617] RET SLL s = sll_create(len); [L618] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L609] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] RET return len; VAL [\old(from)=0, \old(until)=1, \result=1, from=0, len=1, until=1] [L618] EXPR _get_nondet_int(0, len - 1) [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] CALL, EXPR \read(s) [L625] RET, EXPR \read(s) [L625] CALL, EXPR sll_length(s) [L576] int len = 0; [L577] COND TRUE \read(head) [L578] len++ [L579] CALL, EXPR head->next [L579] RET, EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] CALL, EXPR head->next [L579] RET, EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) [L581] RET return len; [L625] EXPR sll_length(s) [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 70 locations, 1 error locations. UNSAFE Result, 65.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 36.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 524 SDtfs, 468 SDslu, 5887 SDs, 0 SdLazy, 4321 SolverSat, 226 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1291 GetRequests, 1025 SyntacticMatches, 31 SemanticMatches, 235 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2270 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 314 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1140 ConstructedInterpolants, 87 QuantifiedInterpolants, 646275 SizeOfPredicates, 232 NumberOfNonLiveVariables, 2200 ConjunctsInSsa, 366 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 213/388 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...