./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:20:25,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:20:25,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:20:25,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:20:25,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:20:25,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:20:25,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:20:25,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:20:25,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:20:25,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:20:25,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:20:25,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:20:25,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:20:25,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:20:25,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:20:25,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:20:25,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:20:25,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:20:25,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:20:25,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:20:25,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:20:25,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:20:25,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:20:25,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:20:25,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:20:25,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:20:25,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:20:25,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:20:25,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:20:25,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:20:25,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:20:25,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:20:25,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:20:25,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:20:25,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:20:25,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:20:25,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:20:25,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:20:25,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:20:25,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:20:25,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:20:25,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:20:25,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:20:25,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:20:25,824 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:20:25,824 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:20:25,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:20:25,825 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:20:25,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:20:25,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:20:25,826 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:20:25,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:20:25,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:20:25,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:20:25,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:20:25,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:20:25,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:20:25,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:20:25,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:20:25,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:20:25,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:20:25,838 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:20:25,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:20:25,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:20:25,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:20:25,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:20:25,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:25,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:20:25,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:20:25,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:20:25,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:20:25,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:20:25,841 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:20:25,841 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:20:25,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:20:25,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-11-02 20:20:26,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:20:26,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:20:26,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:20:26,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:20:26,127 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:20:26,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-02 20:20:26,187 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data/27804c88a/e7b1c6fc32704f20b2c077e1bcab8f94/FLAGeab3455d4 [2022-11-02 20:20:26,688 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:20:26,689 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-02 20:20:26,701 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data/27804c88a/e7b1c6fc32704f20b2c077e1bcab8f94/FLAGeab3455d4 [2022-11-02 20:20:26,999 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data/27804c88a/e7b1c6fc32704f20b2c077e1bcab8f94 [2022-11-02 20:20:27,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:20:27,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:20:27,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:27,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:20:27,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:20:27,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c842da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27, skipping insertion in model container [2022-11-02 20:20:27,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:20:27,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:20:27,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-02 20:20:27,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:27,420 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:20:27,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-02 20:20:27,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:27,486 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:20:27,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27 WrapperNode [2022-11-02 20:20:27,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:27,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:27,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:20:27,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:20:27,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,570 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-11-02 20:20:27,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:27,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:20:27,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:20:27,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:20:27,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,622 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:20:27,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:20:27,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:20:27,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:20:27,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (1/1) ... [2022-11-02 20:20:27,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:27,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:27,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:20:27,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:20:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:20:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:20:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:20:27,726 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:20:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:20:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:20:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:20:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:20:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:20:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:20:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:20:27,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:20:27,861 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:20:27,863 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:20:28,200 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:20:28,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:20:28,207 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:20:28,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:28 BoogieIcfgContainer [2022-11-02 20:20:28,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:20:28,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:20:28,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:20:28,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:20:28,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:20:27" (1/3) ... [2022-11-02 20:20:28,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5e7f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:28, skipping insertion in model container [2022-11-02 20:20:28,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:27" (2/3) ... [2022-11-02 20:20:28,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5e7f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:28, skipping insertion in model container [2022-11-02 20:20:28,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:28" (3/3) ... [2022-11-02 20:20:28,228 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-11-02 20:20:28,252 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:20:28,253 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:20:28,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:20:28,351 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3586a140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:20:28,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:20:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:20:28,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:28,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:28,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-11-02 20:20:28,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872255259] [2022-11-02 20:20:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872255259] [2022-11-02 20:20:28,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872255259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:28,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:20:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911041506] [2022-11-02 20:20:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:28,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:20:28,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:28,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:20:28,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:28,763 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:20:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:28,836 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-11-02 20:20:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:20:28,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:20:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:28,847 INFO L225 Difference]: With dead ends: 63 [2022-11-02 20:20:28,848 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 20:20:28,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:28,856 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:28,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 20:20:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-02 20:20:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-02 20:20:28,894 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-11-02 20:20:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:28,896 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-02 20:20:28,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:20:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-02 20:20:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:20:28,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:28,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:28,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:20:28,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:28,899 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-11-02 20:20:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:28,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669551262] [2022-11-02 20:20:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:29,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:29,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669551262] [2022-11-02 20:20:29,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669551262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:29,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:29,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:20:29,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144608364] [2022-11-02 20:20:29,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:29,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:20:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:29,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:20:29,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:20:29,123 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:20:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:29,186 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-11-02 20:20:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:20:29,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:20:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:29,187 INFO L225 Difference]: With dead ends: 51 [2022-11-02 20:20:29,188 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 20:20:29,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:20:29,189 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:29,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 20:20:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-11-02 20:20:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-02 20:20:29,197 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-11-02 20:20:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:29,198 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-02 20:20:29,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:20:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-02 20:20:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:20:29,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:29,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:29,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:20:29,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-11-02 20:20:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:29,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901533972] [2022-11-02 20:20:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:20:29,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:29,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901533972] [2022-11-02 20:20:29,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901533972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:29,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:29,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:20:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604521515] [2022-11-02 20:20:29,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:29,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:20:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:29,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:20:29,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:20:29,492 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:29,568 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-11-02 20:20:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:20:29,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-02 20:20:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:29,570 INFO L225 Difference]: With dead ends: 53 [2022-11-02 20:20:29,570 INFO L226 Difference]: Without dead ends: 44 [2022-11-02 20:20:29,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:29,573 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:29,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 80 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-02 20:20:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-11-02 20:20:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-02 20:20:29,582 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-11-02 20:20:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:29,583 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-02 20:20:29,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-02 20:20:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:20:29,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:29,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:29,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:20:29,585 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-11-02 20:20:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:29,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114621375] [2022-11-02 20:20:29,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:29,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:20:29,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:29,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114621375] [2022-11-02 20:20:29,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114621375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:29,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:29,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:29,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969557106] [2022-11-02 20:20:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:29,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:20:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:29,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:20:29,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:29,932 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:30,010 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-11-02 20:20:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:20:30,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-02 20:20:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:30,011 INFO L225 Difference]: With dead ends: 59 [2022-11-02 20:20:30,011 INFO L226 Difference]: Without dead ends: 45 [2022-11-02 20:20:30,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:30,013 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:30,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 88 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-02 20:20:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-11-02 20:20:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-02 20:20:30,021 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2022-11-02 20:20:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:30,021 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-02 20:20:30,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-02 20:20:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:20:30,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:30,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:30,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:20:30,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1641789207, now seen corresponding path program 1 times [2022-11-02 20:20:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576479785] [2022-11-02 20:20:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:30,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:30,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:20:30,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:30,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576479785] [2022-11-02 20:20:30,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576479785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:30,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046391892] [2022-11-02 20:20:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:30,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:30,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:30,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:20:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:30,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:20:30,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:20:30,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:20:30,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046391892] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:30,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:30,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-11-02 20:20:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313152467] [2022-11-02 20:20:30,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:30,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:20:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:20:30,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:30,690 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:30,821 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-11-02 20:20:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:20:30,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-11-02 20:20:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:30,822 INFO L225 Difference]: With dead ends: 56 [2022-11-02 20:20:30,823 INFO L226 Difference]: Without dead ends: 47 [2022-11-02 20:20:30,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:30,824 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 90 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:30,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 123 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-02 20:20:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-11-02 20:20:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-11-02 20:20:30,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 36 [2022-11-02 20:20:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:30,832 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-11-02 20:20:30,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-11-02 20:20:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:20:30,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:30,833 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:20:30,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:31,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:31,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1233857887, now seen corresponding path program 2 times [2022-11-02 20:20:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:31,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484004380] [2022-11-02 20:20:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:31,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:20:31,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:31,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484004380] [2022-11-02 20:20:31,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484004380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:31,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:31,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013187903] [2022-11-02 20:20:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:31,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:20:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:20:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:31,240 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:31,324 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-11-02 20:20:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:20:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-02 20:20:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:31,326 INFO L225 Difference]: With dead ends: 55 [2022-11-02 20:20:31,326 INFO L226 Difference]: Without dead ends: 47 [2022-11-02 20:20:31,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:31,327 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:31,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 104 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-02 20:20:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-11-02 20:20:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-02 20:20:31,337 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 41 [2022-11-02 20:20:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:31,337 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-02 20:20:31,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-02 20:20:31,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:20:31,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:31,339 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:20:31,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:20:31,339 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:31,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:31,340 INFO L85 PathProgramCache]: Analyzing trace with hash -353457273, now seen corresponding path program 1 times [2022-11-02 20:20:31,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:31,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542798706] [2022-11-02 20:20:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:20:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:34,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:20:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:34,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542798706] [2022-11-02 20:20:34,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542798706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:34,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126568624] [2022-11-02 20:20:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:34,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:34,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:34,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:34,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:20:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:34,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-02 20:20:34,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:34,477 INFO L390 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 [2022-11-02 20:20:34,669 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:20:34,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:20:34,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:34,786 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:34,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-02 20:20:34,925 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-02 20:20:34,926 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-02 20:20:34,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:35,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:35,144 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_36| input size 47 context size 47 output size 47 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-02 20:20:35,147 INFO L158 Benchmark]: Toolchain (without parser) took 8144.37ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 77.3MB in the beginning and 83.8MB in the end (delta: -6.4MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2022-11-02 20:20:35,147 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 59.8MB in the beginning and 59.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:20:35,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.22ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 64.7MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:20:35,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.55ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 62.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:20:35,148 INFO L158 Benchmark]: Boogie Preprocessor took 63.50ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 60.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:20:35,149 INFO L158 Benchmark]: RCFGBuilder took 574.85ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 45.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:20:35,149 INFO L158 Benchmark]: TraceAbstraction took 6933.97ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 44.4MB in the beginning and 83.8MB in the end (delta: -39.4MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2022-11-02 20:20:35,158 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 59.8MB in the beginning and 59.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.22ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 64.7MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.55ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 62.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.50ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 60.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.85ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 45.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6933.97ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 44.4MB in the beginning and 83.8MB in the end (delta: -39.4MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_36| input size 47 context size 47 output size 47 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_36| input size 47 context size 47 output size 47: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-02 20:20:35,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:20:37,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:20:37,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:20:37,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:20:37,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:20:37,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:20:37,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:20:37,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:20:37,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:20:37,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:20:37,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:20:37,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:20:37,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:20:37,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:20:37,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:20:37,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:20:37,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:20:37,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:20:37,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:20:37,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:20:37,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:20:37,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:20:37,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:20:37,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:20:37,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:20:37,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:20:37,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:20:37,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:20:37,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:20:37,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:20:37,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:20:37,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:20:37,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:20:37,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:20:37,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:20:37,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:20:37,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:20:37,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:20:37,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:20:37,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:20:37,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:20:37,722 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 20:20:37,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:20:37,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:20:37,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:20:37,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:20:37,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:20:37,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:20:37,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:20:37,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:20:37,766 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:20:37,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:20:37,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:20:37,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:20:37,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:20:37,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:20:37,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:20:37,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:20:37,768 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:20:37,768 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:20:37,768 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:20:37,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:20:37,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:20:37,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:20:37,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:20:37,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:20:37,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:20:37,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:20:37,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:37,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:20:37,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:20:37,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:20:37,771 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:20:37,771 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:20:37,771 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:20:37,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:20:37,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:20:37,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:20:37,772 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-11-02 20:20:38,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:20:38,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:20:38,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:20:38,167 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:20:38,167 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:20:38,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-02 20:20:38,250 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data/2538886e9/5286886419eb4f03a0c2296bda2d4968/FLAGb83a110d1 [2022-11-02 20:20:38,880 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:20:38,881 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-02 20:20:38,893 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data/2538886e9/5286886419eb4f03a0c2296bda2d4968/FLAGb83a110d1 [2022-11-02 20:20:39,166 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/data/2538886e9/5286886419eb4f03a0c2296bda2d4968 [2022-11-02 20:20:39,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:20:39,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:20:39,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:39,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:20:39,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:20:39,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267539be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39, skipping insertion in model container [2022-11-02 20:20:39,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:20:39,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:20:39,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-02 20:20:39,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:39,558 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:20:39,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-02 20:20:39,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:39,624 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:20:39,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39 WrapperNode [2022-11-02 20:20:39,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:39,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:39,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:20:39,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:20:39,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,669 INFO L138 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-11-02 20:20:39,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:39,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:20:39,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:20:39,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:20:39,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,697 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:20:39,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:20:39,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:20:39,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:20:39,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (1/1) ... [2022-11-02 20:20:39,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:39,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:39,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:20:39,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:20:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 20:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:20:39,800 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:20:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:20:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:20:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:20:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:20:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:20:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 20:20:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:20:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:20:39,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:20:39,998 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:20:40,000 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:20:40,432 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:20:40,439 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:20:40,439 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:20:40,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:40 BoogieIcfgContainer [2022-11-02 20:20:40,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:20:40,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:20:40,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:20:40,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:20:40,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:20:39" (1/3) ... [2022-11-02 20:20:40,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6419d39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:40, skipping insertion in model container [2022-11-02 20:20:40,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:39" (2/3) ... [2022-11-02 20:20:40,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6419d39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:40, skipping insertion in model container [2022-11-02 20:20:40,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:40" (3/3) ... [2022-11-02 20:20:40,451 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-11-02 20:20:40,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:20:40,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:20:40,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:20:40,542 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5be84078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:20:40,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:20:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:20:40,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:40,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:40,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-11-02 20:20:40,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:40,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810235748] [2022-11-02 20:20:40,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:40,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:40,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:40,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:40,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:20:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:40,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-02 20:20:40,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:40,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:20:40,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:40,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810235748] [2022-11-02 20:20:40,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810235748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:40,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:40,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:20:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242609275] [2022-11-02 20:20:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:40,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:20:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:40,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:20:40,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:20:40,921 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:20:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:40,946 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-11-02 20:20:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:20:40,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:20:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:40,967 INFO L225 Difference]: With dead ends: 63 [2022-11-02 20:20:40,967 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 20:20:40,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:20:40,977 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:40,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 20:20:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-02 20:20:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-02 20:20:41,023 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-11-02 20:20:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:41,025 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-02 20:20:41,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:20:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-02 20:20:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:20:41,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:41,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:41,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:41,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:41,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-11-02 20:20:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:41,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175964689] [2022-11-02 20:20:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:41,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:41,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:41,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:41,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:20:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:20:41,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:41,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:20:41,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175964689] [2022-11-02 20:20:41,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175964689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:41,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:41,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:20:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173908479] [2022-11-02 20:20:41,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:41,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:20:41,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:41,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:20:41,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:41,523 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:20:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:41,559 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-11-02 20:20:41,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:20:41,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-02 20:20:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:41,562 INFO L225 Difference]: With dead ends: 51 [2022-11-02 20:20:41,562 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 20:20:41,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:41,564 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:41,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 20:20:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-11-02 20:20:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-02 20:20:41,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-11-02 20:20:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:41,573 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-02 20:20:41,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:20:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-02 20:20:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:20:41,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:41,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:41,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:41,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:41,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-11-02 20:20:41,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:41,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357563041] [2022-11-02 20:20:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:41,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:41,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:41,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:41,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:20:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:42,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:20:42,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:20:42,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:20:42,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:42,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357563041] [2022-11-02 20:20:42,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357563041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:42,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:42,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:20:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288875713] [2022-11-02 20:20:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:42,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:20:42,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:20:42,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:20:42,082 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:42,149 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-11-02 20:20:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:20:42,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-02 20:20:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:42,154 INFO L225 Difference]: With dead ends: 53 [2022-11-02 20:20:42,154 INFO L226 Difference]: Without dead ends: 44 [2022-11-02 20:20:42,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:20:42,156 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:42,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 65 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-02 20:20:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-11-02 20:20:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-02 20:20:42,167 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-11-02 20:20:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:42,168 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-02 20:20:42,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-02 20:20:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:20:42,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:42,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:42,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:42,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:42,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-11-02 20:20:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:42,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010114081] [2022-11-02 20:20:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:42,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:42,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:42,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:42,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 20:20:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:42,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:20:42,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:20:42,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:20:42,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:42,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010114081] [2022-11-02 20:20:42,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010114081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:42,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:42,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:20:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900945703] [2022-11-02 20:20:42,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:42,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:20:42,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:42,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:20:42,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:20:42,715 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:42,798 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-11-02 20:20:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:20:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-02 20:20:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:42,800 INFO L225 Difference]: With dead ends: 59 [2022-11-02 20:20:42,800 INFO L226 Difference]: Without dead ends: 45 [2022-11-02 20:20:42,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:42,801 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:42,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 92 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-02 20:20:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-11-02 20:20:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-02 20:20:42,811 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2022-11-02 20:20:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:42,811 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-02 20:20:42,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-02 20:20:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:20:42,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:42,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:42,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-02 20:20:43,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:43,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1641789207, now seen corresponding path program 1 times [2022-11-02 20:20:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:43,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813565091] [2022-11-02 20:20:43,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:43,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:43,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:43,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:43,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 20:20:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:20:43,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:20:43,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:20:43,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813565091] [2022-11-02 20:20:43,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813565091] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:43,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:20:43,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-02 20:20:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388270276] [2022-11-02 20:20:43,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:43,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:20:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:43,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:20:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:43,469 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:43,605 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-11-02 20:20:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:20:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-11-02 20:20:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:43,607 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:20:43,607 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:20:43,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:43,608 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 80 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:43,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 156 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:20:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2022-11-02 20:20:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-11-02 20:20:43,619 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 36 [2022-11-02 20:20:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:43,619 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-11-02 20:20:43,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-11-02 20:20:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:20:43,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:43,621 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:20:43,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:43,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:43,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:43,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1233857887, now seen corresponding path program 2 times [2022-11-02 20:20:43,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:43,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152925503] [2022-11-02 20:20:43,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:20:43,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:43,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:43,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:43,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-02 20:20:44,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 20:20:44,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:20:44,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:20:44,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:20:44,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:20:44,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152925503] [2022-11-02 20:20:44,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152925503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:44,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:44,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:20:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764307713] [2022-11-02 20:20:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:44,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:20:44,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:20:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:20:44,131 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:44,201 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-11-02 20:20:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:20:44,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-02 20:20:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:44,203 INFO L225 Difference]: With dead ends: 55 [2022-11-02 20:20:44,203 INFO L226 Difference]: Without dead ends: 47 [2022-11-02 20:20:44,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:44,204 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:44,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 92 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-02 20:20:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-11-02 20:20:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:20:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-02 20:20:44,215 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 41 [2022-11-02 20:20:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:44,216 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-02 20:20:44,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:20:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-02 20:20:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:20:44,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:44,218 INFO L195 NwaCegarLoop]: 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] [2022-11-02 20:20:44,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:44,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:44,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:44,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -353457273, now seen corresponding path program 1 times [2022-11-02 20:20:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:44,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718082079] [2022-11-02 20:20:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:44,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:44,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:44,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-02 20:20:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:20:44,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:44,861 INFO L390 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 7 [2022-11-02 20:20:45,094 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:20:45,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:20:45,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:45,265 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:45,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-02 20:20:45,475 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-02 20:20:45,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 38 [2022-11-02 20:20:45,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-02 20:20:46,148 INFO L356 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-11-02 20:20:46,149 INFO L390 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 65 [2022-11-02 20:20:46,154 INFO L390 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 5 treesize of output 3 [2022-11-02 20:20:46,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-02 20:20:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:46,173 INFO L390 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 32 treesize of output 34 [2022-11-02 20:20:46,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:46,577 INFO L390 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 43 treesize of output 38 [2022-11-02 20:20:46,587 INFO L390 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 28 treesize of output 30 [2022-11-02 20:20:46,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:46,596 INFO L390 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 35 treesize of output 34 [2022-11-02 20:20:47,051 INFO L390 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 33 treesize of output 21 [2022-11-02 20:20:47,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-02 20:20:47,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:20:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:20:47,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:47,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_421 (_ BitVec 32)) (v_ArrVal_420 (_ BitVec 32))) (= (bvadd (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_418) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_420)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_421)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-11-02 20:20:47,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_418) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-11-02 20:20:47,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:47,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-02 20:20:47,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:47,947 INFO L390 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 79 treesize of output 78 [2022-11-02 20:20:47,959 INFO L390 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 29 treesize of output 18 [2022-11-02 20:20:48,030 WARN L833 $PredicateComparison]: unable to prove that (and (= (bvadd (_ bv1 32) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_415) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-11-02 20:20:48,120 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_415) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-02 20:20:48,166 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_415) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) is different from false [2022-11-02 20:20:48,196 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_415) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0)) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2022-11-02 20:20:48,222 INFO L390 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 7 treesize of output 5 [2022-11-02 20:20:48,256 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_409)) .cse0 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse6 .cse3 v_ArrVal_409)) (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_416))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2022-11-02 20:20:48,335 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_ArrVal_409)) .cse3 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse3))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 .cse2 v_ArrVal_409)) (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_416))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-02 20:20:48,415 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_404))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_ArrVal_409)) .cse3 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse3))))) (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_404))) (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 .cse2 v_ArrVal_409)) (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_416))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_404))) (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-02 20:20:48,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:48,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-02 20:20:48,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:48,464 INFO L390 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 295 treesize of output 285 [2022-11-02 20:20:48,479 INFO L390 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 294 treesize of output 278 [2022-11-02 20:20:48,574 INFO L390 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 6 treesize of output 4 [2022-11-02 20:20:48,579 INFO L390 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 54 treesize of output 50 [2022-11-02 20:20:48,633 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:20:48,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 1 [2022-11-02 20:20:48,644 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:20:48,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2022-11-02 20:20:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 20:20:49,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:49,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718082079] [2022-11-02 20:20:49,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718082079] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:49,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:20:49,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2022-11-02 20:20:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536993524] [2022-11-02 20:20:49,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:49,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:20:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:49,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:20:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1240, Unknown=9, NotChecked=702, Total=2070 [2022-11-02 20:20:49,347 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 46 states, 45 states have (on average 1.511111111111111) internal successors, (68), 40 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:20:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:54,340 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-11-02 20:20:54,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:20:54,342 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.511111111111111) internal successors, (68), 40 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2022-11-02 20:20:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:54,344 INFO L225 Difference]: With dead ends: 92 [2022-11-02 20:20:54,344 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:20:54,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=216, Invalid=2163, Unknown=9, NotChecked=918, Total=3306 [2022-11-02 20:20:54,347 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 53 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:54,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 743 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 642 Invalid, 0 Unknown, 562 Unchecked, 2.7s Time] [2022-11-02 20:20:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:20:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2022-11-02 20:20:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:20:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-11-02 20:20:54,368 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 42 [2022-11-02 20:20:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:54,368 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-11-02 20:20:54,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.511111111111111) internal successors, (68), 40 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:20:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-11-02 20:20:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:20:54,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:54,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:54,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:54,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:54,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1979380319, now seen corresponding path program 2 times [2022-11-02 20:20:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521802435] [2022-11-02 20:20:54,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:20:54,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:54,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:54,591 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:54,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-02 20:20:54,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:20:54,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:20:54,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:20:54,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:20:54,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:20:55,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:55,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521802435] [2022-11-02 20:20:55,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521802435] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:55,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:20:55,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-02 20:20:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497769419] [2022-11-02 20:20:55,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:55,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:55,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:55,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:55,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:55,108 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:55,442 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-11-02 20:20:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:55,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-11-02 20:20:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:55,444 INFO L225 Difference]: With dead ends: 111 [2022-11-02 20:20:55,444 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:20:55,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:20:55,445 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 87 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:55,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 192 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:20:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2022-11-02 20:20:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 73 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:20:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2022-11-02 20:20:55,479 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 43 [2022-11-02 20:20:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:55,479 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2022-11-02 20:20:55,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2022-11-02 20:20:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:20:55,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:55,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:55,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:55,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:55,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash 497262156, now seen corresponding path program 3 times [2022-11-02 20:20:55,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:55,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102515961] [2022-11-02 20:20:55,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:20:55,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:55,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:55,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:55,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-02 20:20:55,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 20:20:55,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:20:56,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:20:56,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:20:56,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:20:56,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:56,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102515961] [2022-11-02 20:20:56,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102515961] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:56,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:20:56,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-02 20:20:56,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606163624] [2022-11-02 20:20:56,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:56,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:56,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:56,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:56,232 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:56,451 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2022-11-02 20:20:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-11-02 20:20:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:56,453 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:20:56,453 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:20:56,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:20:56,454 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 133 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:56,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 136 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:20:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-11-02 20:20:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:20:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-11-02 20:20:56,480 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 43 [2022-11-02 20:20:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:56,480 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-11-02 20:20:56,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-11-02 20:20:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:20:56,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:56,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:56,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:56,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:56,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1076128498, now seen corresponding path program 4 times [2022-11-02 20:20:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:56,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989970986] [2022-11-02 20:20:56,703 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:20:56,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:56,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:56,705 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:56,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-02 20:20:56,933 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:20:56,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:20:56,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:20:56,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:20:57,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:20:57,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:57,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989970986] [2022-11-02 20:20:57,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989970986] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:57,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:20:57,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-02 20:20:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418146843] [2022-11-02 20:20:57,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:57,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:57,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:57,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:57,127 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:57,524 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2022-11-02 20:20:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:20:57,525 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-11-02 20:20:57,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:57,526 INFO L225 Difference]: With dead ends: 160 [2022-11-02 20:20:57,526 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:20:57,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:20:57,528 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 191 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:57,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 170 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:20:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 79. [2022-11-02 20:20:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 73 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:20:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-11-02 20:20:57,564 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 43 [2022-11-02 20:20:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:57,564 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-11-02 20:20:57,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:20:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-11-02 20:20:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:20:57,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:57,567 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:20:57,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:57,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:20:57,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash 315770834, now seen corresponding path program 1 times [2022-11-02 20:20:57,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:20:57,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271287100] [2022-11-02 20:20:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:57,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:20:57,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:20:57,785 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:20:57,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-02 20:20:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:58,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 20:20:58,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:58,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-02 20:20:58,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:20:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:20:58,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:59,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-11-02 20:20:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:20:59,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:20:59,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271287100] [2022-11-02 20:20:59,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271287100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:59,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:20:59,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2022-11-02 20:20:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695250106] [2022-11-02 20:20:59,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:59,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:20:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:20:59,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:20:59,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:20:59,341 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:21:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:01,864 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-11-02 20:21:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:21:01,865 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-11-02 20:21:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:01,865 INFO L225 Difference]: With dead ends: 143 [2022-11-02 20:21:01,865 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:21:01,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2022-11-02 20:21:01,867 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 458 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:01,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 425 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:21:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:21:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2022-11-02 20:21:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:21:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-11-02 20:21:01,903 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 48 [2022-11-02 20:21:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:01,904 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-11-02 20:21:01,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:21:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-11-02 20:21:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:21:01,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:01,905 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:01,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:02,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:21:02,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1250615156, now seen corresponding path program 2 times [2022-11-02 20:21:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:21:02,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208758973] [2022-11-02 20:21:02,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:21:02,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:21:02,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:21:02,109 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:21:02,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-02 20:21:02,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:21:02,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:21:02,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:21:02,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:21:02,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:21:02,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:21:02,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208758973] [2022-11-02 20:21:02,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208758973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:02,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:21:02,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-02 20:21:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012897748] [2022-11-02 20:21:02,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:02,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:21:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:21:02,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:21:02,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:21:02,624 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:21:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:02,853 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2022-11-02 20:21:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:21:02,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-11-02 20:21:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:02,855 INFO L225 Difference]: With dead ends: 119 [2022-11-02 20:21:02,855 INFO L226 Difference]: Without dead ends: 110 [2022-11-02 20:21:02,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:21:02,857 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:02,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 162 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:21:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-02 20:21:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2022-11-02 20:21:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.10989010989011) internal successors, (101), 91 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:21:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-11-02 20:21:02,891 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 49 [2022-11-02 20:21:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:02,892 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-11-02 20:21:02,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:21:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-11-02 20:21:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:21:02,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:02,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:02,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-02 20:21:03,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:21:03,109 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash -744940389, now seen corresponding path program 5 times [2022-11-02 20:21:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:21:03,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591776997] [2022-11-02 20:21:03,110 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:21:03,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:21:03,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:21:03,112 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:21:03,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-02 20:21:03,387 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-02 20:21:03,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:21:03,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:21:03,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:21:03,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:21:03,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:21:03,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591776997] [2022-11-02 20:21:03,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591776997] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:03,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:21:03,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-11-02 20:21:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627271613] [2022-11-02 20:21:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:03,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:21:03,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:03,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:03,514 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:21:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:03,563 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-02 20:21:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:21:03,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-11-02 20:21:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:03,565 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:21:03,565 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 20:21:03,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:03,566 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:03,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 63 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:21:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 20:21:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-02 20:21:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:21:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-11-02 20:21:03,590 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 52 [2022-11-02 20:21:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:03,590 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-11-02 20:21:03,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:21:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-11-02 20:21:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:21:03,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:03,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:03,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:03,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:21:03,809 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:03,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2003315528, now seen corresponding path program 3 times [2022-11-02 20:21:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:21:03,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716001501] [2022-11-02 20:21:03,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:21:03,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:21:03,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:21:03,811 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:21:03,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-02 20:21:04,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:21:04,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:21:04,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:21:04,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:04,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:21:04,848 INFO L390 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 33 treesize of output 15 [2022-11-02 20:21:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:21:05,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:05,881 INFO L390 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 34 treesize of output 28 [2022-11-02 20:21:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:21:06,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:21:06,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716001501] [2022-11-02 20:21:06,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716001501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:06,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:21:06,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2022-11-02 20:21:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605020998] [2022-11-02 20:21:06,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:06,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:21:06,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:21:06,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:21:06,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:21:06,152 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:21:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:07,651 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-11-02 20:21:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:21:07,653 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2022-11-02 20:21:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:07,654 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:21:07,654 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:21:07,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:21:07,656 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:07,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 213 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 150 Invalid, 0 Unknown, 40 Unchecked, 0.6s Time] [2022-11-02 20:21:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:21:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:21:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:21:07,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-11-02 20:21:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:07,658 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:21:07,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:21:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:21:07,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:21:07,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:21:07,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:07,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:21:07,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:21:31,562 WARN L234 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 153 DAG size of output: 95 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-02 20:21:31,587 INFO L895 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2022-11-02 20:21:31,588 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32))) (= (bvadd (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) [2022-11-02 20:21:31,588 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-11-02 20:21:31,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:21:31,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:21:31,588 INFO L899 garLoopResultBuilder]: For program point L631-2(lines 631 634) no Hoare annotation was computed. [2022-11-02 20:21:31,589 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (select .cse11 (_ bv0 32)))) (let ((.cse3 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse0 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse4 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse9 (= (bvadd (select (select |#memory_int| (select .cse11 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (.cse5 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse10 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse7 (not (= .cse2 |ULTIMATE.start_main_~s~0#1.base|))) (.cse8 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 .cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) .cse4 .cse9 .cse5 .cse6 .cse10 .cse7 .cse8 (= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (bvsgt .cse3 (_ bv4294967295 32))) (and .cse0 .cse1 .cse4 .cse9 .cse5 .cse6 .cse10 .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))))))) [2022-11-02 20:21:31,589 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2022-11-02 20:21:31,590 INFO L895 garLoopResultBuilder]: At program point L599(lines 585 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)))) (and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32))) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (not (= .cse0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= .cse2 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) [2022-11-02 20:21:31,590 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2022-11-02 20:21:31,590 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2022-11-02 20:21:31,591 INFO L895 garLoopResultBuilder]: At program point L617(lines 612 618) the Hoare annotation is: (let ((.cse12 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|)) (.cse13 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) (let ((.cse5 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse6 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse7 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))) (.cse2 (bvsgt (bvadd .cse12 .cse13) (_ bv4294967295 32))) (.cse3 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse4 (not (bvsgt (bvadd (_ bv4294967295 32) .cse12 .cse13) (_ bv4294967295 32)))) (.cse8 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse9 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) (.cse10 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (let ((.cse1 (bvadd |ULTIMATE.start_main_~expected~0#1| (_ bv4294967294 32)))) (and (not (bvsgt (bvadd (_ bv4294967293 32) .cse0) (_ bv4294967295 32))) (not (bvsgt .cse1 (_ bv0 32))) (bvsgt .cse1 (_ bv4294967295 32)) (not (bvsgt (bvadd (_ bv4294967293 32) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (_ bv4294967295 32))) .cse2 .cse3 .cse4 (bvsgt (bvadd |ULTIMATE.start_dll_circular_get_data_at_#res#1| (_ bv4294967294 32)) (_ bv4294967295 32)) (or (and .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse8 .cse9) (and .cse5 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse6 .cse7 .cse8 .cse9)) .cse10 (bvsgt (bvadd (_ bv4294967294 32) .cse0) (_ bv4294967295 32)))) (let ((.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (and .cse5 (= |ULTIMATE.start_dll_circular_get_data_at_#res#1| (_ bv3 32)) .cse6 .cse7 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) .cse2 .cse3 .cse4 (= (bvadd (select (select |#memory_int| (select .cse11 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) .cse8 (= |ULTIMATE.start_main_~expected~0#1| (_ bv3 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) .cse9 (not (= (select .cse11 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv3 32) .cse0) .cse10))))) [2022-11-02 20:21:31,591 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-11-02 20:21:31,591 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:21:31,591 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-11-02 20:21:31,591 INFO L899 garLoopResultBuilder]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2022-11-02 20:21:31,592 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse9 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse2 (bvsgt (bvadd .cse9 .cse10) (_ bv4294967295 32))) (.cse3 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse4 (not (bvsgt (bvadd (_ bv4294967295 32) .cse9 .cse10) (_ bv4294967295 32)))) (.cse6 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse7 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse8 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (let ((.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) .cse2 .cse3 .cse4 (= (bvadd (select (select |#memory_int| (select .cse5 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) .cse6 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) .cse7 (not (= (select .cse5 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) .cse8)) (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))))))) [2022-11-02 20:21:31,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-11-02 20:21:31,592 INFO L899 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2022-11-02 20:21:31,592 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2022-11-02 20:21:31,593 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) [2022-11-02 20:21:31,593 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-11-02 20:21:31,593 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-11-02 20:21:31,593 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:21:31,594 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse15 (select .cse12 (_ bv0 32)))) (let ((.cse0 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse5 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (not (= .cse15 |ULTIMATE.start_main_~s~0#1.base|))) (.cse10 (= |ULTIMATE.start_dll_circular_update_at_~data#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (.cse13 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse1 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse2 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse3 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| .cse15) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (.cse4 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (.cse6 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse7 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse14 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse11 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse5 .cse6 (= (bvadd (select (select |#memory_int| (select .cse12 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) .cse13) .cse7 .cse8 .cse14 .cse9 .cse10 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= (bvadd |ULTIMATE.start_dll_circular_update_at_~data#1| (_ bv1 32)) .cse13) .cse1 .cse2 .cse3 .cse4 .cse6 (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_416) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) .cse7 .cse8 .cse14 (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_415) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) .cse11 (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_416) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|))))))) [2022-11-02 20:21:31,594 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2022-11-02 20:21:31,594 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-11-02 20:21:31,594 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-02 20:21:31,594 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2022-11-02 20:21:31,595 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (_ bv0 1)) .cse0 (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)))) (and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32))) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) .cse0 (= .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= .cse2 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) [2022-11-02 20:21:31,595 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2022-11-02 20:21:31,596 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse18 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (.cse13 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32)))) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (.cse7 (= (bvadd (select (select |#memory_int| (select .cse20 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (.cse9 (= |ULTIMATE.start_main_~expected~0#1| (_ bv3 32))) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse12 (not (= (select .cse20 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|))) (.cse15 (not (bvsgt (bvadd (_ bv4294967293 32) .cse13) (_ bv4294967295 32)))) (.cse0 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse2 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))) (.cse8 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse11 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse4 (bvsgt (bvadd .cse18 .cse19) (_ bv4294967295 32))) (.cse5 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse6 (not (bvsgt (bvadd (_ bv4294967295 32) .cse18 .cse19) (_ bv4294967295 32)))) (.cse14 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse16 (bvsgt (bvadd (_ bv4294967294 32) .cse13) (_ bv4294967295 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (_ bv3 32) .cse13) .cse14) (let ((.cse17 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)))) (and .cse15 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32)) .cse0 .cse1 .cse3 .cse4 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 (= (select (select |#memory_int| .cse17) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)))) (_ bv3 32)) (not (= .cse17 |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|)))) (and .cse15 (= |ULTIMATE.start_main_~expected~0#1| (bvadd (_ bv2 32) |ULTIMATE.start_dll_circular_get_data_at_~index#1|)) (or (and .cse0 .cse1 .cse2 .cse8 .cse11 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse1 .cse2 .cse8 .cse11)) .cse4 .cse5 .cse6 .cse14 .cse16)))) [2022-11-02 20:21:31,596 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2022-11-02 20:21:31,596 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-11-02 20:21:31,596 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2022-11-02 20:21:31,596 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-02 20:21:31,596 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-11-02 20:21:31,597 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 575 584) no Hoare annotation was computed. [2022-11-02 20:21:31,597 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-11-02 20:21:31,601 INFO L444 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1] [2022-11-02 20:21:31,604 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:21:31,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,626 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,630 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,631 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,631 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,631 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,631 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,632 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-11-02 20:21:31,633 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] [2022-11-02 20:21:31,634 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-11-02 20:21:31,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,636 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,638 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,638 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,638 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,639 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-11-02 20:21:31,639 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] [2022-11-02 20:21:31,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-11-02 20:21:31,642 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,642 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,646 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,646 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,646 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:21:31 BoogieIcfgContainer [2022-11-02 20:21:31,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:21:31,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:21:31,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:21:31,671 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:21:31,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:40" (3/4) ... [2022-11-02 20:21:31,675 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:21:31,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-02 20:21:31,686 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-02 20:21:31,686 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-02 20:21:31,687 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:21:31,687 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:21:31,713 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0bv32 == new_head && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[\result][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == \result)) && \result == 0bv32) && !~bvsgt32(len, 1bv32)) && !(#memory_$Pointer$[new_head][new_head] == new_head)) && head == 0bv32) && 2bv32 == len) && !(#memory_$Pointer$[\result][0bv32] == \result)) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last) && !(#memory_$Pointer$[head][0bv32] == head) [2022-11-02 20:21:31,714 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0bv32 == new_head && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && !~bvsgt32(len, 1bv32)) && head == 0bv32) && s == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) || (((((((((((0bv32 == new_head && \result == 0bv32) && !~bvsgt32(i, 0bv32)) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && ~bvadd64(i, len, 1bv32) == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && ~bvsgt32(~bvadd64(i, 1bv32), 4294967295bv32))) || (((((((((0bv32 == new_head && \result == 0bv32) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && len == ~bvadd64(i, 2bv32)) [2022-11-02 20:21:31,714 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0bv32 == new_head && \result == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) || ((((((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && !~bvsgt32(i, 0bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && index == 0bv32) && 2bv32 == len) && !~bvsgt32(~bvadd64(4294967295bv32, i), 0bv32)) [2022-11-02 20:21:31,714 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s == head && 0bv32 == new_head) && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && head == s) && !~bvsgt32(len, 1bv32)) && head == 0bv32) && s == 0bv32) && 1bv32 == index) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && 2bv32 == len) || ((((((((((((s == head && 0bv32 == new_head) && \result == 0bv32) && i == 0bv32) && head == s) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && len == ~bvadd64(i, 2bv32))) || ((((((((((((~bvadd64(data, 1bv32) == ~bvmul32(2bv32, len) && 0bv32 == new_head) && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && !~bvsgt32(len, 1bv32)) && (forall v_ArrVal_416 : [bv32]bv32 :: !(#memory_$Pointer$[head := v_ArrVal_416][s][s] == s))) && head == 0bv32) && s == 0bv32) && index == 0bv32) && (forall v_ArrVal_415 : [bv32]bv32 :: #memory_$Pointer$[head := v_ArrVal_415][s][s] == head)) && 2bv32 == len) && (forall v_ArrVal_416 : [bv32]bv32 :: #memory_$Pointer$[head := v_ArrVal_416][s][s] == head)) [2022-11-02 20:21:31,715 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && expected == 3bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 3bv32 == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && 2bv32 == len) || ((((((((((((((((((!~bvsgt32(~bvadd64(4294967293bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32) && index == 1bv32) && 0bv32 == new_head) && \result == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && expected == 3bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && ~bvsgt32(~bvadd64(4294967294bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][0bv32]][~bvadd64(8bv32, #memory_$Pointer$[head][0bv32])] == 3bv32) && !(#memory_$Pointer$[head][0bv32] == head))) || (((((((!~bvsgt32(~bvadd64(4294967293bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32) && expected == ~bvadd64(2bv32, index)) && ((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32) && len == ~bvadd64(i, 2bv32)) || (((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32))) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && 2bv32 == len) && ~bvsgt32(~bvadd64(4294967294bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) [2022-11-02 20:21:31,715 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!~bvsgt32(~bvadd64(4294967293bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32) && !~bvsgt32(~bvadd64(expected, 4294967294bv32), 0bv32)) && ~bvsgt32(~bvadd64(expected, 4294967294bv32), 4294967295bv32)) && !~bvsgt32(~bvadd64(4294967293bv32, \result), 4294967295bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvsgt32(~bvadd64(\result, 4294967294bv32), 4294967295bv32)) && ((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && i == 0bv32) && head == 0bv32) && index == 0bv32) || (((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32))) && 2bv32 == len) && ~bvsgt32(~bvadd64(4294967294bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) || (((((((((((((((0bv32 == new_head && \result == 3bv32) && \result == 0bv32) && index == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && expected == 3bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 3bv32 == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && 2bv32 == len) [2022-11-02 20:21:31,729 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:21:31,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:21:31,730 INFO L158 Benchmark]: Toolchain (without parser) took 52558.91ms. Allocated memory was 71.3MB in the beginning and 192.9MB in the end (delta: 121.6MB). Free memory was 51.0MB in the beginning and 153.3MB in the end (delta: -102.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 20:21:31,730 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory was 51.7MB in the beginning and 51.6MB in the end (delta: 54.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:21:31,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.20ms. Allocated memory is still 71.3MB. Free memory was 50.8MB in the beginning and 45.0MB in the end (delta: 5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:21:31,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.87ms. Allocated memory is still 71.3MB. Free memory was 45.0MB in the beginning and 42.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:21:31,731 INFO L158 Benchmark]: Boogie Preprocessor took 31.61ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 40.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:21:31,732 INFO L158 Benchmark]: RCFGBuilder took 739.36ms. Allocated memory is still 71.3MB. Free memory was 40.6MB in the beginning and 45.4MB in the end (delta: -4.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-11-02 20:21:31,732 INFO L158 Benchmark]: TraceAbstraction took 51226.54ms. Allocated memory was 71.3MB in the beginning and 192.9MB in the end (delta: 121.6MB). Free memory was 44.8MB in the beginning and 157.5MB in the end (delta: -112.7MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2022-11-02 20:21:31,732 INFO L158 Benchmark]: Witness Printer took 58.29ms. Allocated memory is still 192.9MB. Free memory was 157.5MB in the beginning and 153.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:21:31,734 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory was 51.7MB in the beginning and 51.6MB in the end (delta: 54.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.20ms. Allocated memory is still 71.3MB. Free memory was 50.8MB in the beginning and 45.0MB in the end (delta: 5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.87ms. Allocated memory is still 71.3MB. Free memory was 45.0MB in the beginning and 42.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.61ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 40.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 739.36ms. Allocated memory is still 71.3MB. Free memory was 40.6MB in the beginning and 45.4MB in the end (delta: -4.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 51226.54ms. Allocated memory was 71.3MB in the beginning and 192.9MB in the end (delta: 121.6MB). Free memory was 44.8MB in the beginning and 157.5MB in the end (delta: -112.7MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. * Witness Printer took 58.29ms. Allocated memory is still 192.9MB. Free memory was 157.5MB in the beginning and 153.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1275 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1272 mSDsluCounter, 2622 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 602 IncrementalHoareTripleChecker+Unchecked, 2160 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1572 IncrementalHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 462 mSDtfsCounter, 1572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1029 GetRequests, 805 SyntacticMatches, 8 SemanticMatches, 216 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=11, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 197 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 47 NumberOfFragments, 1267 HoareAnnotationTreeSize, 18 FomulaSimplifications, 75943 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 28422 FormulaSimplificationTreeSizeReductionInter, 21.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 555 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 941 ConstructedInterpolants, 34 QuantifiedInterpolants, 5369 SizeOfPredicates, 122 NumberOfNonLiveVariables, 2905 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 330/414 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 585]: Loop Invariant [2022-11-02 20:21:31,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,755 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((0bv32 == new_head && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[\result][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == \result)) && \result == 0bv32) && !~bvsgt32(len, 1bv32)) && !(#memory_$Pointer$[new_head][new_head] == new_head)) && head == 0bv32) && 2bv32 == len) && !(#memory_$Pointer$[\result][0bv32] == \result)) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last) && !(#memory_$Pointer$[head][0bv32] == head) - InvariantResult [Line: 620]: Loop Invariant [2022-11-02 20:21:31,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,760 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,761 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,762 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-11-02 20:21:31,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,762 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] [2022-11-02 20:21:31,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,763 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-11-02 20:21:31,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,764 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,766 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,766 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-11-02 20:21:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] [2022-11-02 20:21:31,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] Derived loop invariant: (((((((((((((s == head && 0bv32 == new_head) && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && head == s) && !~bvsgt32(len, 1bv32)) && head == 0bv32) && s == 0bv32) && 1bv32 == index) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && 2bv32 == len) || ((((((((((((s == head && 0bv32 == new_head) && \result == 0bv32) && i == 0bv32) && head == s) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && len == ~bvadd64(i, 2bv32))) || ((((((((((((~bvadd64(data, 1bv32) == ~bvmul32(2bv32, len) && 0bv32 == new_head) && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && !~bvsgt32(len, 1bv32)) && (forall v_ArrVal_416 : [bv32]bv32 :: !(#memory_$Pointer$[head := v_ArrVal_416][s][s] == s))) && head == 0bv32) && s == 0bv32) && index == 0bv32) && (forall v_ArrVal_415 : [bv32]bv32 :: #memory_$Pointer$[head := v_ArrVal_415][s][s] == head)) && 2bv32 == len) && (forall v_ArrVal_416 : [bv32]bv32 :: #memory_$Pointer$[head := v_ArrVal_416][s][s] == head)) - InvariantResult [Line: 635]: Loop Invariant [2022-11-02 20:21:31,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((0bv32 == new_head && \result == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) || ((((((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && !~bvsgt32(i, 0bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && index == 0bv32) && 2bv32 == len) && !~bvsgt32(~bvadd64(4294967295bv32, i), 0bv32)) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-11-02 20:21:31,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,771 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-11-02 20:21:31,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((0bv32 == new_head && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && !~bvsgt32(len, 1bv32)) && head == 0bv32) && s == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) || (((((((((((0bv32 == new_head && \result == 0bv32) && !~bvsgt32(i, 0bv32)) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && ~bvadd64(i, len, 1bv32) == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && ~bvsgt32(~bvadd64(i, 1bv32), 4294967295bv32))) || (((((((((0bv32 == new_head && \result == 0bv32) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && len == ~bvadd64(i, 2bv32)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 612]: Loop Invariant [2022-11-02 20:21:31,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((!~bvsgt32(~bvadd64(4294967293bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32) && !~bvsgt32(~bvadd64(expected, 4294967294bv32), 0bv32)) && ~bvsgt32(~bvadd64(expected, 4294967294bv32), 4294967295bv32)) && !~bvsgt32(~bvadd64(4294967293bv32, \result), 4294967295bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvsgt32(~bvadd64(\result, 4294967294bv32), 4294967295bv32)) && ((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && i == 0bv32) && head == 0bv32) && index == 0bv32) || (((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32))) && 2bv32 == len) && ~bvsgt32(~bvadd64(4294967294bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) || (((((((((((((((0bv32 == new_head && \result == 3bv32) && \result == 0bv32) && index == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && expected == 3bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 3bv32 == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && 2bv32 == len) - InvariantResult [Line: 588]: Loop Invariant [2022-11-02 20:21:31,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((last == head && ~bvadd64(\valid[head], 1bv1) == 0bv1) && 2bv32 == len) && len == 2bv32) || (((((((0bv32 == new_head && !~bvsgt32(len, 1bv32)) && !(#memory_$Pointer$[new_head][new_head] == new_head)) && head == 0bv32) && 2bv32 == len) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last) && !(#memory_$Pointer$[head][0bv32] == head)) - InvariantResult [Line: 613]: Loop Invariant [2022-11-02 20:21:31,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:21:31,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:21:31,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && expected == 3bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 3bv32 == unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]) && 2bv32 == len) || ((((((((((((((((((!~bvsgt32(~bvadd64(4294967293bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32) && index == 1bv32) && 0bv32 == new_head) && \result == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && expected == 3bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && ~bvsgt32(~bvadd64(4294967294bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][0bv32]][~bvadd64(8bv32, #memory_$Pointer$[head][0bv32])] == 3bv32) && !(#memory_$Pointer$[head][0bv32] == head))) || (((((((!~bvsgt32(~bvadd64(4294967293bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32) && expected == ~bvadd64(2bv32, index)) && ((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32) && len == ~bvadd64(i, 2bv32)) || (((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32))) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && 2bv32 == len) && ~bvsgt32(~bvadd64(4294967294bv32, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:21:31,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_849be25d-cbfa-4c73-a07a-e14472b247ce/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE