./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0 --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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 16:20:00,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 16:20:00,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 16:20:00,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 16:20:00,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 16:20:00,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 16:20:00,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 16:20:00,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 16:20:00,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 16:20:00,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 16:20:00,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 16:20:00,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 16:20:00,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 16:20:00,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 16:20:00,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 16:20:00,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 16:20:00,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 16:20:00,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 16:20:00,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 16:20:00,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 16:20:00,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 16:20:00,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 16:20:00,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 16:20:00,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 16:20:00,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 16:20:00,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 16:20:00,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 16:20:00,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 16:20:00,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 16:20:00,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 16:20:00,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 16:20:00,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 16:20:00,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 16:20:00,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 16:20:00,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 16:20:00,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 16:20:00,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 16:20:00,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 16:20:00,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 16:20:00,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 16:20:00,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 16:20:00,901 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-22 16:20:00,946 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 16:20:00,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 16:20:00,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 16:20:00,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 16:20:00,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 16:20:00,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 16:20:00,949 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 16:20:00,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 16:20:00,949 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 16:20:00,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 16:20:00,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 16:20:00,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 16:20:00,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 16:20:00,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 16:20:00,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 16:20:00,952 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 16:20:00,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 16:20:00,952 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 16:20:00,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 16:20:00,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 16:20:00,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 16:20:00,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 16:20:00,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:20:00,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 16:20:00,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 16:20:00,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 16:20:00,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 16:20:00,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 16:20:00,954 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 16:20:00,956 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 16:20:00,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 16:20:00,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 16:20:00,956 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_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/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_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2021-11-22 16:20:01,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 16:20:01,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 16:20:01,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 16:20:01,280 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 16:20:01,281 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 16:20:01,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-11-22 16:20:01,354 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/data/45427084f/49f0ab6f69f44c128a9320c0473a2076/FLAGf2d462dbc [2021-11-22 16:20:02,028 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 16:20:02,029 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-11-22 16:20:02,052 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/data/45427084f/49f0ab6f69f44c128a9320c0473a2076/FLAGf2d462dbc [2021-11-22 16:20:02,299 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/data/45427084f/49f0ab6f69f44c128a9320c0473a2076 [2021-11-22 16:20:02,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 16:20:02,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 16:20:02,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 16:20:02,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 16:20:02,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 16:20:02,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1177cc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02, skipping insertion in model container [2021-11-22 16:20:02,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 16:20:02,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 16:20:02,787 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_2764a716-29b0-4492-b9c4-b51a5359c7b6/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-11-22 16:20:02,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:20:02,807 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 16:20:02,877 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_2764a716-29b0-4492-b9c4-b51a5359c7b6/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-11-22 16:20:02,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:20:02,907 INFO L208 MainTranslator]: Completed translation [2021-11-22 16:20:02,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02 WrapperNode [2021-11-22 16:20:02,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 16:20:02,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 16:20:02,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 16:20:02,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 16:20:02,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,958 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 140 [2021-11-22 16:20:02,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 16:20:02,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 16:20:02,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 16:20:02,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 16:20:02,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:02,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:03,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:03,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:03,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 16:20:03,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 16:20:03,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 16:20:03,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 16:20:03,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (1/1) ... [2021-11-22 16:20:03,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:20:03,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:20:03,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 16:20:03,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 16:20:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 16:20:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 16:20:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 16:20:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 16:20:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 16:20:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 16:20:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 16:20:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 16:20:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 16:20:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 16:20:03,262 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 16:20:03,276 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 16:20:03,530 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 16:20:03,537 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 16:20:03,538 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-22 16:20:03,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:20:03 BoogieIcfgContainer [2021-11-22 16:20:03,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 16:20:03,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 16:20:03,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 16:20:03,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 16:20:03,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:20:02" (1/3) ... [2021-11-22 16:20:03,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5b6206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:20:03, skipping insertion in model container [2021-11-22 16:20:03,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:20:02" (2/3) ... [2021-11-22 16:20:03,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5b6206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:20:03, skipping insertion in model container [2021-11-22 16:20:03,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:20:03" (3/3) ... [2021-11-22 16:20:03,559 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2021-11-22 16:20:03,565 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 16:20:03,565 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-22 16:20:03,639 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 16:20:03,650 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 16:20:03,650 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-22 16:20:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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) [2021-11-22 16:20:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 16:20:03,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:03,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:03,685 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash -457834363, now seen corresponding path program 1 times [2021-11-22 16:20:03,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:03,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820169527] [2021-11-22 16:20:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:03,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:03,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:03,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820169527] [2021-11-22 16:20:03,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820169527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:03,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:03,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 16:20:03,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732047351] [2021-11-22 16:20:03,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:03,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 16:20:03,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:03,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 16:20:03,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 16:20:03,922 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2021-11-22 16:20:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:03,941 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2021-11-22 16:20:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 16:20:03,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) Word has length 16 [2021-11-22 16:20:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:03,951 INFO L225 Difference]: With dead ends: 59 [2021-11-22 16:20:03,951 INFO L226 Difference]: Without dead ends: 25 [2021-11-22 16:20:03,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 16:20:03,958 INFO L933 BasicCegarLoop]: 43 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, 43 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 [2021-11-22 16:20:03,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-22 16:20:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-11-22 16:20:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2021-11-22 16:20:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-11-22 16:20:03,991 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2021-11-22 16:20:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:03,992 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-11-22 16:20:03,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2021-11-22 16:20:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-11-22 16:20:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-22 16:20:03,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:03,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:03,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 16:20:03,994 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:03,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 985369516, now seen corresponding path program 1 times [2021-11-22 16:20:03,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:03,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209282241] [2021-11-22 16:20:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:03,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:04,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209282241] [2021-11-22 16:20:04,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209282241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:04,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:04,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 16:20:04,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770432825] [2021-11-22 16:20:04,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:04,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 16:20:04,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:04,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 16:20:04,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,076 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-11-22 16:20:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:04,095 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-11-22 16:20:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:20:04,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2021-11-22 16:20:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:04,097 INFO L225 Difference]: With dead ends: 45 [2021-11-22 16:20:04,097 INFO L226 Difference]: Without dead ends: 29 [2021-11-22 16:20:04,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 16:20:04,099 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 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 [2021-11-22 16:20:04,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-22 16:20:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-11-22 16:20:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) [2021-11-22 16:20:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-11-22 16:20:04,106 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2021-11-22 16:20:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,107 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-11-22 16:20:04,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-11-22 16:20:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-11-22 16:20:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 16:20:04,108 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:04,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 16:20:04,109 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash 615458148, now seen corresponding path program 1 times [2021-11-22 16:20:04,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788450949] [2021-11-22 16:20:04,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 16:20:04,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788450949] [2021-11-22 16:20:04,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788450949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:04,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:04,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 16:20:04,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526733866] [2021-11-22 16:20:04,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:04,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:20:04,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:20:04,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:04,246 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-11-22 16:20:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:04,306 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2021-11-22 16:20:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 16:20:04,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-11-22 16:20:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:04,309 INFO L225 Difference]: With dead ends: 48 [2021-11-22 16:20:04,309 INFO L226 Difference]: Without dead ends: 39 [2021-11-22 16:20:04,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:20:04,311 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 44 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 [2021-11-22 16:20:04,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-22 16:20:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2021-11-22 16:20:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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) [2021-11-22 16:20:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-11-22 16:20:04,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2021-11-22 16:20:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,330 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-11-22 16:20:04,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-11-22 16:20:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-11-22 16:20:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 16:20:04,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:04,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 16:20:04,335 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2049903731, now seen corresponding path program 1 times [2021-11-22 16:20:04,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017947690] [2021-11-22 16:20:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-22 16:20:04,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017947690] [2021-11-22 16:20:04,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017947690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:04,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:04,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:04,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333383746] [2021-11-22 16:20:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:04,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:04,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:04,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:04,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:04,547 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-11-22 16:20:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:04,585 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2021-11-22 16:20:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) Word has length 25 [2021-11-22 16:20:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:04,587 INFO L225 Difference]: With dead ends: 54 [2021-11-22 16:20:04,588 INFO L226 Difference]: Without dead ends: 40 [2021-11-22 16:20:04,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:04,590 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:04,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-22 16:20:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2021-11-22 16:20:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2021-11-22 16:20:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-11-22 16:20:04,599 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2021-11-22 16:20:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:04,599 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-22 16:20:04,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-11-22 16:20:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-11-22 16:20:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 16:20:04,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:04,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:04,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 16:20:04,602 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash -919777899, now seen corresponding path program 1 times [2021-11-22 16:20:04,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:04,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14578412] [2021-11-22 16:20:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 16:20:04,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:04,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14578412] [2021-11-22 16:20:04,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14578412] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 16:20:04,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015481400] [2021-11-22 16:20:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:04,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:20:04,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:20:04,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 16:20:04,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 16:20:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:04,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 16:20:04,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:20:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 16:20:05,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:20:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 16:20:05,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015481400] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:20:05,199 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 16:20:05,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-11-22 16:20:05,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981027225] [2021-11-22 16:20:05,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 16:20:05,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 16:20:05,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:05,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 16:20:05,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:20:05,202 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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) [2021-11-22 16:20:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:05,282 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-11-22 16:20:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:05,283 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), 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) Word has length 26 [2021-11-22 16:20:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:05,284 INFO L225 Difference]: With dead ends: 51 [2021-11-22 16:20:05,284 INFO L226 Difference]: Without dead ends: 42 [2021-11-22 16:20:05,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:20:05,286 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:05,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 66 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 16:20:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-22 16:20:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2021-11-22 16:20:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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) [2021-11-22 16:20:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-11-22 16:20:05,295 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 26 [2021-11-22 16:20:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:05,295 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-11-22 16:20:05,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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) [2021-11-22 16:20:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-11-22 16:20:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-22 16:20:05,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:05,297 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:05,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 16:20:05,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:20:05,524 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1786166788, now seen corresponding path program 2 times [2021-11-22 16:20:05,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:05,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164405464] [2021-11-22 16:20:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:05,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 16:20:05,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:05,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164405464] [2021-11-22 16:20:05,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164405464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:20:05,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:20:05,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 16:20:05,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895341351] [2021-11-22 16:20:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:20:05,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 16:20:05,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:05,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 16:20:05,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 16:20:05,663 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2021-11-22 16:20:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:20:05,734 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2021-11-22 16:20:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:20:05,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 31 [2021-11-22 16:20:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:20:05,738 INFO L225 Difference]: With dead ends: 50 [2021-11-22 16:20:05,739 INFO L226 Difference]: Without dead ends: 42 [2021-11-22 16:20:05,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 16:20:05,748 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:20:05,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:20:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-22 16:20:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2021-11-22 16:20:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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) [2021-11-22 16:20:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-11-22 16:20:05,767 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2021-11-22 16:20:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:20:05,768 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-11-22 16:20:05,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2021-11-22 16:20:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-11-22 16:20:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-22 16:20:05,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:20:05,770 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:20:05,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 16:20:05,770 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:20:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:20:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash 515058323, now seen corresponding path program 1 times [2021-11-22 16:20:05,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:20:05,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013381520] [2021-11-22 16:20:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:05,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:20:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:20:06,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:20:06,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013381520] [2021-11-22 16:20:06,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013381520] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 16:20:06,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497953538] [2021-11-22 16:20:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:20:06,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:20:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:20:06,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 16:20:06,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 16:20:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:20:06,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-22 16:20:06,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:20:06,953 INFO L388 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 [2021-11-22 16:20:07,152 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 16:20:07,153 INFO L388 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 [2021-11-22 16:20:07,276 INFO L388 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 [2021-11-22 16:20:07,368 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-22 16:20:07,369 INFO L388 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 28 treesize of output 22 [2021-11-22 16:20:07,858 INFO L354 Elim1Store]: treesize reduction 159, result has 15.0 percent of original size [2021-11-22 16:20:07,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 112 [2021-11-22 16:20:07,865 INFO L388 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 98 treesize of output 90 [2021-11-22 16:20:07,880 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-22 16:20:07,880 INFO L388 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 90 treesize of output 76 [2021-11-22 16:20:08,120 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-22 16:20:08,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 64 [2021-11-22 16:20:08,137 INFO L354 Elim1Store]: treesize reduction 59, result has 22.4 percent of original size [2021-11-22 16:20:08,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 64 [2021-11-22 16:20:08,150 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-22 16:20:08,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2021-11-22 16:20:08,395 INFO L388 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 53 treesize of output 41 [2021-11-22 16:20:08,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-11-22 16:20:08,502 INFO L388 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 32 treesize of output 20 [2021-11-22 16:20:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 16:20:08,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:20:29,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((|ULTIMATE.start_sll_circular_update_at_~data#1| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (<= (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((|ULTIMATE.start_sll_circular_update_at_~data#1| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-22 16:20:29,741 INFO L354 Elim1Store]: treesize reduction 47, result has 7.8 percent of original size [2021-11-22 16:20:29,742 INFO L388 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 821 treesize of output 753 [2021-11-22 16:20:34,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= .cse1 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)) (and (= .cse1 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (= .cse0 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)))))) (or (forall ((v_prenex_2 Int) (v_DerPreprocessor_3 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_4 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))) (or (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_1 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))) (forall ((v_prenex_2 Int) (v_DerPreprocessor_3 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse6 v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse7 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse6 v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse7 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= .cse4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (= .cse5 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (and (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (= .cse4 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_4 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-11-22 16:20:35,909 INFO L354 Elim1Store]: treesize reduction 95, result has 64.3 percent of original size [2021-11-22 16:20:35,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 539 treesize of output 521 [2021-11-22 16:20:35,987 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 16:20:35,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 521 treesize of output 541 [2021-11-22 16:20:36,054 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 16:20:36,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 541 treesize of output 563 [2021-11-22 16:20:36,142 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 16:20:36,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 563 treesize of output 585 [2021-11-22 16:20:36,218 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 16:20:36,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 585 treesize of output 607 [2021-11-22 16:20:36,294 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 16:20:36,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 607 treesize of output 627 [2021-11-22 16:20:36,990 INFO L388 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 8 treesize of output 6 [2021-11-22 16:20:39,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 16:20:39,634 INFO L388 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 [2021-11-22 16:20:40,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 16:20:40,175 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-22 16:20:40,176 INFO L388 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 458 treesize of output 462 [2021-11-22 16:20:42,041 INFO L388 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 12 treesize of output 10 [2021-11-22 16:20:42,119 INFO L388 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 12 treesize of output 10 [2021-11-22 16:20:42,177 INFO L388 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 12 treesize of output 10 [2021-11-22 16:20:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-22 16:20:54,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497953538] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:20:54,182 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 16:20:54,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 52 [2021-11-22 16:20:54,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710414674] [2021-11-22 16:20:54,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 16:20:54,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-22 16:20:54,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:20:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-22 16:20:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2300, Unknown=21, NotChecked=194, Total=2652 [2021-11-22 16:20:54,187 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 52 states have internal predecessors, (86), 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) [2021-11-22 16:20:55,654 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.offset| Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1)) is different from false [2021-11-22 16:20:57,659 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse9 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= .cse1 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)) (and (= .cse1 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (= .cse0 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)))))) (or (forall ((v_prenex_2 Int) (v_DerPreprocessor_3 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_4 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))) (or (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_1 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))) (forall ((v_prenex_2 Int) (v_DerPreprocessor_3 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse6 v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse7 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse6 v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse7 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= .cse4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (= .cse5 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (and (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (= .cse4 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_4 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse8 .cse9) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (select .cse10 |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 0)) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse9 .cse8) (= .cse11 0) (not (= (select .cse10 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (= .cse11 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse8 .cse9) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-11-22 16:20:58,348 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.offset| Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) is different from false [2021-11-22 16:21:00,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ (select (select |c_#memory_int| .cse2) 4) 1))) (and (<= .cse0 .cse1) (not (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((|ULTIMATE.start_sll_circular_update_at_~data#1| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (<= (+ (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((|ULTIMATE.start_sll_circular_update_at_~data#1| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-11-22 16:21:02,470 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse8 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= .cse1 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)) (and (= .cse1 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (= .cse0 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)))))) (or (forall ((v_prenex_2 Int) (v_DerPreprocessor_3 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_4 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))) (or (forall ((v_DerPreprocessor_3 Int) (v_DerPreprocessor_1 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))) (forall ((v_prenex_2 Int) (v_DerPreprocessor_3 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse6 v_DerPreprocessor_3)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse7 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse6 v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse7 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= .cse4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (= .cse5 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (and (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (= .cse4 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9|)))))) (forall ((v_prenex_1 Int) (v_DerPreprocessor_4 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_DerPreprocessor_4)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_prenex_1) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (<= .cse8 .cse9) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse9 .cse8) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-11-22 16:21:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:21:03,415 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2021-11-22 16:21:03,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-22 16:21:03,416 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 52 states have internal predecessors, (86), 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) Word has length 32 [2021-11-22 16:21:03,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:21:03,418 INFO L225 Difference]: With dead ends: 99 [2021-11-22 16:21:03,419 INFO L226 Difference]: Without dead ends: 97 [2021-11-22 16:21:03,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=375, Invalid=4319, Unknown=26, NotChecked=980, Total=5700 [2021-11-22 16:21:03,423 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 135 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 16:21:03,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 224 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 608 Invalid, 0 Unknown, 198 Unchecked, 0.5s Time] [2021-11-22 16:21:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-22 16:21:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 68. [2021-11-22 16:21:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 67 states have internal predecessors, (80), 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) [2021-11-22 16:21:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2021-11-22 16:21:03,437 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 32 [2021-11-22 16:21:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:21:03,438 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2021-11-22 16:21:03,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 52 states have internal predecessors, (86), 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) [2021-11-22 16:21:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2021-11-22 16:21:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-22 16:21:03,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:21:03,440 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:21:03,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-22 16:21:03,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:21:03,667 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:21:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:21:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1161407268, now seen corresponding path program 2 times [2021-11-22 16:21:03,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:21:03,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860887838] [2021-11-22 16:21:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:21:03,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:21:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:21:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 16:21:03,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:21:03,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860887838] [2021-11-22 16:21:03,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860887838] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:21:03,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:21:03,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 16:21:03,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541501584] [2021-11-22 16:21:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:21:03,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 16:21:03,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:21:03,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 16:21:03,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 16:21:03,734 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) [2021-11-22 16:21:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:21:03,780 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2021-11-22 16:21:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 16:21:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 33 [2021-11-22 16:21:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:21:03,782 INFO L225 Difference]: With dead ends: 77 [2021-11-22 16:21:03,782 INFO L226 Difference]: Without dead ends: 69 [2021-11-22 16:21:03,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-22 16:21:03,783 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:21:03,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 60 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:21:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-22 16:21:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-11-22 16:21:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 68 states have internal predecessors, (80), 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) [2021-11-22 16:21:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2021-11-22 16:21:03,797 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 33 [2021-11-22 16:21:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:21:03,797 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-11-22 16:21:03,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) [2021-11-22 16:21:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2021-11-22 16:21:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-22 16:21:03,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:21:03,799 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:21:03,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 16:21:03,799 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:21:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:21:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1651441865, now seen corresponding path program 3 times [2021-11-22 16:21:03,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:21:03,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953178788] [2021-11-22 16:21:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:21:03,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:21:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:21:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 16:21:03,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:21:03,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953178788] [2021-11-22 16:21:03,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953178788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:21:03,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:21:03,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 16:21:03,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983404899] [2021-11-22 16:21:03,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:21:03,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 16:21:03,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:21:03,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 16:21:03,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-22 16:21:03,882 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) [2021-11-22 16:21:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:21:03,920 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2021-11-22 16:21:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 16:21:03,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) Word has length 33 [2021-11-22 16:21:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:21:03,921 INFO L225 Difference]: With dead ends: 93 [2021-11-22 16:21:03,921 INFO L226 Difference]: Without dead ends: 76 [2021-11-22 16:21:03,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-22 16:21:03,923 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:21:03,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:21:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-22 16:21:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2021-11-22 16:21:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 68 states have internal predecessors, (78), 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) [2021-11-22 16:21:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2021-11-22 16:21:03,935 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 33 [2021-11-22 16:21:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:21:03,935 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2021-11-22 16:21:03,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) [2021-11-22 16:21:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2021-11-22 16:21:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-22 16:21:03,937 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:21:03,937 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:21:03,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 16:21:03,937 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:21:03,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:21:03,938 INFO L85 PathProgramCache]: Analyzing trace with hash 78051211, now seen corresponding path program 4 times [2021-11-22 16:21:03,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:21:03,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183288717] [2021-11-22 16:21:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:21:03,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:21:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:21:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 16:21:04,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:21:04,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183288717] [2021-11-22 16:21:04,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183288717] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 16:21:04,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295481232] [2021-11-22 16:21:04,012 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-22 16:21:04,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:21:04,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:21:04,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 16:21:04,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 16:21:04,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-22 16:21:04,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 16:21:04,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 16:21:04,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:21:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-22 16:21:04,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 16:21:04,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295481232] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:21:04,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 16:21:04,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-11-22 16:21:04,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078545490] [2021-11-22 16:21:04,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:21:04,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 16:21:04,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:21:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 16:21:04,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-22 16:21:04,178 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-11-22 16:21:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:21:04,234 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2021-11-22 16:21:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 16:21:04,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) Word has length 33 [2021-11-22 16:21:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:21:04,235 INFO L225 Difference]: With dead ends: 91 [2021-11-22 16:21:04,235 INFO L226 Difference]: Without dead ends: 69 [2021-11-22 16:21:04,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-22 16:21:04,236 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:21:04,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 42 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:21:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-22 16:21:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-11-22 16:21:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 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) [2021-11-22 16:21:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2021-11-22 16:21:04,248 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 33 [2021-11-22 16:21:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:21:04,248 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2021-11-22 16:21:04,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-11-22 16:21:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-11-22 16:21:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 16:21:04,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:21:04,249 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:21:04,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 16:21:04,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-22 16:21:04,465 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:21:04,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:21:04,465 INFO L85 PathProgramCache]: Analyzing trace with hash 631568702, now seen corresponding path program 1 times [2021-11-22 16:21:04,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:21:04,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896929975] [2021-11-22 16:21:04,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:21:04,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:21:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:21:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 16:21:04,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:21:04,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896929975] [2021-11-22 16:21:04,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896929975] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 16:21:04,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13431714] [2021-11-22 16:21:04,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:21:04,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:21:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:21:04,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 16:21:04,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 16:21:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:21:04,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-22 16:21:04,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:21:05,064 INFO L388 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 [2021-11-22 16:21:05,263 INFO L388 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 [2021-11-22 16:21:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 16:21:05,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:21:05,489 INFO L388 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 46 treesize of output 40 [2021-11-22 16:21:05,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 16:21:05,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 16:21:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 16:21:05,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13431714] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:21:05,634 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 16:21:05,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 31 [2021-11-22 16:21:05,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47860241] [2021-11-22 16:21:05,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 16:21:05,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-22 16:21:05,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:21:05,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-22 16:21:05,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2021-11-22 16:21:05,636 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 31 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 31 states have internal predecessors, (105), 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) [2021-11-22 16:21:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:21:06,472 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2021-11-22 16:21:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 16:21:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 31 states have internal predecessors, (105), 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) Word has length 38 [2021-11-22 16:21:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:21:06,473 INFO L225 Difference]: With dead ends: 88 [2021-11-22 16:21:06,473 INFO L226 Difference]: Without dead ends: 86 [2021-11-22 16:21:06,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2021-11-22 16:21:06,475 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 313 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 16:21:06,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 207 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 16:21:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-22 16:21:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2021-11-22 16:21:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 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) [2021-11-22 16:21:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2021-11-22 16:21:06,487 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 38 [2021-11-22 16:21:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:21:06,487 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2021-11-22 16:21:06,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 31 states have internal predecessors, (105), 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) [2021-11-22 16:21:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-11-22 16:21:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-22 16:21:06,489 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:21:06,489 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:21:06,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 16:21:06,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-22 16:21:06,716 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:21:06,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:21:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1844552815, now seen corresponding path program 2 times [2021-11-22 16:21:06,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:21:06,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997237284] [2021-11-22 16:21:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:21:06,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:21:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:21:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-22 16:21:06,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:21:06,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997237284] [2021-11-22 16:21:06,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997237284] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 16:21:06,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181099170] [2021-11-22 16:21:06,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 16:21:06,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:21:06,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:21:06,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 16:21:06,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 16:21:06,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 16:21:06,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 16:21:06,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 16:21:06,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:21:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-22 16:21:06,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:21:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-22 16:21:07,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181099170] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:21:07,023 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 16:21:07,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-11-22 16:21:07,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818040257] [2021-11-22 16:21:07,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 16:21:07,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 16:21:07,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:21:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 16:21:07,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-22 16:21:07,029 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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) [2021-11-22 16:21:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:21:07,083 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2021-11-22 16:21:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:21:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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) Word has length 39 [2021-11-22 16:21:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:21:07,086 INFO L225 Difference]: With dead ends: 85 [2021-11-22 16:21:07,086 INFO L226 Difference]: Without dead ends: 45 [2021-11-22 16:21:07,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-22 16:21:07,088 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:21:07,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 90 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:21:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-22 16:21:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-22 16:21:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 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) [2021-11-22 16:21:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-11-22 16:21:07,097 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 39 [2021-11-22 16:21:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:21:07,097 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-11-22 16:21:07,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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) [2021-11-22 16:21:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-11-22 16:21:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-22 16:21:07,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:21:07,099 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:21:07,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-22 16:21:07,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:21:07,313 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:21:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:21:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash 255447995, now seen corresponding path program 5 times [2021-11-22 16:21:07,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:21:07,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822590601] [2021-11-22 16:21:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:21:07,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:21:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:21:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-22 16:21:07,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:21:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822590601] [2021-11-22 16:21:07,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822590601] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 16:21:07,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651103787] [2021-11-22 16:21:07,348 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-22 16:21:07,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:21:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:21:07,349 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 16:21:07,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-22 16:21:07,905 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-11-22 16:21:07,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 16:21:07,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 16:21:07,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:21:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-22 16:21:07,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 16:21:07,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651103787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:21:07,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 16:21:07,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2021-11-22 16:21:07,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498445650] [2021-11-22 16:21:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:21:07,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 16:21:07,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:21:07,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 16:21:07,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 16:21:07,997 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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) [2021-11-22 16:21:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:21:08,015 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-11-22 16:21:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 16:21:08,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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) Word has length 44 [2021-11-22 16:21:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:21:08,016 INFO L225 Difference]: With dead ends: 45 [2021-11-22 16:21:08,016 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 16:21:08,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 16:21:08,017 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:21:08,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:21:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 16:21:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 16:21:08,018 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) [2021-11-22 16:21:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 16:21:08,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2021-11-22 16:21:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:21:08,019 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 16:21:08,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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) [2021-11-22 16:21:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 16:21:08,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 16:21:08,022 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-22 16:21:08,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-22 16:21:08,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 16:21:08,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 16:21:41,146 WARN L227 SmtUtils]: Spent 32.54s on a formula simplification. DAG size of input: 147 DAG size of output: 70 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-22 16:23:04,299 WARN L227 SmtUtils]: Spent 1.37m on a formula simplification. DAG size of input: 94 DAG size of output: 81 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-22 16:23:04,304 INFO L861 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2021-11-22 16:23:04,304 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-11-22 16:23:04,305 INFO L861 garLoopResultBuilder]: At program point L572-1(line 572) the Hoare annotation is: true [2021-11-22 16:23:04,305 INFO L854 garLoopResultBuilder]: At program point L581(lines 574 582) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) [2021-11-22 16:23:04,305 INFO L854 garLoopResultBuilder]: At program point L581-1(lines 574 582) the Hoare annotation is: (and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_node_create_#res#1.base|)) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 2) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) [2021-11-22 16:23:04,306 INFO L854 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse17 (+ |ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (.cse16 (* 2 |ULTIMATE.start_main_~len~0#1|))) (let ((.cse6 (<= .cse17 .cse16)) (.cse10 (<= .cse16 .cse17)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse0 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse9 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|)) (.cse14 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse7 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 (= (select .cse4 |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse5 .cse6 (= .cse7 0) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse9 .cse2 .cse3 .cse5 .cse6 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse8 .cse10 .cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) .cse11 .cse14 .cse12) (let ((.cse15 (select .cse4 0))) (and .cse0 .cse1 .cse9 .cse2 .cse3 (= |ULTIMATE.start_main_~len~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse5 (not (= .cse15 |ULTIMATE.start_main_~s~0#1.base|)) (<= (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse16) (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse8 .cse13 .cse14 (= .cse16 (+ (select (select |#memory_int| .cse15) (+ .cse7 4)) 1)) .cse12))))) [2021-11-22 16:23:04,306 INFO L858 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2021-11-22 16:23:04,306 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 16:23:04,306 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 16:23:04,307 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2021-11-22 16:23:04,307 INFO L861 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2021-11-22 16:23:04,307 INFO L858 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2021-11-22 16:23:04,307 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse24 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.cse25 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse20 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (.cse1 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_main_~len~0#1| .cse20)) (.cse11 (= .cse25 0)) (.cse12 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse8 (* 2 (div (+ (* |ULTIMATE.start_main_~expected~0#1| (- 1)) 1) (- 2)))) (.cse6 (* 2 |ULTIMATE.start_main_~expected~0#1|)) (.cse13 (<= (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse24)) (.cse14 (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse15 (<= (+ 2 .cse20) .cse24)) (.cse16 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse17 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse18 (= .cse24 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) (+ .cse25 4)) 1))) (.cse19 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 (+ .cse7 .cse8 1)) .cse9 .cse10 .cse11 .cse12 (= (mod (+ |ULTIMATE.start_main_~expected~0#1| 1) (- 2)) 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse12 .cse13 .cse14 (= |ULTIMATE.start_main_~len~0#1| 2) (<= .cse20 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (= .cse7 2) .cse19) (let ((.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|))) (let ((.cse21 (select .cse23 0)) (.cse22 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|))) (and (not (= .cse21 |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= (select .cse22 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 (<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) .cse10 .cse11 .cse12 (= (+ (select (select |#memory_int| .cse21) (+ (select .cse22 0) 4)) .cse8 1) .cse6) .cse13 .cse14 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| (select .cse23 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 4)))))))) [2021-11-22 16:23:04,308 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2021-11-22 16:23:04,308 INFO L854 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: false [2021-11-22 16:23:04,308 INFO L858 garLoopResultBuilder]: For program point L625-2(lines 625 628) no Hoare annotation was computed. [2021-11-22 16:23:04,309 INFO L854 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse7 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse8 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (+ (select (select |#memory_int| .cse11) 4) 1)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse1 (* 2 |ULTIMATE.start_main_~len~0#1|))) (and (<= .cse0 .cse1) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) .cse2 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse3 .cse4 (<= .cse1 .cse0) .cse5 (<= |ULTIMATE.start_main_~len~0#1| .cse6) .cse7 .cse8 (<= (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse1) (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse9 (<= (+ 2 .cse6) .cse1) (<= |ULTIMATE.start_main_~i~0#1| 1) .cse10)) (and .cse2 .cse3 .cse4 (not (= .cse11 |ULTIMATE.start_main_~s~0#1.base|)) .cse5 .cse7 .cse9 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse10) (and .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~len~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((|ULTIMATE.start_sll_circular_update_at_~data#1| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (<= (+ (let ((.cse12 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) .cse12 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse12 v_DerPreprocessor_1) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse12 v_DerPreprocessor_2) |ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* 2 |ULTIMATE.start_main_~len~0#1|))) (forall ((|ULTIMATE.start_sll_circular_update_at_~data#1| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (<= (* 2 |ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse13 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~s~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) .cse13 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse13 v_DerPreprocessor_1) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse13 v_DerPreprocessor_2) |ULTIMATE.start_main_~s~0#1.offset|) 4))) 1)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |ULTIMATE.start_main_~s~0#1.offset|))) .cse5 .cse7 .cse8 .cse9 .cse10))) [2021-11-22 16:23:04,309 INFO L858 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2021-11-22 16:23:04,309 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-11-22 16:23:04,310 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-11-22 16:23:04,310 INFO L858 garLoopResultBuilder]: For program point L576-2(lines 576 578) no Hoare annotation was computed. [2021-11-22 16:23:04,310 INFO L858 garLoopResultBuilder]: For program point L576-3(lines 576 578) no Hoare annotation was computed. [2021-11-22 16:23:04,310 INFO L854 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2)) [2021-11-22 16:23:04,311 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 16:23:04,311 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2021-11-22 16:23:04,311 INFO L854 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse5 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (.cse7 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))) (or (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) .cse0 .cse1 .cse2 (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) .cse3 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse4 (not .cse5) .cse6 .cse7) (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7))) [2021-11-22 16:23:04,311 INFO L858 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2021-11-22 16:23:04,312 INFO L854 garLoopResultBuilder]: At program point L611(lines 606 612) the Hoare annotation is: (let ((.cse16 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.cse15 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_main_~len~0#1| .cse15)) (.cse12 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse13 (<= (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse16)) (.cse14 (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (.cse17 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse6 (* 2 |ULTIMATE.start_main_~expected~0#1|)) (.cse8 (* 2 (div (+ (* |ULTIMATE.start_main_~expected~0#1| (- 1)) 1) (- 2)))) (.cse11 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 (+ .cse7 .cse8 1)) (= .cse6 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| .cse8 1)) .cse9 .cse10 (= .cse11 0) .cse12 (= (mod (+ |ULTIMATE.start_main_~expected~0#1| 1) (- 2)) 0) .cse13 .cse14 (<= (+ 2 .cse15) .cse16) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= .cse16 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) (+ .cse11 4)) 1)) .cse17)) (and .cse0 .cse1 (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2) .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse12 .cse13 .cse14 (= |ULTIMATE.start_main_~len~0#1| 2) (<= .cse15 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (= .cse7 2) .cse17)))) [2021-11-22 16:23:04,312 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 16:23:04,312 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2021-11-22 16:23:04,313 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2021-11-22 16:23:04,313 INFO L858 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2021-11-22 16:23:04,313 INFO L854 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse12 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.cse14 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_node_create_#res#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_main_~len~0#1| .cse14)) (.cse8 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse9 (<= (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse12)) (.cse10 (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse11 (<= (+ 2 .cse14) .cse12)) (.cse13 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse7 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= .cse12 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) (+ .cse7 4)) 1)) .cse13)) (and (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~len~0#1| 2) .cse11 .cse13)))) [2021-11-22 16:23:04,313 INFO L858 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2021-11-22 16:23:04,314 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed. [2021-11-22 16:23:04,318 INFO L732 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1] [2021-11-22 16:23:04,320 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 16:23:04,341 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,368 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,368 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,369 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,369 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,370 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,370 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,376 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,376 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,377 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,377 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,383 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,383 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,383 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,386 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,387 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,387 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,390 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,394 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,394 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] [2021-11-22 16:23:04,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2021-11-22 16:23:04,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2021-11-22 16:23:04,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,404 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] [2021-11-22 16:23:04,404 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,405 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2021-11-22 16:23:04,405 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2021-11-22 16:23:04,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,407 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,410 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] [2021-11-22 16:23:04,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2021-11-22 16:23:04,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2021-11-22 16:23:04,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] [2021-11-22 16:23:04,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2021-11-22 16:23:04,416 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,417 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2021-11-22 16:23:04,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,418 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 04:23:04 BoogieIcfgContainer [2021-11-22 16:23:04,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 16:23:04,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 16:23:04,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 16:23:04,424 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 16:23:04,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:20:03" (3/4) ... [2021-11-22 16:23:04,428 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 16:23:04,443 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-11-22 16:23:04,444 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-22 16:23:04,445 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 16:23:04,445 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 16:23:04,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 == len && \valid[temp] == 1) && temp == 0) && \result == 0) && len == 2) && \valid[\result] == 1 [2021-11-22 16:23:04,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((last == #memory_$Pointer$[head][head] && \valid[temp] == 1) && temp == 0) && head == 0) && #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head] == 0) && \result == 0) && \valid[head] == 1) && len <= 1) && len == 2) && !(head == last)) && \valid[last] == 1) && \valid[\result] == 1) || ((((((((2 == len && \valid[temp] == 1) && temp == 0) && head == 0) && \result == 0) && head == last) && len == 2) && \valid[last] == 1) && \valid[\result] == 1) [2021-11-22 16:23:04,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && temp == 0) && head == 0) && \result == 0) && #memory_$Pointer$[\result][\result] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len == 2 [2021-11-22 16:23:04,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1 <= 2 * len && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 2 + data <= 2 * len) && len <= data) && len == 2) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && s == 0) || ((((((((\result == 0 && temp == 0) && head == 0) && !(#memory_$Pointer$[s][s] == s)) && \result == 0) && #memory_$Pointer$[s][s] == 0) && len == 2) && len == i + 1) && s == 0)) || (((((((((\result == 0 && temp == 0) && head == 0) && len == 2 + i) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 : int :: ((forall ULTIMATE.start_sll_circular_update_at_~data#1 : int, v_DerPreprocessor_2 : int, v_DerPreprocessor_1 : int :: unknown-#memory_int-unknown[s := unknown-#memory_int-unknown[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := ULTIMATE.start_sll_circular_update_at_~data#1]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_DerPreprocessor_1][s]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_DerPreprocessor_2][s] + 4] + 1 <= 2 * len) && (forall ULTIMATE.start_sll_circular_update_at_~data#1 : int, v_DerPreprocessor_2 : int, v_DerPreprocessor_1 : int :: 2 * len <= unknown-#memory_int-unknown[s := unknown-#memory_int-unknown[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := ULTIMATE.start_sll_circular_update_at_~data#1]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_DerPreprocessor_1][s]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_DerPreprocessor_2][s] + 4] + 1)) || v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 < s)) && \result == 0) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len == 2) && s == 0) [2021-11-22 16:23:04,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((head == 0 && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 2 + data <= 2 * len) && len <= data) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) || ((((((((((((((index <= 0 && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && 2 + i <= len) && index <= 0) && 2 + data <= 2 * len) && len <= data) && len == 2) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && s == 0) [2021-11-22 16:23:04,477 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(last == \result) && \valid[temp] == 1) && temp == 0) && head == 0) && \result == 0) && len <= 2) && head == last) && len == 2) && \valid[last] == 1) && !(head == temp)) && \valid[\result] == 1 [2021-11-22 16:23:04,477 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((head == 0 && \result == 0) && temp == 0) && head == 0) && #memory_$Pointer$[s][s] == head) && \result == 0) && data + 1 <= 2 * len) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len == 2) && !(head == s)) && 2 * len <= data + 1) && len == i + 1) && s == 0) || (((((((((((((\result == 0 && head == s) && temp == 0) && head == 0) && \result == 0) && data + 1 <= 2 * len) && s == head) && len == 2) && 2 * len <= data + 1) && i == index) && !(#memory_$Pointer$[head][head] == head)) && len == i + 1) && #memory_$Pointer$[head][s] == 0) && s == 0)) || ((((((((((((((head == 0 && \result == 0) && head == s) && temp == 0) && head == 0) && len == 2 + i) && \result == 0) && !(#memory_$Pointer$[s][0] == s)) && 2 + data <= 2 * len) && len <= data) && len == 2) && i == index) && #memory_$Pointer$[head][s] == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) [2021-11-22 16:23:04,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((index <= 0 && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && 2 * expected == unknown-#memory_int-unknown[head][head + 4] + 2 * ((expected * -1 + 1) / -2) + 1) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && (expected + 1) % -2 == 0) && 2 + data <= 2 * len) && len <= data) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) || ((((((((((((((((index <= 0 && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && 2 + i <= len) && 2 == expected) && index <= 0) && 2 + data <= 2 * len) && len <= data) && len == 2) && unknown-#memory_int-unknown[s][4] <= len + i) && unknown-#memory_int-unknown[head][head + 4] == 2) && s == 0)) || ((((((((((((((((((((((!(#memory_$Pointer$[head][0] == head) && #memory_$Pointer$[head][head] == 0) && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && 1 <= index) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][0]][#memory_$Pointer$[head][0] + 4] + 2 * ((expected * -1 + 1) / -2) + 1 == 2 * expected) && 2 + data <= 2 * len) && len <= data) && index <= 1) && head == 0) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4]) [2021-11-22 16:23:04,483 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((index <= 0 && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && 2 * expected == unknown-#memory_int-unknown[head][head + 4] + 2 * ((expected * -1 + 1) / -2) + 1) && 2 * expected == \result + 2 * ((expected * -1 + 1) / -2) + 1) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && (expected + 1) % -2 == 0) && 2 + data <= 2 * len) && len <= data) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) || (((((((((((((((((index <= 0 && head == 0) && \result == 2) && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && 2 + i <= len) && 2 == expected) && index <= 0) && 2 + data <= 2 * len) && len <= data) && len == 2) && unknown-#memory_int-unknown[s][4] <= len + i) && unknown-#memory_int-unknown[head][head + 4] == 2) && s == 0) [2021-11-22 16:23:04,504 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/witness.graphml [2021-11-22 16:23:04,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 16:23:04,505 INFO L158 Benchmark]: Toolchain (without parser) took 182201.73ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 94.1MB in the beginning and 124.3MB in the end (delta: -30.2MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2021-11-22 16:23:04,506 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 88.1MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 16:23:04,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.94ms. Allocated memory is still 125.8MB. Free memory was 93.8MB in the beginning and 94.2MB in the end (delta: -341.8kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-22 16:23:04,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.63ms. Allocated memory is still 125.8MB. Free memory was 94.2MB in the beginning and 91.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 16:23:04,507 INFO L158 Benchmark]: Boogie Preprocessor took 66.06ms. Allocated memory is still 125.8MB. Free memory was 91.9MB in the beginning and 90.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 16:23:04,507 INFO L158 Benchmark]: RCFGBuilder took 514.19ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 76.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-22 16:23:04,508 INFO L158 Benchmark]: TraceAbstraction took 180880.41ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 75.6MB in the beginning and 40.8MB in the end (delta: 34.8MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2021-11-22 16:23:04,508 INFO L158 Benchmark]: Witness Printer took 81.49ms. Allocated memory is still 151.0MB. Free memory was 40.8MB in the beginning and 124.3MB in the end (delta: -83.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2021-11-22 16:23:04,511 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.33ms. Allocated memory is still 88.1MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.94ms. Allocated memory is still 125.8MB. Free memory was 93.8MB in the beginning and 94.2MB in the end (delta: -341.8kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.63ms. Allocated memory is still 125.8MB. Free memory was 94.2MB in the beginning and 91.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.06ms. Allocated memory is still 125.8MB. Free memory was 91.9MB in the beginning and 90.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 514.19ms. Allocated memory is still 125.8MB. Free memory was 90.3MB in the beginning and 76.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 180880.41ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 75.6MB in the beginning and 40.8MB in the end (delta: 34.8MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 81.49ms. Allocated memory is still 151.0MB. Free memory was 40.8MB in the beginning and 124.3MB in the end (delta: -83.5MB). Peak memory consumption was 4.6MB. 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$.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$.offset - 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$.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$.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$.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$.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$.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$.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$.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$.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$.offset - 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$.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$.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$.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$.offset - 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$.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$.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$.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$.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$.offset - 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$.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$.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$.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$.offset - 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$.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$.offset - 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$.offset - 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,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_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,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_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,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_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,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_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,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_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,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_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,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_DerPreprocessor_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,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_DerPreprocessor_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 637]: 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 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 180.7s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 116.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 742 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 742 mSDsluCounter, 1028 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 198 IncrementalHoareTripleChecker+Unchecked, 735 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1184 IncrementalHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 293 mSDtfsCounter, 1184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 306 SyntacticMatches, 6 SemanticMatches, 168 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 46.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=8, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 96 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 33 NumberOfFragments, 1381 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5255 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 3156 FormulaSimplificationTreeSizeReductionInter, 115.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 50.7s InterpolantComputationTime, 598 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 710 ConstructedInterpolants, 14 QuantifiedInterpolants, 6073 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1339 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 215/297 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: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((((!(last == \result) && \valid[temp] == 1) && temp == 0) && head == 0) && \result == 0) && len <= 2) && head == last) && len == 2) && \valid[last] == 1) && !(head == temp)) && \valid[\result] == 1 - InvariantResult [Line: 629]: Loop Invariant [2021-11-22 16:23:04,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,541 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((head == 0 && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 2 + data <= 2 * len) && len <= data) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) || ((((((((((((((index <= 0 && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && 2 + i <= len) && index <= 0) && 2 + data <= 2 * len) && len <= data) && len == 2) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && s == 0) - InvariantResult [Line: 614]: Loop Invariant [2021-11-22 16:23:04,542 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,544 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,544 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,544 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,545 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((head == 0 && \result == 0) && temp == 0) && head == 0) && #memory_$Pointer$[s][s] == head) && \result == 0) && data + 1 <= 2 * len) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len == 2) && !(head == s)) && 2 * len <= data + 1) && len == i + 1) && s == 0) || (((((((((((((\result == 0 && head == s) && temp == 0) && head == 0) && \result == 0) && data + 1 <= 2 * len) && s == head) && len == 2) && 2 * len <= data + 1) && i == index) && !(#memory_$Pointer$[head][head] == head)) && len == i + 1) && #memory_$Pointer$[head][s] == 0) && s == 0)) || ((((((((((((((head == 0 && \result == 0) && head == s) && temp == 0) && head == 0) && len == 2 + i) && \result == 0) && !(#memory_$Pointer$[s][0] == s)) && 2 + data <= 2 * len) && len <= data) && len == 2) && i == index) && #memory_$Pointer$[head][s] == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) - InvariantResult [Line: 583]: Loop Invariant [2021-11-22 16:23:04,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((\result == 0 && temp == 0) && head == 0) && \result == 0) && #memory_$Pointer$[\result][\result] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len == 2 - InvariantResult [Line: 607]: Loop Invariant [2021-11-22 16:23:04,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((index <= 0 && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && 2 * expected == unknown-#memory_int-unknown[head][head + 4] + 2 * ((expected * -1 + 1) / -2) + 1) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && (expected + 1) % -2 == 0) && 2 + data <= 2 * len) && len <= data) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) || ((((((((((((((((index <= 0 && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && 2 + i <= len) && 2 == expected) && index <= 0) && 2 + data <= 2 * len) && len <= data) && len == 2) && unknown-#memory_int-unknown[s][4] <= len + i) && unknown-#memory_int-unknown[head][head + 4] == 2) && s == 0)) || ((((((((((((((((((((((!(#memory_$Pointer$[head][0] == head) && #memory_$Pointer$[head][head] == 0) && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && 1 <= index) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][0]][#memory_$Pointer$[head][0] + 4] + 2 * ((expected * -1 + 1) / -2) + 1 == 2 * expected) && 2 + data <= 2 * len) && len <= data) && index <= 1) && head == 0) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4]) - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant [2021-11-22 16:23:04,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((index <= 0 && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && 2 * expected == unknown-#memory_int-unknown[head][head + 4] + 2 * ((expected * -1 + 1) / -2) + 1) && 2 * expected == \result + 2 * ((expected * -1 + 1) / -2) + 1) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && (expected + 1) % -2 == 0) && 2 + data <= 2 * len) && len <= data) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][0]][#memory_$Pointer$[s][s] + 4] + 1) && s == 0) || (((((((((((((((((index <= 0 && head == 0) && \result == 2) && \result == 0) && head == s) && temp == 0) && head == 0) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && 2 + i <= len) && 2 == expected) && index <= 0) && 2 + data <= 2 * len) && len <= data) && len == 2) && unknown-#memory_int-unknown[s][4] <= len + i) && unknown-#memory_int-unknown[head][head + 4] == 2) && s == 0) - InvariantResult [Line: 586]: Loop Invariant [2021-11-22 16:23:04,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((last == #memory_$Pointer$[head][head] && \valid[temp] == 1) && temp == 0) && head == 0) && #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head] == 0) && \result == 0) && \valid[head] == 1) && len <= 1) && len == 2) && !(head == last)) && \valid[last] == 1) && \valid[\result] == 1) || ((((((((2 == len && \valid[temp] == 1) && temp == 0) && head == 0) && \result == 0) && head == last) && len == 2) && \valid[last] == 1) && \valid[\result] == 1) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((2 == len && \valid[temp] == 1) && temp == 0) && \result == 0) && len == 2) && \valid[\result] == 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 625]: Loop Invariant [2021-11-22 16:23:04,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,573 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] [2021-11-22 16:23:04,573 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,573 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,574 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2021-11-22 16:23:04,574 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,574 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2021-11-22 16:23:04,575 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,575 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] [2021-11-22 16:23:04,575 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,576 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,576 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2021-11-22 16:23:04,576 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2021-11-22 16:23:04,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,581 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] [2021-11-22 16:23:04,581 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,582 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2021-11-22 16:23:04,582 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,583 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2021-11-22 16:23:04,583 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,583 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_circular_update_at_~data#1,QUANTIFIED] [2021-11-22 16:23:04,584 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 16:23:04,584 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_1,QUANTIFIED] [2021-11-22 16:23:04,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 16:23:04,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_2,QUANTIFIED] [2021-11-22 16:23:04,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9,QUANTIFIED] [2021-11-22 16:23:04,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1 <= 2 * len && head == 0) && \result == 0) && head == s) && temp == 0) && head == 0) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] + 1) && \result == 0) && len <= unknown-#memory_int-unknown[s][4]) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 2 + data <= 2 * len) && len <= data) && len == 2) && 2 + unknown-#memory_int-unknown[s][4] <= 2 * len) && i <= 1) && s == 0) || ((((((((\result == 0 && temp == 0) && head == 0) && !(#memory_$Pointer$[s][s] == s)) && \result == 0) && #memory_$Pointer$[s][s] == 0) && len == 2) && len == i + 1) && s == 0)) || (((((((((\result == 0 && temp == 0) && head == 0) && len == 2 + i) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 : int :: ((forall ULTIMATE.start_sll_circular_update_at_~data#1 : int, v_DerPreprocessor_2 : int, v_DerPreprocessor_1 : int :: unknown-#memory_int-unknown[s := unknown-#memory_int-unknown[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := ULTIMATE.start_sll_circular_update_at_~data#1]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_DerPreprocessor_1][s]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_DerPreprocessor_2][s] + 4] + 1 <= 2 * len) && (forall ULTIMATE.start_sll_circular_update_at_~data#1 : int, v_DerPreprocessor_2 : int, v_DerPreprocessor_1 : int :: 2 * len <= unknown-#memory_int-unknown[s := unknown-#memory_int-unknown[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := ULTIMATE.start_sll_circular_update_at_~data#1]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_DerPreprocessor_1][s]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 + 4 := v_DerPreprocessor_2][s] + 4] + 1)) || v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9 < s)) && \result == 0) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len == 2) && s == 0) RESULT: Ultimate proved your program to be correct! [2021-11-22 16:23:04,816 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-22 16:23:04,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2764a716-29b0-4492-b9c4-b51a5359c7b6/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE