./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP --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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:08:17,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:08:18,046 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:08:18,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:08:18,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:08:18,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:08:18,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:08:18,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:08:18,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:08:18,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:08:18,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:08:18,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:08:18,080 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:08:18,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:08:18,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:08:18,081 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:08:18,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:08:18,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:08:18,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:08:18,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:08:18,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:08:18,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:08:18,092 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:08:18,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:08:18,093 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:08:18,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:08:18,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:08:18,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:08:18,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:18,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:08:18,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:08:18,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:08:18,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:08:18,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:08:18,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:08:18,098 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:08:18,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:08:18,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:08:18,099 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:08:18,100 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/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_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2023-11-06 23:08:18,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:08:18,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:08:18,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:08:18,480 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:08:18,480 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:08:18,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-11-06 23:08:21,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:08:21,854 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:08:21,855 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-11-06 23:08:21,866 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/data/1c2ae34cd/96522ce2f16b474495ec76251f6882eb/FLAGa024bd361 [2023-11-06 23:08:21,883 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/data/1c2ae34cd/96522ce2f16b474495ec76251f6882eb [2023-11-06 23:08:21,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:08:21,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:08:21,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:21,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:08:21,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:08:21,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:21" (1/1) ... [2023-11-06 23:08:21,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efaf508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:21, skipping insertion in model container [2023-11-06 23:08:21,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:21" (1/1) ... [2023-11-06 23:08:21,928 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:08:22,085 WARN L240 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_e96dd1f9-25a0-49bd-9013-42e600037547/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2023-11-06 23:08:22,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:22,133 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:08:22,149 WARN L240 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_e96dd1f9-25a0-49bd-9013-42e600037547/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2023-11-06 23:08:22,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:22,194 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:08:22,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22 WrapperNode [2023-11-06 23:08:22,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:22,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:22,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:08:22,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:08:22,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,228 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2023-11-06 23:08:22,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:22,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:08:22,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:08:22,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:08:22,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:08:22,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:08:22,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:08:22,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:08:22,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (1/1) ... [2023-11-06 23:08:22,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:22,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:22,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:08:22,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:08:22,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 23:08:22,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 23:08:22,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:08:22,357 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-06 23:08:22,358 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-06 23:08:22,358 INFO L130 BoogieDeclarations]: Found specification of procedure g [2023-11-06 23:08:22,358 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2023-11-06 23:08:22,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:08:22,359 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2023-11-06 23:08:22,359 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2023-11-06 23:08:22,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 23:08:22,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:08:22,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:08:22,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:08:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:08:22,505 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:08:22,508 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:08:22,809 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:08:22,817 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:08:22,817 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 23:08:22,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:22 BoogieIcfgContainer [2023-11-06 23:08:22,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:08:22,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:08:22,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:08:22,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:08:22,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:08:21" (1/3) ... [2023-11-06 23:08:22,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d746c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:22, skipping insertion in model container [2023-11-06 23:08:22,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:22" (2/3) ... [2023-11-06 23:08:22,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d746c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:22, skipping insertion in model container [2023-11-06 23:08:22,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:22" (3/3) ... [2023-11-06 23:08:22,830 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2023-11-06 23:08:22,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:08:22,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:08:22,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:08:22,928 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e81728a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:08:22,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:08:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 23:08:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 23:08:22,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:22,945 INFO L195 NwaCegarLoop]: 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] [2023-11-06 23:08:22,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:22,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1517633021, now seen corresponding path program 1 times [2023-11-06 23:08:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173693175] [2023-11-06 23:08:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 23:08:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 23:08:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 23:08:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 23:08:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:08:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173693175] [2023-11-06 23:08:23,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173693175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:23,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:23,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:23,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770421341] [2023-11-06 23:08:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:23,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:23,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:23,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:23,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:23,269 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:23,451 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2023-11-06 23:08:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-11-06 23:08:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:23,462 INFO L225 Difference]: With dead ends: 82 [2023-11-06 23:08:23,463 INFO L226 Difference]: Without dead ends: 44 [2023-11-06 23:08:23,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:23,470 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:23,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:08:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-06 23:08:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2023-11-06 23:08:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 23:08:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-11-06 23:08:23,517 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2023-11-06 23:08:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:23,517 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-11-06 23:08:23,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-11-06 23:08:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 23:08:23,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:23,521 INFO L195 NwaCegarLoop]: 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] [2023-11-06 23:08:23,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:08:23,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:23,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1707935715, now seen corresponding path program 1 times [2023-11-06 23:08:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:23,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86868943] [2023-11-06 23:08:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 23:08:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 23:08:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 23:08:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 23:08:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:08:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:23,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86868943] [2023-11-06 23:08:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86868943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:23,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:08:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348971298] [2023-11-06 23:08:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:23,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:23,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:23,694 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:23,943 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2023-11-06 23:08:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:08:23,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-11-06 23:08:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:23,946 INFO L225 Difference]: With dead ends: 75 [2023-11-06 23:08:23,947 INFO L226 Difference]: Without dead ends: 46 [2023-11-06 23:08:23,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:23,949 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:23,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 40 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:08:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-06 23:08:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-11-06 23:08:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 23:08:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-11-06 23:08:23,961 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 31 [2023-11-06 23:08:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:23,962 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-11-06 23:08:23,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-11-06 23:08:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 23:08:23,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:23,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:23,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:08:23,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:23,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1895345243, now seen corresponding path program 1 times [2023-11-06 23:08:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383837520] [2023-11-06 23:08:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 23:08:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 23:08:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:08:24,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383837520] [2023-11-06 23:08:24,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383837520] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726183163] [2023-11-06 23:08:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:24,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:24,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:08:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:08:24,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:08:24,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726183163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:24,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:08:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-11-06 23:08:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694029663] [2023-11-06 23:08:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:24,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:24,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:24,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:24,360 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 23:08:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:24,379 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2023-11-06 23:08:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:24,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-11-06 23:08:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:24,381 INFO L225 Difference]: With dead ends: 58 [2023-11-06 23:08:24,381 INFO L226 Difference]: Without dead ends: 39 [2023-11-06 23:08:24,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:24,383 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:24,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-06 23:08:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-11-06 23:08:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 23:08:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-11-06 23:08:24,392 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2023-11-06 23:08:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:24,393 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-11-06 23:08:24,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 23:08:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-11-06 23:08:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 23:08:24,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:24,395 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:24,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:24,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:24,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:24,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1248982919, now seen corresponding path program 1 times [2023-11-06 23:08:24,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:24,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147474997] [2023-11-06 23:08:24,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:24,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 23:08:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:08:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:08:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:08:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:08:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147474997] [2023-11-06 23:08:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147474997] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304787306] [2023-11-06 23:08:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:24,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:24,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:24,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:08:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:24,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:08:24,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:08:25,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:08:25,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304787306] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:08:25,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:08:25,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2023-11-06 23:08:25,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145623907] [2023-11-06 23:08:25,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:25,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:08:25,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:25,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:08:25,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:25,088 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 23:08:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:25,278 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2023-11-06 23:08:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:08:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 35 [2023-11-06 23:08:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:25,281 INFO L225 Difference]: With dead ends: 78 [2023-11-06 23:08:25,282 INFO L226 Difference]: Without dead ends: 48 [2023-11-06 23:08:25,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:08:25,284 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:25,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 42 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:08:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-06 23:08:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2023-11-06 23:08:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 23:08:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-11-06 23:08:25,305 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2023-11-06 23:08:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:25,309 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-11-06 23:08:25,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 23:08:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-11-06 23:08:25,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:08:25,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:25,311 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:25,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:25,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:25,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:25,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1916572233, now seen corresponding path program 2 times [2023-11-06 23:08:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079892904] [2023-11-06 23:08:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:25,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:08:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:08:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079892904] [2023-11-06 23:08:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079892904] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425859204] [2023-11-06 23:08:26,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:08:26,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:26,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:26,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:26,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:08:26,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:08:26,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:08:26,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 23:08:26,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:26,764 INFO L351 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-06 23:08:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:08:26,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:26,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425859204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:26,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:08:26,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 21 [2023-11-06 23:08:26,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507861223] [2023-11-06 23:08:26,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:26,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:08:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:26,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:08:26,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:08:26,885 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:27,095 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2023-11-06 23:08:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:08:27,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-11-06 23:08:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:27,098 INFO L225 Difference]: With dead ends: 79 [2023-11-06 23:08:27,098 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 23:08:27,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2023-11-06 23:08:27,100 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:27,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 119 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:08:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 23:08:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2023-11-06 23:08:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-11-06 23:08:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2023-11-06 23:08:27,131 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 37 [2023-11-06 23:08:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:27,132 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2023-11-06 23:08:27,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2023-11-06 23:08:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:08:27,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:27,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:27,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:27,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:27,346 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:27,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1102539601, now seen corresponding path program 1 times [2023-11-06 23:08:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573615008] [2023-11-06 23:08:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:27,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:28,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:08:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:08:28,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:28,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573615008] [2023-11-06 23:08:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573615008] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581711646] [2023-11-06 23:08:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:28,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:28,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:28,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:28,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:08:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:28,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 23:08:28,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:28,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 23:08:28,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:28,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:08:28,914 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:08:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:08:29,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:29,372 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:08:29,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-06 23:08:29,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-06 23:08:29,388 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 23:08:29,501 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:08:29,501 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-06 23:08:29,505 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:08:29,512 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:08:29,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2023-11-06 23:08:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:08:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581711646] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:08:29,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:08:29,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2023-11-06 23:08:29,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770437099] [2023-11-06 23:08:29,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:29,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-06 23:08:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-06 23:08:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1498, Unknown=0, NotChecked=0, Total=1640 [2023-11-06 23:08:29,819 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 41 states, 37 states have (on average 1.864864864864865) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-06 23:08:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:31,470 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2023-11-06 23:08:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 23:08:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.864864864864865) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 40 [2023-11-06 23:08:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:31,473 INFO L225 Difference]: With dead ends: 131 [2023-11-06 23:08:31,473 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 23:08:31,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=404, Invalid=2902, Unknown=0, NotChecked=0, Total=3306 [2023-11-06 23:08:31,477 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 449 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:31,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 123 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 23:08:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 23:08:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2023-11-06 23:08:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 73 states have internal predecessors, (90), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-06 23:08:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2023-11-06 23:08:31,499 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 40 [2023-11-06 23:08:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:31,500 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2023-11-06 23:08:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.864864864864865) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-06 23:08:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2023-11-06 23:08:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:08:31,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:31,502 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:31,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:31,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:31,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:31,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:31,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2084265885, now seen corresponding path program 1 times [2023-11-06 23:08:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:31,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962335538] [2023-11-06 23:08:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:31,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:08:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 23:08:32,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:32,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962335538] [2023-11-06 23:08:32,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962335538] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:32,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589741150] [2023-11-06 23:08:32,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:32,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:32,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:32,342 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:32,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:08:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:32,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 23:08:32,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:32,693 INFO L351 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-06 23:08:32,752 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:08:32,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:32,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:32,997 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2023-11-06 23:08:33,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:33,003 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-11-06 23:08:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:08:33,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:33,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589741150] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:33,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:08:33,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2023-11-06 23:08:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433090855] [2023-11-06 23:08:33,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:33,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 23:08:33,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:33,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 23:08:33,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=489, Unknown=3, NotChecked=0, Total=600 [2023-11-06 23:08:33,323 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 23:08:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:36,033 INFO L93 Difference]: Finished difference Result 146 states and 181 transitions. [2023-11-06 23:08:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 23:08:36,034 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40 [2023-11-06 23:08:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:36,035 INFO L225 Difference]: With dead ends: 146 [2023-11-06 23:08:36,035 INFO L226 Difference]: Without dead ends: 130 [2023-11-06 23:08:36,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=473, Invalid=1581, Unknown=16, NotChecked=0, Total=2070 [2023-11-06 23:08:36,038 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 237 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 68 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:36,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 89 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 544 Invalid, 24 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 23:08:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-06 23:08:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2023-11-06 23:08:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 73 states have internal predecessors, (90), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-06 23:08:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2023-11-06 23:08:36,066 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 40 [2023-11-06 23:08:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:36,067 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2023-11-06 23:08:36,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 23:08:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2023-11-06 23:08:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 23:08:36,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:36,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:36,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:36,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:36,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:36,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash -658709463, now seen corresponding path program 1 times [2023-11-06 23:08:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:36,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816038386] [2023-11-06 23:08:36,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:36,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:08:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 23:08:36,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816038386] [2023-11-06 23:08:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816038386] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780004973] [2023-11-06 23:08:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:36,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:36,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:36,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:36,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 23:08:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:36,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:08:36,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 23:08:36,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 23:08:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780004973] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:08:36,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:08:36,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-11-06 23:08:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451451159] [2023-11-06 23:08:36,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:36,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:36,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:36,543 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:08:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:36,707 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2023-11-06 23:08:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:08:36,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-11-06 23:08:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:36,716 INFO L225 Difference]: With dead ends: 169 [2023-11-06 23:08:36,716 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 23:08:36,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:08:36,720 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 65 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:36,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 53 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:08:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 23:08:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2023-11-06 23:08:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 77 states have internal predecessors, (94), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-06 23:08:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2023-11-06 23:08:36,754 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 41 [2023-11-06 23:08:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:36,755 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2023-11-06 23:08:36,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:08:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2023-11-06 23:08:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 23:08:36,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:36,758 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:36,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:36,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:36,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:36,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash 387918117, now seen corresponding path program 1 times [2023-11-06 23:08:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:36,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373937818] [2023-11-06 23:08:36,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:36,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:08:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:08:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:38,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373937818] [2023-11-06 23:08:38,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373937818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:38,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303089508] [2023-11-06 23:08:38,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:38,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:38,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:38,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:38,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 23:08:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:38,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 23:08:38,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:38,561 INFO L351 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-06 23:08:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:08:38,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:38,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-11-06 23:08:38,880 INFO L351 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-11-06 23:08:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:08:38,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303089508] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:08:38,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:08:38,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 8] total 35 [2023-11-06 23:08:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792047515] [2023-11-06 23:08:38,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:38,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 23:08:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:38,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 23:08:38,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 23:08:38,950 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 35 states, 31 states have (on average 2.806451612903226) internal successors, (87), 28 states have internal predecessors, (87), 9 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-06 23:08:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:42,816 INFO L93 Difference]: Finished difference Result 277 states and 362 transitions. [2023-11-06 23:08:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-06 23:08:42,817 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.806451612903226) internal successors, (87), 28 states have internal predecessors, (87), 9 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 43 [2023-11-06 23:08:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:42,820 INFO L225 Difference]: With dead ends: 277 [2023-11-06 23:08:42,820 INFO L226 Difference]: Without dead ends: 227 [2023-11-06 23:08:42,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=939, Invalid=6543, Unknown=0, NotChecked=0, Total=7482 [2023-11-06 23:08:42,825 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 430 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:42,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 161 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 23:08:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-06 23:08:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 176. [2023-11-06 23:08:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 138 states have (on average 1.3115942028985508) internal successors, (181), 145 states have internal predecessors, (181), 18 states have call successors, (18), 13 states have call predecessors, (18), 19 states have return successors, (28), 17 states have call predecessors, (28), 13 states have call successors, (28) [2023-11-06 23:08:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2023-11-06 23:08:42,879 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 43 [2023-11-06 23:08:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:42,879 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2023-11-06 23:08:42,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.806451612903226) internal successors, (87), 28 states have internal predecessors, (87), 9 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-06 23:08:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2023-11-06 23:08:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 23:08:42,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:42,881 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:42,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:43,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:43,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:43,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash -479191559, now seen corresponding path program 2 times [2023-11-06 23:08:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526136278] [2023-11-06 23:08:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 23:08:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:08:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526136278] [2023-11-06 23:08:43,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526136278] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052778583] [2023-11-06 23:08:43,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:08:43,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:43,913 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:43,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 23:08:44,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:08:44,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:08:44,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 23:08:44,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:44,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 23:08:44,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:44,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:08:44,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 23:08:44,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:44,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:08:44,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:44,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 23:08:44,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:44,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 23:08:44,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:44,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 23:08:44,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:44,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:08:44,668 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:08:44,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:44,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-11-06 23:08:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 23:08:44,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:45,714 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:08:45,715 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2023-11-06 23:08:45,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 23:08:45,723 INFO L351 Elim1Store]: Elim1 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 54 treesize of output 50 [2023-11-06 23:08:45,731 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:08:45,732 INFO L351 Elim1Store]: Elim1 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 34 treesize of output 34 [2023-11-06 23:08:45,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:08:45,774 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:08:45,779 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 23:08:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 23:08:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052778583] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:08:45,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:08:45,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 11] total 37 [2023-11-06 23:08:45,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076404646] [2023-11-06 23:08:45,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:45,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-06 23:08:45,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:45,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-06 23:08:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1196, Unknown=8, NotChecked=0, Total=1332 [2023-11-06 23:08:45,849 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand has 37 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 31 states have internal predecessors, (83), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2023-11-06 23:08:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:47,810 INFO L93 Difference]: Finished difference Result 233 states and 294 transitions. [2023-11-06 23:08:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:08:47,811 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 31 states have internal predecessors, (83), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 43 [2023-11-06 23:08:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:47,813 INFO L225 Difference]: With dead ends: 233 [2023-11-06 23:08:47,814 INFO L226 Difference]: Without dead ends: 130 [2023-11-06 23:08:47,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=434, Invalid=2864, Unknown=8, NotChecked=0, Total=3306 [2023-11-06 23:08:47,817 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 217 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:47,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 74 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 23:08:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-06 23:08:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2023-11-06 23:08:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 9 states have call successors, (9), 9 states have call predecessors, (9), 9 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-06 23:08:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2023-11-06 23:08:47,846 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 43 [2023-11-06 23:08:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:47,847 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2023-11-06 23:08:47,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.3714285714285714) internal successors, (83), 31 states have internal predecessors, (83), 7 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2023-11-06 23:08:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2023-11-06 23:08:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 23:08:47,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:47,849 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:47,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:48,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 23:08:48,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:48,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1610816303, now seen corresponding path program 1 times [2023-11-06 23:08:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:48,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115459435] [2023-11-06 23:08:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:08:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:08:48,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115459435] [2023-11-06 23:08:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115459435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883362536] [2023-11-06 23:08:48,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:48,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:48,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:48,987 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:49,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 23:08:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:49,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-06 23:08:49,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:49,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 23:08:49,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:49,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:08:49,693 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:08:49,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-06 23:08:49,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:49,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:08:49,892 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:08:50,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:50,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:08:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:08:50,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:50,453 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_901 (Array Int Int))) (not (= |c_g_#in~pointer#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_901) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4))))) is different from false [2023-11-06 23:08:50,459 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_901 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_901) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2023-11-06 23:08:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883362536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:50,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:08:50,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2023-11-06 23:08:50,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100056213] [2023-11-06 23:08:50,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-06 23:08:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-06 23:08:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1476, Unknown=13, NotChecked=158, Total=1806 [2023-11-06 23:08:50,475 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 31 states have internal predecessors, (69), 5 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-06 23:08:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:52,289 INFO L93 Difference]: Finished difference Result 153 states and 182 transitions. [2023-11-06 23:08:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 23:08:52,290 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 31 states have internal predecessors, (69), 5 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 47 [2023-11-06 23:08:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:52,292 INFO L225 Difference]: With dead ends: 153 [2023-11-06 23:08:52,292 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 23:08:52,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=488, Invalid=3539, Unknown=13, NotChecked=250, Total=4290 [2023-11-06 23:08:52,295 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 256 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:52,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 76 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 23:08:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 23:08:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2023-11-06 23:08:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 87 states have internal predecessors, (105), 9 states have call successors, (9), 9 states have call predecessors, (9), 9 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-06 23:08:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2023-11-06 23:08:52,317 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 47 [2023-11-06 23:08:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:52,318 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2023-11-06 23:08:52,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 31 states have internal predecessors, (69), 5 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-06 23:08:52,318 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2023-11-06 23:08:52,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 23:08:52,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:52,319 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:52,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:52,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:52,526 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:52,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1018026466, now seen corresponding path program 1 times [2023-11-06 23:08:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:52,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631051488] [2023-11-06 23:08:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:52,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:52,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:08:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:08:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631051488] [2023-11-06 23:08:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631051488] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977880350] [2023-11-06 23:08:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:52,681 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:52,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 23:08:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:52,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:08:52,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:08:52,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:08:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977880350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:52,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:08:52,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-11-06 23:08:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100588969] [2023-11-06 23:08:52,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:52,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:52,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:52,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:52,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:08:52,895 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:52,935 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2023-11-06 23:08:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:52,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2023-11-06 23:08:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:52,941 INFO L225 Difference]: With dead ends: 149 [2023-11-06 23:08:52,942 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 23:08:52,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:08:52,943 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:52,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:08:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 23:08:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2023-11-06 23:08:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.1282051282051282) internal successors, (88), 79 states have internal predecessors, (88), 9 states have call successors, (9), 9 states have call predecessors, (9), 9 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-06 23:08:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2023-11-06 23:08:52,967 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 48 [2023-11-06 23:08:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:52,967 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2023-11-06 23:08:52,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2023-11-06 23:08:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 23:08:52,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:52,969 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:52,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:08:53,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:53,175 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:53,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash -384289610, now seen corresponding path program 1 times [2023-11-06 23:08:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:53,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414291059] [2023-11-06 23:08:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:53,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:53,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:08:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 23:08:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:53,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414291059] [2023-11-06 23:08:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414291059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:53,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:53,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:08:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394649937] [2023-11-06 23:08:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:53,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:08:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:53,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:08:53,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:08:53,306 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:53,489 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2023-11-06 23:08:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:08:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2023-11-06 23:08:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:53,491 INFO L225 Difference]: With dead ends: 137 [2023-11-06 23:08:53,491 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 23:08:53,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:08:53,493 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:53,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 51 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:08:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 23:08:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2023-11-06 23:08:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 68 states have internal predecessors, (72), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-06 23:08:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-11-06 23:08:53,512 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 48 [2023-11-06 23:08:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:53,513 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-11-06 23:08:53,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:08:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-11-06 23:08:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 23:08:53,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:53,515 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:53,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:08:53,516 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:53,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:53,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2101637850, now seen corresponding path program 1 times [2023-11-06 23:08:53,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:53,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472537589] [2023-11-06 23:08:53,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:53,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:08:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:54,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:08:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:54,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:08:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:08:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 23:08:54,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472537589] [2023-11-06 23:08:54,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472537589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:08:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646171463] [2023-11-06 23:08:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:54,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:08:54,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:54,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:08:54,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 23:08:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:54,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-06 23:08:54,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:08:55,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:08:55,666 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:08:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:08:55,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:08:56,113 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-06 23:08:56,126 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-06 23:08:56,364 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:08:56,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2023-11-06 23:08:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 23:08:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646171463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:08:56,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:08:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 55 [2023-11-06 23:08:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146923719] [2023-11-06 23:08:56,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:08:56,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-06 23:08:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:56,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-06 23:08:56,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2758, Unknown=0, NotChecked=0, Total=2970 [2023-11-06 23:08:56,796 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 55 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 38 states have internal predecessors, (103), 13 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-06 23:08:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:08:58,685 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2023-11-06 23:08:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 23:08:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 38 states have internal predecessors, (103), 13 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) Word has length 53 [2023-11-06 23:08:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:08:58,686 INFO L225 Difference]: With dead ends: 92 [2023-11-06 23:08:58,686 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 23:08:58,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=544, Invalid=5156, Unknown=0, NotChecked=0, Total=5700 [2023-11-06 23:08:58,689 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 125 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:08:58,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 124 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 23:08:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 23:08:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-06 23:08:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-06 23:08:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-11-06 23:08:58,704 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 53 [2023-11-06 23:08:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:08:58,705 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-11-06 23:08:58,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 47 states have (on average 2.1914893617021276) internal successors, (103), 38 states have internal predecessors, (103), 13 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-06 23:08:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-11-06 23:08:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 23:08:58,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:08:58,706 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:58,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-06 23:08:58,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 23:08:58,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:08:58,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1289824473, now seen corresponding path program 2 times [2023-11-06 23:08:58,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:58,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429062693] [2023-11-06 23:08:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:08:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:00,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:09:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:09:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:09:00,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:00,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429062693] [2023-11-06 23:09:00,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429062693] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:09:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366139697] [2023-11-06 23:09:00,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:09:00,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:09:00,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:09:00,832 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:09:00,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 23:09:01,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:09:01,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:09:01,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-06 23:09:01,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:09:01,802 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 23:09:01,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:01,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:09:01,941 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:09:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:09:02,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:09:02,535 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1416 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_1416) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2023-11-06 23:09:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366139697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:09:02,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:09:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 47 [2023-11-06 23:09:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228682520] [2023-11-06 23:09:02,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:09:02,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-06 23:09:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:02,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-06 23:09:02,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2028, Unknown=1, NotChecked=90, Total=2256 [2023-11-06 23:09:02,540 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 47 states, 43 states have (on average 2.046511627906977) internal successors, (88), 36 states have internal predecessors, (88), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-06 23:09:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:04,843 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2023-11-06 23:09:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 23:09:04,844 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 2.046511627906977) internal successors, (88), 36 states have internal predecessors, (88), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 58 [2023-11-06 23:09:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:04,845 INFO L225 Difference]: With dead ends: 86 [2023-11-06 23:09:04,845 INFO L226 Difference]: Without dead ends: 59 [2023-11-06 23:09:04,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=407, Invalid=4852, Unknown=1, NotChecked=142, Total=5402 [2023-11-06 23:09:04,848 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 152 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:04,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 138 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 23:09:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-06 23:09:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-06 23:09:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-06 23:09:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2023-11-06 23:09:04,858 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 58 [2023-11-06 23:09:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:04,858 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2023-11-06 23:09:04,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 2.046511627906977) internal successors, (88), 36 states have internal predecessors, (88), 10 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-06 23:09:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2023-11-06 23:09:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 23:09:04,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:04,860 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:04,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 23:09:05,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:09:05,066 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:05,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:05,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1190348709, now seen corresponding path program 1 times [2023-11-06 23:09:05,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:05,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306367610] [2023-11-06 23:09:05,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:05,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:05,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 23:09:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:05,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 23:09:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 23:09:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 23:09:06,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306367610] [2023-11-06 23:09:06,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306367610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:09:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48029701] [2023-11-06 23:09:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:09:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:09:06,319 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:09:06,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 23:09:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:06,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-06 23:09:06,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:09:06,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 23:09:06,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:06,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:09:07,063 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:09:07,245 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-06 23:09:07,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:07,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:09:07,267 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:09:07,365 INFO L351 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-11-06 23:09:07,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:09:07,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:09:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:09:07,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:09:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48029701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:09:08,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:09:08,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2023-11-06 23:09:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796715020] [2023-11-06 23:09:08,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:09:08,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-06 23:09:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-06 23:09:08,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1995, Unknown=17, NotChecked=0, Total=2162 [2023-11-06 23:09:08,116 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 41 states, 40 states have (on average 2.175) internal successors, (87), 34 states have internal predecessors, (87), 7 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-06 23:09:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:09,560 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2023-11-06 23:09:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 23:09:09,561 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 34 states have internal predecessors, (87), 7 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 58 [2023-11-06 23:09:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:09,561 INFO L225 Difference]: With dead ends: 59 [2023-11-06 23:09:09,562 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:09:09,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=336, Invalid=3671, Unknown=25, NotChecked=0, Total=4032 [2023-11-06 23:09:09,564 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 49 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 30 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:09,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 59 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 652 Invalid, 13 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:09:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:09:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:09:09,565 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) [2023-11-06 23:09:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:09:09,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2023-11-06 23:09:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:09,566 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:09:09,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 34 states have internal predecessors, (87), 7 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-06 23:09:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:09:09,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:09:09,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:09:09,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 23:09:09,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:09:09,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:09:12,206 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2023-11-06 23:09:12,206 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 33) no Hoare annotation was computed. [2023-11-06 23:09:12,207 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse13 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse2 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse4 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse12 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (let ((.cse5 (< 4 |~#pp~0.base|)) (.cse6 (not (= |~#pstate~0.offset| 0))) (.cse7 (< |~#pstate~0.base| 5)) (.cse8 (not (= |~#pp~0.offset| 0))) (.cse9 (not (= (select .cse12 4) 0))) (.cse10 (and (= f_~pointer.base |f_#in~pointer.base|) .cse1 .cse2 .cse3 (= f_~i~1 0) .cse4)) (.cse0 (select .cse13 0)) (.cse11 (not (= (select .cse13 4) 0)))) (and (or (not (= .cse0 1)) (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) 0) 1)) (and (= f_~i~1 1) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 .cse0)) .cse11 (not (= (select .cse12 0) 0)))))) [2023-11-06 23:09:12,208 INFO L899 garLoopResultBuilder]: For program point L27-4(lines 25 34) no Hoare annotation was computed. [2023-11-06 23:09:12,208 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 25 34) the Hoare annotation is: (let ((.cse8 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse9 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse6 (select .cse9 0)) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse1 (< 4 |~#pp~0.base|)) (.cse2 (not (= |~#pstate~0.offset| 0))) (.cse3 (< |~#pstate~0.base| 5)) (.cse4 (not (= |~#pp~0.offset| 0))) (.cse5 (not (= (select .cse8 4) 0))) (.cse7 (not (= (select .cse9 4) 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 .cse6)) .cse7 (not (= (select .cse8 0) 0))) (or (not (= .cse6 1)) .cse0 (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) 0) 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7)))) [2023-11-06 23:09:12,209 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 25 34) no Hoare annotation was computed. [2023-11-06 23:09:12,209 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 36 45) the Hoare annotation is: (let ((.cse2 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse0 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) 0)) (.cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (< 4 |~#pp~0.base|)) (.cse4 (not (= |~#pstate~0.offset| 0))) (.cse5 (< |~#pstate~0.base| 5)) (.cse6 (not (= |~#pp~0.offset| 0))) (.cse7 (not (= (select .cse2 4) 1)))) (and (or (not (= |g_#in~pointer#1.offset| .cse0)) .cse1 (not (= (select .cse2 0) 1)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) |g_#in~pointer#1.base|))) (or (not (= .cse0 1)) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 2 |g_#in~pointer#1.offset|)))))) [2023-11-06 23:09:12,209 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2023-11-06 23:09:12,209 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse21 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse20 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse6 (< 4 |~#pp~0.base|)) (.cse13 (not (= |~#pstate~0.offset| 0))) (.cse14 (< |~#pstate~0.base| 5)) (.cse15 (not (= |~#pp~0.offset| 0))) (.cse16 (not (= (select .cse1 4) 1))) (.cse19 (= |g_~i~2#1| 1)) (.cse0 (select .cse20 0)) (.cse18 (= (select (select |#memory_int| |~#pstate~0.base|) 4) 1)) (.cse7 (= |g_~i~2#1| 0)) (.cse8 (= |#memory_int| |old(#memory_int)|)) (.cse9 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse10 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse11 (select .cse21 0)) (.cse2 (<= 2 |g_~i~2#1|)) (.cse12 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0)) (.cse17 (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0))) (and (let ((.cse3 (= .cse20 .cse21)) (.cse4 (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|)) (.cse5 (= .cse12 |g_#in~pointer#1.base|))) (or (not (= |g_#in~pointer#1.offset| .cse0)) (not (= (select .cse1 0) 1)) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (= (select (select (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| v_DerPreprocessor_1) |~#pp~0.base|) 4) |g_#in~pointer#1.offset|)) .cse2 .cse3 .cse4 .cse5) .cse6 (and .cse7 .cse8 .cse9 .cse10 (= |g_~pointer#1.offset| .cse11) (= .cse12 |g_~pointer#1.base|)) .cse13 .cse14 .cse15 .cse16 (not (= .cse17 |g_#in~pointer#1.base|)) (and .cse2 .cse3 .cse5 .cse18) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| (select |#memory_$Pointer$.offset| |~#pstate~0.base|))) .cse4 .cse19 .cse5 .cse18))) (let ((.cse22 (= (select .cse21 4) (select .cse20 4))) (.cse23 (= .cse12 .cse17))) (or (not (= .cse0 1)) .cse6 .cse13 .cse14 .cse15 .cse16 (and .cse22 .cse19 .cse23 (= .cse11 .cse0) .cse18) (and .cse7 .cse8 .cse9 .cse10 (= |g_~pointer#1.offset| 2)) (not (= 2 |g_#in~pointer#1.offset|)) (and (= .cse11 1) .cse22 .cse2 .cse23)))))) [2023-11-06 23:09:12,210 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 36 45) no Hoare annotation was computed. [2023-11-06 23:09:12,210 INFO L899 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-11-06 23:09:12,210 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-11-06 23:09:12,210 INFO L899 garLoopResultBuilder]: For program point gEXIT(lines 36 45) no Hoare annotation was computed. [2023-11-06 23:09:12,210 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-11-06 23:09:12,210 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-06 23:09:12,211 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2023-11-06 23:09:12,211 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 9) no Hoare annotation was computed. [2023-11-06 23:09:12,211 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:09:12,211 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (<= 2 ~counter~0) (= (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0) 1) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= |~#pstate~0.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= |ULTIMATE.start_main_~b~0#1.base| 0) (= (select (select |#memory_int| |~#pstate~0.base|) 4) 1)) [2023-11-06 23:09:12,211 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (<= 2 ~counter~0) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select .cse0 0) 0) (= 0 (select .cse1 0)) (= |~#pstate~0.offset| 0) (= (select .cse1 4) 0) (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= |ULTIMATE.start_main_~b~0#1.base| 0))) [2023-11-06 23:09:12,212 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (<= 2 ~counter~0) (= (select .cse0 0) 1) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select .cse1 0) 0) (= |~#pstate~0.offset| 0) (= (select .cse0 4) 0) (= (select .cse1 4) 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= |ULTIMATE.start_main_~b~0#1.base| 0) (= (select (select |#memory_int| |~#pstate~0.base|) 0) 1))) [2023-11-06 23:09:12,212 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select .cse0 0) 0) (= 0 (select .cse1 0)) (= |~#pstate~0.offset| 0) (= (select .cse1 4) 0) (= (select .cse0 4) 0) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= ~counter~0 2))) [2023-11-06 23:09:12,212 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-11-06 23:09:12,212 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2023-11-06 23:09:12,212 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-11-06 23:09:12,213 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse9 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (let ((.cse0 (= (select .cse9 0) 0)) (.cse1 (= 0 (select .cse10 0))) (.cse2 (= |~#pstate~0.offset| 0)) (.cse3 (= (select .cse10 4) 0)) (.cse4 (= (select .cse9 4) 0)) (.cse5 (<= |~#pp~0.base| 4)) (.cse6 (<= 5 |~#pstate~0.base|)) (.cse7 (= |~#pp~0.offset| 0)) (.cse8 (= ~counter~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_init_~i~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_init_~i~0#1|) .cse7 .cse8)))) [2023-11-06 23:09:12,213 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:09:12,213 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 53 71) the Hoare annotation is: true [2023-11-06 23:09:12,213 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:09:12,213 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (select |#memory_int| |~#pstate~0.base|))) (and (<= 2 ~counter~0) (= (select .cse0 0) 1) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0) 0) (= |~#pstate~0.offset| 0) (= (select .cse0 4) 2) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pp~0.offset| 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= |ULTIMATE.start_main_~b~0#1.base| 0) (= (select .cse1 0) 1) (= (select .cse1 4) 1))) [2023-11-06 23:09:12,213 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:09:12,214 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2023-11-06 23:09:12,214 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (= (select .cse0 0) 0) (= 0 (select .cse1 0)) (= |~#pstate~0.offset| 0) (= (select .cse1 4) 0) (= (select .cse0 4) 0) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pp~0.offset| 0) (= ~counter~0 1))) [2023-11-06 23:09:12,214 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2023-11-06 23:09:12,215 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-06 23:09:12,215 INFO L899 garLoopResultBuilder]: For program point fake_mallocFINAL(lines 48 51) no Hoare annotation was computed. [2023-11-06 23:09:12,215 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 48 51) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse9 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (< 4 |~#pp~0.base|)) (.cse1 (not (= |~#pstate~0.offset| 0))) (.cse2 (< |~#pstate~0.base| 5)) (.cse3 (not (= |~#pp~0.offset| 0))) (.cse4 (not (= 0 (select .cse9 0)))) (.cse5 (not (= (select .cse8 4) 0))) (.cse6 (not (= (select .cse9 4) 0))) (.cse7 (not (= (select .cse8 0) 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~counter~0)| 2)) .cse6 .cse7 (= ~counter~0 2)) (or (not (= |old(~counter~0)| 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~counter~0 1))))) [2023-11-06 23:09:12,215 INFO L899 garLoopResultBuilder]: For program point fake_mallocEXIT(lines 48 51) no Hoare annotation was computed. [2023-11-06 23:09:12,219 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:12,221 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:09:12,236 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,237 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,237 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,237 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,238 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated [2023-11-06 23:09:12,240 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int :: old(#memory_$Pointer$.offset)[~#pstate~0!base := v_DerPreprocessor_1][~#pp~0!base][4] == #in~pointer!offset) could not be translated [2023-11-06 23:09:12,241 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,241 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,241 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,241 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,242 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,242 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,242 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,243 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,243 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,243 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,243 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,244 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,244 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,244 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,244 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,244 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,245 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,245 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,245 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,245 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,245 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,246 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression old(#memory_$Pointer$.offset)[~#pstate~0!base := #memory_$Pointer$.offset[~#pstate~0!base]] could not be translated [2023-11-06 23:09:12,246 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,246 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,246 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,246 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,247 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,247 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,247 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,247 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,248 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,248 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,248 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,248 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,248 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,249 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,249 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,249 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,249 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,249 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,250 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,250 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,250 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,250 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,250 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,251 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,251 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,251 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,251 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,252 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,252 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,252 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,252 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,252 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,253 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,253 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,253 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,253 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,256 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,257 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,257 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,257 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,257 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated [2023-11-06 23:09:12,258 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int :: old(#memory_$Pointer$.offset)[~#pstate~0!base := v_DerPreprocessor_1][~#pp~0!base][4] == #in~pointer!offset) could not be translated [2023-11-06 23:09:12,258 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,258 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,258 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,259 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,259 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,259 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,259 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,260 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,260 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,260 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,260 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,260 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,261 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,261 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,261 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,261 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,262 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,262 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,262 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,262 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,262 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression old(#memory_$Pointer$.offset)[~#pstate~0!base := #memory_$Pointer$.offset[~#pstate~0!base]] could not be translated [2023-11-06 23:09:12,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,264 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,264 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,264 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,264 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,265 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,265 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,265 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,265 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,265 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,266 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,266 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,266 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,266 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,266 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,267 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,267 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,267 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,267 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,267 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,268 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,268 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,268 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,268 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,268 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,269 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,269 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,269 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,269 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,269 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,270 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,270 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,270 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,270 ERROR L462 ceAbstractionStarter]: Failed to backtranslate (let ((.cse21 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse20 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse6 (< 4 |~#pp~0.base|)) (.cse13 (not (= |~#pstate~0.offset| 0))) (.cse14 (< |~#pstate~0.base| 5)) (.cse15 (not (= |~#pp~0.offset| 0))) (.cse16 (not (= (select .cse1 4) 1))) (.cse19 (= |g_~i~2#1| 1)) (.cse0 (select .cse20 0)) (.cse18 (= (select (select |#memory_int| |~#pstate~0.base|) 4) 1)) (.cse7 (= |g_~i~2#1| 0)) (.cse8 (= |#memory_int| |old(#memory_int)|)) (.cse9 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse10 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse11 (select .cse21 0)) (.cse2 (<= 2 |g_~i~2#1|)) (.cse12 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0)) (.cse17 (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0))) (and (let ((.cse3 (= .cse20 .cse21)) (.cse4 (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|)) (.cse5 (= .cse12 |g_#in~pointer#1.base|))) (or (not (= |g_#in~pointer#1.offset| .cse0)) (not (= (select .cse1 0) 1)) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (= (select (select (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| v_DerPreprocessor_1) |~#pp~0.base|) 4) |g_#in~pointer#1.offset|)) .cse2 .cse3 .cse4 .cse5) .cse6 (and .cse7 .cse8 .cse9 .cse10 (= |g_~pointer#1.offset| .cse11) (= .cse12 |g_~pointer#1.base|)) .cse13 .cse14 .cse15 .cse16 (not (= .cse17 |g_#in~pointer#1.base|)) (and .cse2 .cse3 .cse5 .cse18) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| (select |#memory_$Pointer$.offset| |~#pstate~0.base|))) .cse4 .cse19 .cse5 .cse18))) (let ((.cse22 (= (select .cse21 4) (select .cse20 4))) (.cse23 (= .cse12 .cse17))) (or (not (= .cse0 1)) .cse6 .cse13 .cse14 .cse15 .cse16 (and .cse22 .cse19 .cse23 (= .cse11 .cse0) .cse18) (and .cse7 .cse8 .cse9 .cse10 (= |g_~pointer#1.offset| 2)) (not (= 2 |g_#in~pointer#1.offset|)) (and (= .cse11 1) .cse22 .cse2 .cse23)))))) [2023-11-06 23:09:12,272 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,273 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,273 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,273 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated [2023-11-06 23:09:12,274 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,274 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,274 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,274 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,275 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,275 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,275 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,275 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,275 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,276 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,276 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,276 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,276 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,277 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,277 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,277 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,277 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,277 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,279 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,279 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,279 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,280 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated [2023-11-06 23:09:12,280 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,280 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,280 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,281 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,281 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,281 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,281 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,281 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,282 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,282 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,282 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,282 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,283 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,283 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,283 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,283 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,283 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,284 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,284 ERROR L462 ceAbstractionStarter]: Failed to backtranslate (let ((.cse13 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse2 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse4 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse12 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (let ((.cse5 (< 4 |~#pp~0.base|)) (.cse6 (not (= |~#pstate~0.offset| 0))) (.cse7 (< |~#pstate~0.base| 5)) (.cse8 (not (= |~#pp~0.offset| 0))) (.cse9 (not (= (select .cse12 4) 0))) (.cse10 (and (= f_~pointer.base |f_#in~pointer.base|) .cse1 .cse2 .cse3 (= f_~i~1 0) .cse4)) (.cse0 (select .cse13 0)) (.cse11 (not (= (select .cse13 4) 0)))) (and (or (not (= .cse0 1)) (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) 0) 1)) (and (= f_~i~1 1) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 .cse0)) .cse11 (not (= (select .cse12 0) 0)))))) [2023-11-06 23:09:12,285 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,285 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,286 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,286 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,286 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,286 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,287 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,287 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,287 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,287 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,287 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,288 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,288 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,288 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,288 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,288 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,290 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,290 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,290 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,290 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,291 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,291 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,291 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,291 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,292 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,292 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,292 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,292 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,293 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,293 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,293 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,293 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:09:12 BoogieIcfgContainer [2023-11-06 23:09:12,294 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:09:12,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:09:12,295 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:09:12,295 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:09:12,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:22" (3/4) ... [2023-11-06 23:09:12,298 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:09:12,302 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2023-11-06 23:09:12,303 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2023-11-06 23:09:12,303 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fake_malloc [2023-11-06 23:09:12,308 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-06 23:09:12,308 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-06 23:09:12,308 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:09:12,309 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:09:12,391 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:09:12,391 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:09:12,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:09:12,392 INFO L158 Benchmark]: Toolchain (without parser) took 50496.87ms. Allocated memory was 176.2MB in the beginning and 461.4MB in the end (delta: 285.2MB). Free memory was 129.3MB in the beginning and 271.3MB in the end (delta: -141.9MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. [2023-11-06 23:09:12,393 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 176.2MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:09:12,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.30ms. Allocated memory is still 176.2MB. Free memory was 129.1MB in the beginning and 118.1MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:09:12,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 116.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:09:12,394 INFO L158 Benchmark]: Boogie Preprocessor took 33.38ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 115.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:09:12,395 INFO L158 Benchmark]: RCFGBuilder took 550.98ms. Allocated memory is still 176.2MB. Free memory was 115.0MB in the beginning and 100.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:09:12,395 INFO L158 Benchmark]: TraceAbstraction took 49471.53ms. Allocated memory was 176.2MB in the beginning and 461.4MB in the end (delta: 285.2MB). Free memory was 100.4MB in the beginning and 274.4MB in the end (delta: -174.1MB). Peak memory consumption was 235.6MB. Max. memory is 16.1GB. [2023-11-06 23:09:12,395 INFO L158 Benchmark]: Witness Printer took 96.49ms. Allocated memory is still 461.4MB. Free memory was 274.4MB in the beginning and 271.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:09:12,403 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 176.2MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.30ms. Allocated memory is still 176.2MB. Free memory was 129.1MB in the beginning and 118.1MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 116.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.38ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 115.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 550.98ms. Allocated memory is still 176.2MB. Free memory was 115.0MB in the beginning and 100.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 49471.53ms. Allocated memory was 176.2MB in the beginning and 461.4MB in the end (delta: 285.2MB). Free memory was 100.4MB in the beginning and 274.4MB in the end (delta: -174.1MB). Peak memory consumption was 235.6MB. Max. memory is 16.1GB. * Witness Printer took 96.49ms. Allocated memory is still 461.4MB. Free memory was 274.4MB in the beginning and 271.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int :: old(#memory_$Pointer$.offset)[~#pstate~0!base := v_DerPreprocessor_1][~#pp~0!base][4] == #in~pointer!offset) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression old(#memory_$Pointer$.offset)[~#pstate~0!base := #memory_$Pointer$.offset[~#pstate~0!base]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int :: old(#memory_$Pointer$.offset)[~#pstate~0!base := v_DerPreprocessor_1][~#pp~0!base][4] == #in~pointer!offset) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression old(#memory_$Pointer$.offset)[~#pstate~0!base := #memory_$Pointer$.offset[~#pstate~0!base]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated * 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: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.3s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 2247 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2239 mSDsluCounter, 1401 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1085 mSDsCounter, 636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9818 IncrementalHoareTripleChecker+Invalid, 10491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 636 mSolverCounterUnsat, 316 mSDtfsCounter, 9818 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1396 GetRequests, 811 SyntacticMatches, 5 SemanticMatches, 580 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7475 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=9, InterpolantAutomatonStates: 276, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 229 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 126 PreInvPairs, 148 NumberOfFragments, 1179 HoareAnnotationTreeSize, 126 FomulaSimplifications, 32183 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 13 FomulaSimplificationsInter, 3095 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 1262 NumberOfCodeBlocks, 1247 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1482 ConstructedInterpolants, 34 QuantifiedInterpolants, 11761 SizeOfPredicates, 79 NumberOfNonLiveVariables, 3667 ConjunctsInSsa, 352 ConjunctsInUnsatCore, 35 InterpolantComputations, 6 PerfectInterpolantSequences, 423/698 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: 38]: Loop Invariant [2023-11-06 23:09:12,457 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,459 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,460 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,460 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,460 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated [2023-11-06 23:09:12,461 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int :: old(#memory_$Pointer$.offset)[~#pstate~0!base := v_DerPreprocessor_1][~#pp~0!base][4] == #in~pointer!offset) could not be translated [2023-11-06 23:09:12,461 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,461 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,461 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,462 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,463 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,463 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,463 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,464 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,464 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,465 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,465 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,465 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,465 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,466 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,466 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,466 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,466 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,466 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,467 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,467 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,467 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,467 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression old(#memory_$Pointer$.offset)[~#pstate~0!base := #memory_$Pointer$.offset[~#pstate~0!base]] could not be translated [2023-11-06 23:09:12,467 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,467 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,468 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,468 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,468 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,468 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,468 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,468 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,469 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,469 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,470 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,470 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,470 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,470 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,471 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,472 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,472 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,472 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,473 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,473 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,473 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,473 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,473 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,473 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,479 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,480 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,480 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,480 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,480 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,480 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,480 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,481 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,481 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,481 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,481 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,481 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,484 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,485 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,485 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,486 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,486 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated [2023-11-06 23:09:12,486 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int :: old(#memory_$Pointer$.offset)[~#pstate~0!base := v_DerPreprocessor_1][~#pp~0!base][4] == #in~pointer!offset) could not be translated [2023-11-06 23:09:12,486 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,487 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,487 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,487 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,487 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,487 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,488 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,488 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,488 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,488 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,488 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,489 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,489 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,489 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,490 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,490 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,490 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,490 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,490 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,490 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,491 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,491 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression old(#memory_$Pointer$.offset)[~#pstate~0!base := #memory_$Pointer$.offset[~#pstate~0!base]] could not be translated [2023-11-06 23:09:12,491 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,491 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,492 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,492 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,492 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,492 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,492 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,493 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,495 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,496 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,496 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,496 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,496 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,497 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,497 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,497 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,498 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,498 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,498 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,499 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,499 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,499 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,500 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,500 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#pstate~0!base][4] could not be translated [2023-11-06 23:09:12,500 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,500 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,500 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,500 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,501 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,501 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,501 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,501 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,501 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,501 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,502 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,502 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated Derived loop invariant: NULL - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant [2023-11-06 23:09:12,505 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,506 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,506 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,506 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated [2023-11-06 23:09:12,506 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,507 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,508 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,508 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,509 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,509 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,509 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,509 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,510 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,510 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,510 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,510 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,510 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,511 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,511 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,511 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,511 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,511 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,514 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,514 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,515 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base] could not be translated [2023-11-06 23:09:12,515 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_int)[~#pstate~0!base][0] could not be translated [2023-11-06 23:09:12,515 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,515 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,516 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,516 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,516 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,516 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,517 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,518 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,518 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,518 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,520 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,520 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~pointer!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:09:12,521 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,521 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,523 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,524 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.offset)[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,524 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base] could not be translated [2023-11-06 23:09:12,524 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression old(#memory_$Pointer$.base)[~#pp~0!base][0] could not be translated Derived loop invariant: NULL - InvariantResult [Line: 19]: Loop Invariant [2023-11-06 23:09:12,527 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,527 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,527 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,528 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,528 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,528 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,528 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,528 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,529 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,529 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,529 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,529 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,529 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,530 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,530 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,530 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,531 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,531 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,531 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,531 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,531 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,533 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][0] could not be translated [2023-11-06 23:09:12,533 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base] could not be translated [2023-11-06 23:09:12,533 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#pp~0!base][4] could not be translated [2023-11-06 23:09:12,533 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base] could not be translated [2023-11-06 23:09:12,533 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#pp~0!base][4] could not be translated Derived loop invariant: (((((i == 0) && (pp <= 4)) && (5 <= pstate)) && (counter == 1)) || ((((pp <= 4) && (5 <= pstate)) && (1 <= i)) && (counter == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:09:12,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e96dd1f9-25a0-49bd-9013-42e600037547/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE