./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/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 dd9e7bf35989cde866740706d77fd71a632fd664 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/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 dd9e7bf35989cde866740706d77fd71a632fd664 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:25:45,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:25:45,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:25:45,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:25:45,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:25:45,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:25:45,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:25:45,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:25:45,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:25:45,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:25:45,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:25:45,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:25:45,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:25:45,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:25:45,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:25:45,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:25:45,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:25:45,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:25:45,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:25:45,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:25:45,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:25:45,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:25:45,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:25:45,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:25:45,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:25:45,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:25:45,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:25:45,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:25:45,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:25:45,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:25:45,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:25:45,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:25:45,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:25:45,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:25:45,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:25:45,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:25:45,086 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 21:25:45,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:25:45,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:25:45,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:25:45,097 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:25:45,097 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:25:45,097 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:25:45,098 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:25:45,098 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:25:45,098 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:25:45,098 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:25:45,098 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:25:45,098 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:25:45,098 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:25:45,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:25:45,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:25:45,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:25:45,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:25:45,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:25:45,100 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:25:45,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:25:45,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:25:45,100 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:25:45,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:25:45,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:25:45,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:25:45,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:25:45,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:25:45,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:25:45,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:25:45,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:25:45,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:25:45,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:25:45,102 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:25:45,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:25:45,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:25:45,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:25:45,102 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_4a705c66-4b32-49e3-875b-01e01603e368/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 -> dd9e7bf35989cde866740706d77fd71a632fd664 [2018-12-02 21:25:45,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:25:45,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:25:45,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:25:45,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:25:45,135 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:25:45,135 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:25:45,170 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data/c7a21e45e/2d0667da55cd450b99bdf23ac89f7dd2/FLAGcb10714ee [2018-12-02 21:25:45,523 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:25:45,524 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:25:45,530 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data/c7a21e45e/2d0667da55cd450b99bdf23ac89f7dd2/FLAGcb10714ee [2018-12-02 21:25:45,905 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data/c7a21e45e/2d0667da55cd450b99bdf23ac89f7dd2 [2018-12-02 21:25:45,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:25:45,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:25:45,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:25:45,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:25:45,911 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:25:45,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:25:45" (1/1) ... [2018-12-02 21:25:45,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73559806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:45, skipping insertion in model container [2018-12-02 21:25:45,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:25:45" (1/1) ... [2018-12-02 21:25:45,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:25:45,943 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:25:46,090 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:25:46,139 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:25:46,172 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:25:46,196 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:25:46,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46 WrapperNode [2018-12-02 21:25:46,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:25:46,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:25:46,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:25:46,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:25:46,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:25:46,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:25:46,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:25:46,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:25:46,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... [2018-12-02 21:25:46,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:25:46,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:25:46,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:25:46,236 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:25:46,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/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-12-02 21:25:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-02 21:25:46,267 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-02 21:25:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 21:25:46,267 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 21:25:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-02 21:25:46,267 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-02 21:25:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:25:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:25:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-02 21:25:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 21:25:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 21:25:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:25:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:25:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:25:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:25:46,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:25:46,431 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:25:46,431 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 21:25:46,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:25:46 BoogieIcfgContainer [2018-12-02 21:25:46,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:25:46,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:25:46,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:25:46,434 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:25:46,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:25:45" (1/3) ... [2018-12-02 21:25:46,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da1eca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:25:46, skipping insertion in model container [2018-12-02 21:25:46,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:46" (2/3) ... [2018-12-02 21:25:46,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da1eca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:25:46, skipping insertion in model container [2018-12-02 21:25:46,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:25:46" (3/3) ... [2018-12-02 21:25:46,436 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:25:46,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:25:46,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 21:25:46,454 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 21:25:46,471 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:25:46,471 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:25:46,472 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:25:46,472 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:25:46,472 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:25:46,472 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:25:46,472 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:25:46,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:25:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-12-02 21:25:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 21:25:46,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:46,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:25:46,487 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:46,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1637370932, now seen corresponding path program 1 times [2018-12-02 21:25:46,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:25:46,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:46,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:46,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:25:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:25:46,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:25:46,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 21:25:46,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:25:46,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:25:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:25:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:25:46,603 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-12-02 21:25:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:46,652 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2018-12-02 21:25:46,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:25:46,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-02 21:25:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:46,658 INFO L225 Difference]: With dead ends: 100 [2018-12-02 21:25:46,658 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 21:25:46,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:25:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 21:25:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-12-02 21:25:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 21:25:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-02 21:25:46,686 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2018-12-02 21:25:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:46,686 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 21:25:46,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:25:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-02 21:25:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 21:25:46,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:46,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:25:46,687 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:46,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:46,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1783726762, now seen corresponding path program 1 times [2018-12-02 21:25:46,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:25:46,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:46,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:46,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:46,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:25:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:25:46,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:25:46,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:25:46,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:25:46,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:25:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:25:46,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:25:46,735 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-12-02 21:25:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:46,763 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-12-02 21:25:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:25:46,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-02 21:25:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:46,764 INFO L225 Difference]: With dead ends: 73 [2018-12-02 21:25:46,764 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 21:25:46,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:25:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 21:25:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-02 21:25:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 21:25:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 21:25:46,771 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 33 [2018-12-02 21:25:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:46,771 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 21:25:46,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:25:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 21:25:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 21:25:46,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:46,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:25:46,772 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:46,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1676985131, now seen corresponding path program 1 times [2018-12-02 21:25:46,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:25:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:46,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:46,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:25:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:25:46,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:25:46,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:25:46,831 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-02 21:25:46,832 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 21:25:46,855 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:25:46,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:25:47,003 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 21:25:47,004 INFO L272 AbstractInterpreter]: Visited 27 different actions 50 times. Merged at 7 different actions 11 times. Never widened. Performed 446 root evaluator evaluations with a maximum evaluation depth of 4. Performed 446 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-02 21:25:47,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:47,010 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 21:25:47,059 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 82.99% of their original sizes. [2018-12-02 21:25:47,060 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 21:25:47,155 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-02 21:25:47,155 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 21:25:47,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:25:47,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-12-02 21:25:47,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:25:47,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:25:47,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:25:47,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:25:47,157 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 17 states. [2018-12-02 21:25:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:47,960 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-12-02 21:25:47,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:25:47,960 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-12-02 21:25:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:47,961 INFO L225 Difference]: With dead ends: 80 [2018-12-02 21:25:47,961 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 21:25:47,962 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:25:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 21:25:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-12-02 21:25:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 21:25:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-12-02 21:25:47,969 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 42 [2018-12-02 21:25:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:47,969 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-12-02 21:25:47,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:25:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-12-02 21:25:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 21:25:47,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:47,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:25:47,971 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:47,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1665630434, now seen corresponding path program 1 times [2018-12-02 21:25:47,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:25:47,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:47,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:25:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 21:25:48,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:25:48,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:25:48,031 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-02 21:25:48,031 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 21:25:48,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:25:48,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:25:48,087 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 21:25:48,087 INFO L272 AbstractInterpreter]: Visited 37 different actions 87 times. Merged at 14 different actions 22 times. Never widened. Performed 712 root evaluator evaluations with a maximum evaluation depth of 4. Performed 712 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 5 different actions. Largest state had 27 variables. [2018-12-02 21:25:48,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:48,088 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 21:25:48,120 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 88.97% of their original sizes. [2018-12-02 21:25:48,121 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 21:25:48,194 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-02 21:25:48,194 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 21:25:48,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:25:48,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-12-02 21:25:48,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:25:48,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:25:48,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:25:48,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-02 21:25:48,195 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 17 states. [2018-12-02 21:25:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:48,821 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-12-02 21:25:48,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:25:48,821 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-12-02 21:25:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:48,822 INFO L225 Difference]: With dead ends: 77 [2018-12-02 21:25:48,822 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 21:25:48,822 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-12-02 21:25:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 21:25:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-12-02 21:25:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 21:25:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-12-02 21:25:48,829 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 43 [2018-12-02 21:25:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:48,829 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-12-02 21:25:48,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:25:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-12-02 21:25:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 21:25:48,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:48,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:25:48,831 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:48,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1785252531, now seen corresponding path program 1 times [2018-12-02 21:25:48,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:25:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:48,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:48,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:25:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:25:48,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:25:48,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:25:48,883 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-02 21:25:48,883 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [109], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-02 21:25:48,885 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:25:48,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:25:48,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:25:48,925 INFO L272 AbstractInterpreter]: Visited 44 different actions 96 times. Merged at 15 different actions 23 times. Never widened. Performed 744 root evaluator evaluations with a maximum evaluation depth of 4. Performed 744 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 6 different actions. Largest state had 27 variables. [2018-12-02 21:25:48,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:48,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:25:48,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:25:48,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/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-12-02 21:25:48,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:48,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:25:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:48,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:25:48,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:25:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:25:49,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:25:49,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-12-02 21:25:49,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:25:49,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:25:49,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:25:49,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:25:49,077 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 8 states. [2018-12-02 21:25:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:49,148 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2018-12-02 21:25:49,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:25:49,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-02 21:25:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:49,149 INFO L225 Difference]: With dead ends: 115 [2018-12-02 21:25:49,149 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 21:25:49,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 21:25:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 21:25:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2018-12-02 21:25:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 21:25:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-12-02 21:25:49,155 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 44 [2018-12-02 21:25:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:49,155 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-12-02 21:25:49,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:25:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-12-02 21:25:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 21:25:49,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:49,157 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-12-02 21:25:49,157 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:49,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:49,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1336636124, now seen corresponding path program 2 times [2018-12-02 21:25:49,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:25:49,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:49,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:49,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:25:49,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:25:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:25:49,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:25:49,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:25:49,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:25:49,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:25:49,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:25:49,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:25:49,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:25:49,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:25:49,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 21:25:49,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:25:49,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:50,001 INFO L478 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-12-02 21:25:50,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 21:25:50,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:50,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:50,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 21:25:50,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 21:25:50,087 INFO L478 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-12-02 21:25:50,088 INFO L478 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-12-02 21:25:50,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-02 21:25:50,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 130 [2018-12-02 21:25:50,246 INFO L478 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 121 treesize of output 85 [2018-12-02 21:25:50,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 113 [2018-12-02 21:25:50,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 21:25:50,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:25:50,321 INFO L478 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 72 treesize of output 63 [2018-12-02 21:25:50,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 21:25:50,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,326 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,328 INFO L478 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 75 treesize of output 66 [2018-12-02 21:25:50,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-02 21:25:50,330 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,333 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:25:50,342 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:120, output treesize:128 [2018-12-02 21:25:50,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:50,423 INFO L478 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 105 treesize of output 109 [2018-12-02 21:25:50,427 INFO L478 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 36 treesize of output 1 [2018-12-02 21:25:50,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:50,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:204, output treesize:60 [2018-12-02 21:25:52,015 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int) (sll_update_at_~data Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset sll_update_at_~data))) (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.offset| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-02 21:25:52,024 INFO L478 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 72 treesize of output 63 [2018-12-02 21:25:52,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:52,028 INFO L478 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 63 treesize of output 63 [2018-12-02 21:25:52,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,048 INFO L478 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 62 treesize of output 55 [2018-12-02 21:25:52,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:25:52,052 INFO L478 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 55 treesize of output 53 [2018-12-02 21:25:52,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,067 INFO L478 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 58 treesize of output 65 [2018-12-02 21:25:52,069 INFO L478 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-12-02 21:25:52,069 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,082 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:104, output treesize:60 [2018-12-02 21:25:52,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 122 [2018-12-02 21:25:52,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2018-12-02 21:25:52,493 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,516 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:25:52,516 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2018-12-02 21:25:52,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,538 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:25:52,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 93 [2018-12-02 21:25:52,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:25:52,583 INFO L478 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 1 case distinctions, treesize of input 88 treesize of output 86 [2018-12-02 21:25:52,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-12-02 21:25:52,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,607 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:25:52,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-12-02 21:25:52,608 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:25:52,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 65 [2018-12-02 21:25:52,630 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,650 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:25:52,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2018-12-02 21:25:52,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-02 21:25:52,655 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,666 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:25:52,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-12-02 21:25:52,667 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,676 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:52,713 INFO L478 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 1 case distinctions, treesize of input 64 treesize of output 62 [2018-12-02 21:25:52,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 49 [2018-12-02 21:25:52,720 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-02 21:25:52,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-12-02 21:25:52,748 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,772 INFO L478 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 40 treesize of output 31 [2018-12-02 21:25:52,772 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,793 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 21:25:52,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 64 treesize of output 54 [2018-12-02 21:25:52,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2018-12-02 21:25:52,800 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-02 21:25:52,813 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:25:52,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 60 treesize of output 50 [2018-12-02 21:25:52,816 INFO L478 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 42 treesize of output 29 [2018-12-02 21:25:52,816 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,824 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:25:52,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 21:25:52,871 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 7 variables, input treesize:135, output treesize:59 [2018-12-02 21:25:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-12-02 21:25:52,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:25:53,275 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:53,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:53,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:53,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:53,324 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:53,329 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:53,343 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:53,348 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:25:53,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-02 21:25:53,361 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:135, output treesize:83 [2018-12-02 21:25:53,546 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-02 21:25:55,572 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_main_~s~0.offset_BEFORE_CALL_5 Int) (v_main_~len~0_BEFORE_CALL_5 Int)) (or (< v_main_~s~0.offset_BEFORE_CALL_5 |c_sll_update_at_#in~head.offset|) (<= (+ (let ((.cse0 (+ v_main_~s~0.offset_BEFORE_CALL_5 4))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_sll_update_at_#in~head.base|) .cse0))) 1) (* 2 v_main_~len~0_BEFORE_CALL_5)) (exists ((v_sll_update_at_~data_8 Int) (v_DerPreprocessor_6 Int) (v_sll_update_at_~head.offset_12 Int) (v_DerPreprocessor_2 Int)) (and (<= v_sll_update_at_~head.offset_12 v_main_~s~0.offset_BEFORE_CALL_5) (< (+ (let ((.cse1 (+ v_main_~s~0.offset_BEFORE_CALL_5 4))) (select (select (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_update_at_#in~head.base|) v_sll_update_at_~head.offset_12 v_sll_update_at_~data_8)) (select (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) v_sll_update_at_~head.offset_12 v_DerPreprocessor_2) .cse1)) (select (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) v_sll_update_at_~head.offset_12 v_DerPreprocessor_6) .cse1))) 1) (* 2 v_main_~len~0_BEFORE_CALL_5)))) (exists ((v_DerPreprocessor_8 Int) (v_prenex_10 Int) (v_DerPreprocessor_4 Int) (v_prenex_8 Int)) (and (<= v_prenex_10 v_main_~s~0.offset_BEFORE_CALL_5) (< (* 2 v_main_~len~0_BEFORE_CALL_5) (+ (let ((.cse2 (+ v_main_~s~0.offset_BEFORE_CALL_5 4))) (select (select (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_update_at_#in~head.base|) v_prenex_10 v_prenex_8)) (select (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) v_prenex_10 v_DerPreprocessor_8) .cse2)) (select (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) v_prenex_10 v_DerPreprocessor_4) .cse2))) 1)))))) (forall ((v_prenex_12 Int) (v_prenex_11 Int)) (or (exists ((v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_14 Int) (v_prenex_19 Int)) (and (< (* 2 v_prenex_12) (+ (let ((.cse3 (+ v_prenex_11 4))) (select (select (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_update_at_#in~head.base|) v_prenex_14 v_prenex_17)) (select (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) v_prenex_14 v_prenex_19) .cse3)) (select (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) v_prenex_14 v_prenex_15) .cse3))) 1)) (<= v_prenex_14 v_prenex_11))) (< v_prenex_11 |c_sll_update_at_#in~head.offset|) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_13 Int) (v_prenex_20 Int)) (and (<= v_prenex_20 v_prenex_11) (< (+ (let ((.cse4 (+ v_prenex_11 4))) (select (select (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_update_at_#in~head.base|) v_prenex_20 v_prenex_18)) (select (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) v_prenex_20 v_prenex_16) .cse4)) (select (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) v_prenex_20 v_prenex_13) .cse4))) 1) (* 2 v_prenex_12)))) (<= (* 2 v_prenex_12) (+ (let ((.cse5 (+ v_prenex_11 4))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) .cse5)) (select (select |c_#memory_$Pointer$.offset| |c_sll_update_at_#in~head.base|) .cse5))) 1))))) is different from false [2018-12-02 21:25:55,582 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-02 21:25:55,591 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-12-02 21:25:55,802 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:25:55,803 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) 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:214) 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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-02 21:25:55,808 INFO L168 Benchmark]: Toolchain (without parser) took 9899.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -64.9 MB). Peak memory consumption was 127.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:25:55,810 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:25:55,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:25:55,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:25:55,811 INFO L168 Benchmark]: Boogie Preprocessor took 18.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:25:55,812 INFO L168 Benchmark]: RCFGBuilder took 196.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:25:55,813 INFO L168 Benchmark]: TraceAbstraction took 9374.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.4 MB). Peak memory consumption was 136.6 MB. Max. memory is 11.5 GB. [2018-12-02 21:25:55,818 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 196.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9374.57 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.4 MB). Peak memory consumption was 136.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:25:57,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:25:57,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:25:57,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:25:57,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:25:57,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:25:57,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:25:57,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:25:57,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:25:57,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:25:57,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:25:57,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:25:57,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:25:57,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:25:57,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:25:57,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:25:57,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:25:57,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:25:57,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:25:57,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:25:57,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:25:57,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:25:57,132 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:25:57,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:25:57,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:25:57,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:25:57,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:25:57,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:25:57,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:25:57,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:25:57,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:25:57,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:25:57,135 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:25:57,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:25:57,136 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:25:57,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:25:57,136 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 21:25:57,144 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:25:57,144 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:25:57,145 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:25:57,145 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:25:57,145 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:25:57,145 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:25:57,145 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:25:57,145 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:25:57,145 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:25:57,145 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:25:57,146 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:25:57,146 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:25:57,146 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:25:57,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:25:57,146 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:25:57,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:25:57,146 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:25:57,146 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 21:25:57,146 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 21:25:57,147 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:25:57,147 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:25:57,147 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:25:57,147 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:25:57,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:25:57,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:25:57,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:25:57,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:25:57,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:25:57,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:25:57,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:25:57,148 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:25:57,148 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 21:25:57,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:25:57,148 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 21:25:57,148 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 21:25:57,148 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_4a705c66-4b32-49e3-875b-01e01603e368/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 -> dd9e7bf35989cde866740706d77fd71a632fd664 [2018-12-02 21:25:57,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:25:57,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:25:57,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:25:57,176 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:25:57,176 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:25:57,176 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:25:57,212 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data/87189c8fa/b89784693c6b42f6b7ecba79dccc79ad/FLAG19de0bdc0 [2018-12-02 21:25:57,658 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:25:57,658 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:25:57,665 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data/87189c8fa/b89784693c6b42f6b7ecba79dccc79ad/FLAG19de0bdc0 [2018-12-02 21:25:57,672 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/data/87189c8fa/b89784693c6b42f6b7ecba79dccc79ad [2018-12-02 21:25:57,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:25:57,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:25:57,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:25:57,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:25:57,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:25:57,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785ac8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57, skipping insertion in model container [2018-12-02 21:25:57,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:25:57,703 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:25:57,862 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:25:57,871 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:25:57,936 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:25:57,959 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:25:57,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57 WrapperNode [2018-12-02 21:25:57,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:25:57,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:25:57,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:25:57,960 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:25:57,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:25:57,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:25:57,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:25:57,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:25:57,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... [2018-12-02 21:25:57,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:25:57,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:25:57,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:25:57,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:25:58,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/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-12-02 21:25:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-02 21:25:58,029 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-02 21:25:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 21:25:58,029 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 21:25:58,029 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-02 21:25:58,029 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-02 21:25:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:25:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 21:25:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-02 21:25:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-02 21:25:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 21:25:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 21:25:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 21:25:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 21:25:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:25:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:25:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:25:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:25:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 21:25:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 21:25:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:25:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 21:25:58,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:25:58,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:25:58,251 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:25:58,252 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 21:25:58,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:25:58 BoogieIcfgContainer [2018-12-02 21:25:58,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:25:58,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:25:58,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:25:58,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:25:58,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:25:57" (1/3) ... [2018-12-02 21:25:58,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df99065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:25:58, skipping insertion in model container [2018-12-02 21:25:58,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:25:57" (2/3) ... [2018-12-02 21:25:58,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df99065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:25:58, skipping insertion in model container [2018-12-02 21:25:58,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:25:58" (3/3) ... [2018-12-02 21:25:58,256 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 21:25:58,261 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:25:58,266 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 21:25:58,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 21:25:58,291 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:25:58,291 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:25:58,292 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:25:58,292 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:25:58,292 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:25:58,292 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:25:58,292 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:25:58,292 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:25:58,292 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:25:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-02 21:25:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:25:58,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:58,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:25:58,306 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:58,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:58,309 INFO L82 PathProgramCache]: Analyzing trace with hash -131027277, now seen corresponding path program 1 times [2018-12-02 21:25:58,312 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:25:58,312 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:25:58,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:58,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:25:58,410 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:25:58,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:25:58,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:25:58,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:25:58,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:25:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:25:58,429 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-12-02 21:25:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:58,501 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-12-02 21:25:58,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:25:58,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-02 21:25:58,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:58,509 INFO L225 Difference]: With dead ends: 95 [2018-12-02 21:25:58,509 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 21:25:58,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:25:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 21:25:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-02 21:25:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 21:25:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-02 21:25:58,537 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2018-12-02 21:25:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:58,537 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-02 21:25:58,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:25:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-02 21:25:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 21:25:58,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:58,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:25:58,538 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:58,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1869041009, now seen corresponding path program 1 times [2018-12-02 21:25:58,539 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:25:58,539 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:25:58,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:58,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:25:58,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:25:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:25:58,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:25:58,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:25:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:58,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 21:25:58,872 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:25:58,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:25:58,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 12 [2018-12-02 21:25:58,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:25:58,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:25:58,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:25:58,894 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2018-12-02 21:25:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:59,111 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-12-02 21:25:59,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:25:59,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-12-02 21:25:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:59,113 INFO L225 Difference]: With dead ends: 82 [2018-12-02 21:25:59,113 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 21:25:59,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-02 21:25:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 21:25:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2018-12-02 21:25:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 21:25:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-12-02 21:25:59,122 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 33 [2018-12-02 21:25:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:59,122 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-12-02 21:25:59,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:25:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-12-02 21:25:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 21:25:59,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:59,124 INFO L402 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] [2018-12-02 21:25:59,124 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:59,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1257371639, now seen corresponding path program 1 times [2018-12-02 21:25:59,125 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:25:59,125 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:25:59,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:59,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 21:25:59,236 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:25:59,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:25:59,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:25:59,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:25:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:25:59,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:25:59,239 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-12-02 21:25:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:59,301 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-12-02 21:25:59,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:25:59,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-02 21:25:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:59,304 INFO L225 Difference]: With dead ends: 79 [2018-12-02 21:25:59,304 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 21:25:59,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:25:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 21:25:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-12-02 21:25:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 21:25:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-02 21:25:59,311 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 50 [2018-12-02 21:25:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:59,311 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-02 21:25:59,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:25:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-02 21:25:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 21:25:59,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:59,312 INFO L402 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] [2018-12-02 21:25:59,312 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:59,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 218570874, now seen corresponding path program 1 times [2018-12-02 21:25:59,313 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:25:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:25:59,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:59,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:25:59,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:25:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:25:59,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:25:59,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/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-12-02 21:25:59,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:25:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:25:59,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:25:59,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:25:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 21:25:59,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 21:25:59,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2018-12-02 21:25:59,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:25:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:25:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:25:59,603 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 10 states. [2018-12-02 21:25:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:59,729 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-12-02 21:25:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:25:59,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-12-02 21:25:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:59,731 INFO L225 Difference]: With dead ends: 91 [2018-12-02 21:25:59,731 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 21:25:59,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:25:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 21:25:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-12-02 21:25:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 21:25:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-12-02 21:25:59,739 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 51 [2018-12-02 21:25:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:59,739 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-12-02 21:25:59,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:25:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-12-02 21:25:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 21:25:59,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:59,741 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-12-02 21:25:59,741 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:59,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash -667693808, now seen corresponding path program 2 times [2018-12-02 21:25:59,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:25:59,742 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:25:59,755 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 21:25:59,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-02 21:25:59,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:25:59,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:25:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 21:25:59,820 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 21:25:59,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:25:59,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:25:59,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:25:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:25:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:25:59,822 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 6 states. [2018-12-02 21:25:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:25:59,885 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2018-12-02 21:25:59,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:25:59,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-02 21:25:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:25:59,887 INFO L225 Difference]: With dead ends: 81 [2018-12-02 21:25:59,887 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 21:25:59,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:25:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 21:25:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-02 21:25:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 21:25:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-12-02 21:25:59,895 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 59 [2018-12-02 21:25:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:25:59,896 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-12-02 21:25:59,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:25:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-12-02 21:25:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 21:25:59,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:25:59,897 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-12-02 21:25:59,897 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:25:59,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:25:59,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1916725156, now seen corresponding path program 1 times [2018-12-02 21:25:59,897 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:25:59,897 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:25:59,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:26:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:26:00,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:26:00,085 INFO L478 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-12-02 21:26:00,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:26:00,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:00,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:00,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 21:26:00,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 21:26:00,179 INFO L478 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-12-02 21:26:00,181 INFO L478 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-12-02 21:26:00,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,199 INFO L478 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-12-02 21:26:00,201 INFO L478 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-12-02 21:26:00,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 21:26:00,499 INFO L478 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 29 treesize of output 20 [2018-12-02 21:26:00,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-02 21:26:00,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-02 21:26:00,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:00,715 INFO L478 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 115 treesize of output 116 [2018-12-02 21:26:00,719 INFO L478 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 36 treesize of output 1 [2018-12-02 21:26:00,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:00,763 INFO L478 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 78 treesize of output 82 [2018-12-02 21:26:00,767 INFO L478 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 36 treesize of output 1 [2018-12-02 21:26:00,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:00,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:43 [2018-12-02 21:26:10,689 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 21:26:10,706 INFO L478 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 51 treesize of output 44 [2018-12-02 21:26:10,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:10,717 INFO L478 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 44 treesize of output 42 [2018-12-02 21:26:10,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:10,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:10,776 INFO L478 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 41 treesize of output 36 [2018-12-02 21:26:10,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:10,784 INFO L478 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 32 [2018-12-02 21:26:10,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:10,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:10,816 INFO L478 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 37 treesize of output 44 [2018-12-02 21:26:10,819 INFO L478 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-12-02 21:26:10,819 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:10,826 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:10,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:10,849 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2018-12-02 21:26:11,382 INFO L478 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 1 case distinctions, treesize of input 50 treesize of output 48 [2018-12-02 21:26:11,385 INFO L478 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 44 treesize of output 33 [2018-12-02 21:26:11,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:11,408 INFO L478 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 33 treesize of output 18 [2018-12-02 21:26:11,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:11,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2018-12-02 21:26:11,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:11,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:11,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 21:26:11,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 21:26:11,460 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:11,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 21:26:11,473 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:11,474 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:11,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:11,477 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:69, output treesize:9 [2018-12-02 21:26:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 21:26:11,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:26:12,584 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 21:26:12,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:12,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:12,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:12,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:12,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:12,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2018-12-02 21:26:12,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:26:12,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:26:12,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:26:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:26:12,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:26:12,969 INFO L478 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-12-02 21:26:12,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:12,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:12,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 21:26:12,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:12,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:12,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 21:26:12,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:12,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:12,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 21:26:12,990 INFO L478 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-12-02 21:26:12,993 INFO L478 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-12-02 21:26:12,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:12,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,012 INFO L478 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-12-02 21:26:13,014 INFO L478 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-12-02 21:26:13,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 21:26:13,086 INFO L478 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 29 treesize of output 20 [2018-12-02 21:26:13,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-02 21:26:13,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-02 21:26:13,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:13,145 INFO L478 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 123 treesize of output 127 [2018-12-02 21:26:13,149 INFO L478 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 36 treesize of output 1 [2018-12-02 21:26:13,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,195 INFO L478 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 70 treesize of output 71 [2018-12-02 21:26:13,199 INFO L478 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 36 treesize of output 1 [2018-12-02 21:26:13,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:43 [2018-12-02 21:26:13,238 INFO L478 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 41 treesize of output 36 [2018-12-02 21:26:13,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:13,252 INFO L478 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 32 [2018-12-02 21:26:13,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,330 INFO L478 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 37 treesize of output 44 [2018-12-02 21:26:13,333 INFO L478 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-12-02 21:26:13,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,377 INFO L478 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 51 treesize of output 44 [2018-12-02 21:26:13,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:26:13,385 INFO L478 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 44 treesize of output 42 [2018-12-02 21:26:13,385 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,393 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,409 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2018-12-02 21:26:13,495 INFO L478 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 1 case distinctions, treesize of input 50 treesize of output 48 [2018-12-02 21:26:13,500 INFO L478 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 44 treesize of output 33 [2018-12-02 21:26:13,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2018-12-02 21:26:13,533 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 21:26:13,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 21:26:13,579 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 21:26:13,590 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,591 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:26:13,594 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:69, output treesize:9 [2018-12-02 21:26:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 21:26:13,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:26:14,146 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 21:26:14,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:14,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:14,280 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:14,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:14,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 21:26:14,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:44 [2018-12-02 21:26:14,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 21:26:14,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-12-02 21:26:14,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 21:26:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 21:26:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1585, Unknown=17, NotChecked=0, Total=1722 [2018-12-02 21:26:14,511 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 31 states. [2018-12-02 21:26:52,514 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-02 21:27:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:27:54,285 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2018-12-02 21:27:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 21:27:54,286 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-02 21:27:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:27:54,287 INFO L225 Difference]: With dead ends: 119 [2018-12-02 21:27:54,288 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 21:27:54,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=319, Invalid=3801, Unknown=40, NotChecked=0, Total=4160 [2018-12-02 21:27:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 21:27:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-12-02 21:27:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 21:27:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2018-12-02 21:27:54,306 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 60 [2018-12-02 21:27:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:27:54,306 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-12-02 21:27:54,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 21:27:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2018-12-02 21:27:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 21:27:54,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:27:54,307 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 21:27:54,307 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:27:54,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:27:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1981991280, now seen corresponding path program 2 times [2018-12-02 21:27:54,308 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:27:54,308 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:27:54,321 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 21:27:54,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:27:54,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:27:54,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:27:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 21:27:54,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:27:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 21:27:54,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:27:54,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:27:54,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:27:54,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:27:54,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:27:54,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:27:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 21:27:54,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:27:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 21:27:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 21:27:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-02 21:27:55,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 21:27:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 21:27:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:27:55,075 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand 18 states. [2018-12-02 21:27:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:27:55,887 INFO L93 Difference]: Finished difference Result 171 states and 236 transitions. [2018-12-02 21:27:55,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:27:55,889 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-12-02 21:27:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:27:55,890 INFO L225 Difference]: With dead ends: 171 [2018-12-02 21:27:55,890 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 21:27:55,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:27:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 21:27:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2018-12-02 21:27:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 21:27:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2018-12-02 21:27:55,907 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 61 [2018-12-02 21:27:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:27:55,908 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2018-12-02 21:27:55,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 21:27:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2018-12-02 21:27:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 21:27:55,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:27:55,909 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 21:27:55,909 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:27:55,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:27:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash -467611271, now seen corresponding path program 3 times [2018-12-02 21:27:55,909 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:27:55,909 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:27:55,922 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 21:27:56,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:27:56,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:27:56,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:27:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:27:56,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:27:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:27:56,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:27:56,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:27:56,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:27:56,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:27:56,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:27:56,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:27:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:27:56,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:27:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:27:56,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:27:56,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7, 7] total 15 [2018-12-02 21:27:56,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 21:27:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:27:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:27:56,417 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 15 states. [2018-12-02 21:27:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:27:56,600 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2018-12-02 21:27:56,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:27:56,601 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-12-02 21:27:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:27:56,603 INFO L225 Difference]: With dead ends: 188 [2018-12-02 21:27:56,603 INFO L226 Difference]: Without dead ends: 133 [2018-12-02 21:27:56,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-02 21:27:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-02 21:27:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-12-02 21:27:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 21:27:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 169 transitions. [2018-12-02 21:27:56,619 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 169 transitions. Word has length 61 [2018-12-02 21:27:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:27:56,619 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 169 transitions. [2018-12-02 21:27:56,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 21:27:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 169 transitions. [2018-12-02 21:27:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 21:27:56,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:27:56,621 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 21:27:56,621 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:27:56,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:27:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 741283725, now seen corresponding path program 4 times [2018-12-02 21:27:56,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:27:56,621 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:27:56,635 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:27:56,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:27:56,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:27:56,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:27:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:27:56,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:27:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:27:56,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:27:56,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:27:56,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:27:56,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:27:56,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:27:56,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:27:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:27:56,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:27:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:27:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 21:27:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-02 21:27:57,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 21:27:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 21:27:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:27:57,327 INFO L87 Difference]: Start difference. First operand 131 states and 169 transitions. Second operand 18 states. [2018-12-02 21:27:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:27:58,083 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2018-12-02 21:27:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:27:58,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-12-02 21:27:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:27:58,084 INFO L225 Difference]: With dead ends: 156 [2018-12-02 21:27:58,084 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 21:27:58,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-02 21:27:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 21:27:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-12-02 21:27:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 21:27:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-12-02 21:27:58,100 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 61 [2018-12-02 21:27:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:27:58,101 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-12-02 21:27:58,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 21:27:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-12-02 21:27:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 21:27:58,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:27:58,102 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 21:27:58,102 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:27:58,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:27:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1006550601, now seen corresponding path program 1 times [2018-12-02 21:27:58,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:27:58,103 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:27:58,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:27:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:27:58,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:27:58,357 INFO L478 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-12-02 21:27:58,359 INFO L478 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-12-02 21:27:58,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:58,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:58,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:58,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 21:27:58,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-12-02 21:27:58,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 21:27:58,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:58,700 INFO L478 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-12-02 21:27:58,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:58,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:58,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:58,706 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2018-12-02 21:27:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 21:27:58,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:27:59,430 INFO L478 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 11 treesize of output 9 [2018-12-02 21:27:59,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-02 21:27:59,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:27:59,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:27:59,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 21:27:59,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:41 [2018-12-02 21:27:59,685 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 21:27:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:27:59,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:27:59,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:27:59,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:27:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:27:59,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:28:00,133 INFO L478 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-12-02 21:28:00,134 INFO L478 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-12-02 21:28:00,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:00,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:00,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:00,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 21:28:01,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-12-02 21:28:01,010 INFO L478 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 22 treesize of output 15 [2018-12-02 21:28:01,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:01,028 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:28:01,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-02 21:28:01,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:01,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:01,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:01,039 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:9 [2018-12-02 21:28:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:28:01,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:28:02,518 INFO L478 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 11 treesize of output 9 [2018-12-02 21:28:02,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-02 21:28:02,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:28:02,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:28:02,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 21:28:02,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:74 [2018-12-02 21:28:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:28:02,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 21:28:02,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 18, 15] total 58 [2018-12-02 21:28:02,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-02 21:28:02,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-02 21:28:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3017, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 21:28:02,828 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 58 states. [2018-12-02 21:28:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:28:11,655 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2018-12-02 21:28:11,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 21:28:11,655 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 69 [2018-12-02 21:28:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:28:11,656 INFO L225 Difference]: With dead ends: 123 [2018-12-02 21:28:11,656 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 21:28:11,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 213 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=502, Invalid=4610, Unknown=0, NotChecked=0, Total=5112 [2018-12-02 21:28:11,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 21:28:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-02 21:28:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 21:28:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-02 21:28:11,664 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 69 [2018-12-02 21:28:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:28:11,664 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-02 21:28:11,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-02 21:28:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-02 21:28:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 21:28:11,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:28:11,665 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 21:28:11,665 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:28:11,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:28:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash 463616149, now seen corresponding path program 2 times [2018-12-02 21:28:11,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 21:28:11,665 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 21:28:11,679 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 21:28:11,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:28:11,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:28:11,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:28:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 21:28:11,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:28:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 21:28:11,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:28:11,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a705c66-4b32-49e3-875b-01e01603e368/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 21:28:11,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 21:28:11,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 21:28:11,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:28:11,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:28:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 21:28:11,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:28:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 21:28:12,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 21:28:12,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-02 21:28:12,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 21:28:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 21:28:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-02 21:28:12,238 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 18 states. [2018-12-02 21:28:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:28:12,541 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-12-02 21:28:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:28:12,542 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-12-02 21:28:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:28:12,542 INFO L225 Difference]: With dead ends: 63 [2018-12-02 21:28:12,542 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:28:12,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-12-02 21:28:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:28:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:28:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:28:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:28:12,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-12-02 21:28:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:28:12,543 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:28:12,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 21:28:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:28:12,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:28:12,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 21:28:12,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 21:28:12,906 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-12-02 21:28:13,066 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-02 21:28:13,428 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-12-02 21:28:13,584 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-02 21:28:13,858 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2018-12-02 21:28:14,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 21:28:14,042 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-02 21:28:14,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-12-02 21:28:14,043 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 560 562) the Hoare annotation is: true [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 560 562) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 560 562) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L451 ceAbstractionStarter]: At program point L582-2(lines 582 586) the Hoare annotation is: true [2018-12-02 21:28:14,043 INFO L451 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point L582-3(lines 581 587) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (let ((.cse0 (= |sll_update_at_#in~index| sll_update_at_~index)) (.cse1 (= sll_update_at_~head.base |sll_update_at_#in~head.base|)) (.cse2 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset)) (.cse3 (= sll_update_at_~data |sll_update_at_#in~data|))) (and (or (bvsgt (bvadd |sll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) .cse4) sll_update_at_~head.base) (= (bvadd sll_update_at_~index (_ bv1 32)) |sll_update_at_#in~index|) .cse3 (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse4) sll_update_at_~head.offset)))) (let ((.cse5 (= |old(#memory_int)| |#memory_int|)) (.cse6 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse7 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (and .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (and .cse5 .cse6 .cse7 (bvsgt |sll_update_at_#in~index| (_ bv0 32))))))) [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L444 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 21:28:14,043 INFO L444 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse1 (= (_ bv0 32) sll_create_~head~0.offset)) (.cse0 (or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32))))) (or (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) .cse0 .cse1) (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse1 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) .cse0))) [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2018-12-02 21:28:14,043 INFO L444 ceAbstractionStarter]: At program point L574-3(lines 574 578) the Hoare annotation is: (let ((.cse1 (= (_ bv1 1) (select |#valid| sll_create_~head~0.base))) (.cse0 (= (_ bv0 32) sll_create_~head~0.offset))) (or (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse0 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and .cse1 (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) .cse0) (and .cse1 (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) .cse0))) [2018-12-02 21:28:14,043 INFO L448 ceAbstractionStarter]: For program point L574-4(lines 574 578) no Hoare annotation was computed. [2018-12-02 21:28:14,044 INFO L444 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 21:28:14,044 INFO L448 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-12-02 21:28:14,044 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 21:28:14,044 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 21:28:14,044 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 21:28:14,044 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 21:28:14,044 INFO L444 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse4 (bvneg main_~len~0)) (.cse1 (= main_~s~0.offset (_ bv0 32)))) (or (let ((.cse3 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse5 .cse3)) (.cse2 (bvadd main_~len~0 (_ bv4294967294 32)))) (and (not (= .cse0 main_~s~0.base)) .cse1 (= .cse2 (_ bv0 32)) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) (= (bvadd (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse3)) (_ bv1 32)) (bvadd (bvneg .cse4) main_~len~0)) (= .cse2 main_~i~0)))) (and (not (= (select .cse5 (_ bv4 32)) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd .cse4 main_~new_data~0)) .cse1 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-12-02 21:28:14,044 INFO L448 ceAbstractionStarter]: For program point L611-2(lines 611 616) no Hoare annotation was computed. [2018-12-02 21:28:14,044 INFO L448 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-12-02 21:28:14,044 INFO L444 ceAbstractionStarter]: At program point L611-3(lines 611 616) the Hoare annotation is: (let ((.cse9 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse5 (bvadd main_~len~0 (_ bv4294967294 32))) (.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse9)) (.cse10 (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967294 32))) (.cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (= .cse10 .cse7)) (.cse0 (not (= .cse8 main_~s~0.base))) (.cse6 (= .cse10 main_~new_data~0)) (.cse2 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= .cse5 (_ bv0 32))) (.cse4 (= (bvadd (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9)) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse4 (= .cse5 main_~i~0)) (and .cse1 .cse0 .cse6 .cse2 .cse4 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse6 .cse2 (= (_ bv2 32) .cse7) .cse3 .cse4 (= (bvadd main_~expected~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967293 32)) main_~i~0)))))) [2018-12-02 21:28:14,044 INFO L444 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-02 21:28:14,044 INFO L444 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 21:28:14,044 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse9 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse2 (bvneg main_~len~0)) (.cse6 (bvadd main_~len~0 (_ bv4294967294 32))) (.cse8 (select .cse0 .cse9))) (let ((.cse3 (not (= .cse8 main_~s~0.base))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse4 (= .cse6 (_ bv0 32))) (.cse5 (= (bvadd (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9)) (_ bv1 32)) (bvadd (bvneg .cse2) main_~len~0)))) (or (and (not (= (select .cse0 (_ bv4 32)) main_~s~0.base)) .cse1 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd .cse2 main_~new_data~0)) .cse3 .cse1 .cse4 .cse5 (= .cse6 main_~i~0)) (let ((.cse7 (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967294 32)))) (and (= .cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) .cse3 (= .cse7 main_~new_data~0) .cse1 .cse4 .cse5 (= (bvadd main_~len~0 (_ bv4294967293 32)) main_~i~0))))))) [2018-12-02 21:28:14,044 INFO L448 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-12-02 21:28:14,044 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L444 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: false [2018-12-02 21:28:14,045 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L444 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse7 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse7))) (let ((.cse2 (not (= .cse6 main_~s~0.base))) (.cse3 (= main_~s~0.offset (_ bv0 32))) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse4 (= (bvadd (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse7)) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (let ((.cse0 (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967294 32)))) (and (= .cse0 .cse1) .cse2 (= .cse0 main_~new_data~0) .cse3 (= (_ bv3 32) main_~expected~0) .cse4 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse5 (bvadd main_~len~0 (_ bv4294967294 32)))) (and .cse2 .cse3 (= (bvadd main_~i~0 (_ bv2 32)) .cse1) (= .cse5 (_ bv0 32)) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse4 (= (bvadd main_~expected~0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse5 main_~i~0))))))) [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L451 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L444 ceAbstractionStarter]: At program point L589-2(lines 589 592) the Hoare annotation is: (let ((.cse2 (bvadd |sll_get_data_at_#in~index| (_ bv4294967295 32)))) (or (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|)) (forall ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))) (or (= v_main_~s~0.base_BEFORE_CALL_3 .cse0) (not (= (_ bv3 32) (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))))) (let ((.cse1 (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (and (bvsgt |sll_get_data_at_#in~index| (_ bv0 32)) (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse1)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse1)) (= .cse2 sll_get_data_at_~index))) (forall ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32))) (not (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_9) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))) (bvsgt .cse2 (_ bv0 32)))) [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point L589-3(lines 589 592) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-02 21:28:14,045 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-12-02 21:28:14,045 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-12-02 21:28:14,046 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-12-02 21:28:14,046 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-12-02 21:28:14,046 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-12-02 21:28:14,048 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-02 21:28:14,050 INFO L168 Benchmark]: Toolchain (without parser) took 136375.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.2 MB). Free memory was 939.3 MB in the beginning and 836.9 MB in the end (delta: 102.5 MB). Peak memory consumption was 355.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:28:14,051 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:28:14,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:28:14,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:28:14,051 INFO L168 Benchmark]: Boogie Preprocessor took 20.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:28:14,051 INFO L168 Benchmark]: RCFGBuilder took 252.85 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:28:14,052 INFO L168 Benchmark]: TraceAbstraction took 135797.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 836.9 MB in the end (delta: 262.2 MB). Peak memory consumption was 364.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:28:14,053 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.85 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 135797.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 836.9 MB in the end (delta: 262.2 MB). Peak memory consumption was 364.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...