./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:41:03,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:41:04,100 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:41:04,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:41:04,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:41:04,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:41:04,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:41:04,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:41:04,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:41:04,156 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:41:04,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:41:04,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:41:04,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:41:04,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:41:04,161 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:41:04,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:41:04,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:41:04,163 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:41:04,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:41:04,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:41:04,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:41:04,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:41:04,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:41:04,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:41:04,166 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:41:04,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:41:04,166 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:41:04,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:41:04,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:41:04,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:41:04,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:41:04,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:41:04,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:41:04,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:41:04,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:41:04,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:41:04,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:41:04,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:41:04,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:41:04,172 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:41:04,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:41:04,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:41:04,173 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_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/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_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2023-11-23 22:41:04,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:41:04,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:41:04,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:41:04,563 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:41:04,563 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:41:04,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-11-23 22:41:07,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:41:08,006 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:41:08,006 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-11-23 22:41:08,030 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/data/706668558/1b2769e0cb0548e281a275dbf9ff82d7/FLAG093e7bac4 [2023-11-23 22:41:08,045 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/data/706668558/1b2769e0cb0548e281a275dbf9ff82d7 [2023-11-23 22:41:08,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:41:08,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:41:08,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:41:08,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:41:08,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:41:08,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8131bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08, skipping insertion in model container [2023-11-23 22:41:08,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,137 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:41:08,574 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_85253cbc-f6ab-4606-9790-a274017ad40d/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-11-23 22:41:08,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:41:08,628 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:41:08,670 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_85253cbc-f6ab-4606-9790-a274017ad40d/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-11-23 22:41:08,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:41:08,768 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:41:08,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08 WrapperNode [2023-11-23 22:41:08,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:41:08,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:41:08,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:41:08,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:41:08,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,834 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2023-11-23 22:41:08,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:41:08,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:41:08,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:41:08,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:41:08,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,854 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,896 INFO L189 HeapSplitter]: Split 37 memory accesses to 2 slices as follows [2, 35] [2023-11-23 22:41:08,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:41:08,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:41:08,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:41:08,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:41:08,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (1/1) ... [2023-11-23 22:41:08,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:41:08,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:41:09,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:41:09,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:41:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 22:41:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 22:41:09,056 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-11-23 22:41:09,056 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-11-23 22:41:09,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:41:09,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 22:41:09,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 22:41:09,057 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-11-23 22:41:09,059 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-11-23 22:41:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 22:41:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 22:41:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-23 22:41:09,061 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-23 22:41:09,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 22:41:09,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 22:41:09,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 22:41:09,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:41:09,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 22:41:09,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 22:41:09,062 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-11-23 22:41:09,063 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-11-23 22:41:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:41:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 22:41:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:41:09,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:41:09,323 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:41:09,326 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:41:09,755 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:41:09,828 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:41:09,828 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-11-23 22:41:09,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:41:09 BoogieIcfgContainer [2023-11-23 22:41:09,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:41:09,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:41:09,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:41:09,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:41:09,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:41:08" (1/3) ... [2023-11-23 22:41:09,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3961a835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:41:09, skipping insertion in model container [2023-11-23 22:41:09,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:08" (2/3) ... [2023-11-23 22:41:09,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3961a835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:41:09, skipping insertion in model container [2023-11-23 22:41:09,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:41:09" (3/3) ... [2023-11-23 22:41:09,839 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-11-23 22:41:09,855 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:41:09,855 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:41:09,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:41:09,911 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=LoopHeads, 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;@4b67ca08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:41:09,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:41:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 22:41:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 22:41:09,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:09,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:41:09,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:09,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-11-23 22:41:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877085247] [2023-11-23 22:41:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:09,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:10,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877085247] [2023-11-23 22:41:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877085247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:41:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:41:10,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:41:10,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789957727] [2023-11-23 22:41:10,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:41:10,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:41:10,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:10,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:41:10,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:41:10,118 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:41:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:10,193 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-11-23 22:41:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:41:10,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-23 22:41:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:10,204 INFO L225 Difference]: With dead ends: 210 [2023-11-23 22:41:10,205 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 22:41:10,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:41:10,213 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:10,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:41:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 22:41:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-23 22:41:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-23 22:41:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-11-23 22:41:10,262 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-11-23 22:41:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:10,263 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-11-23 22:41:10,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:41:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-11-23 22:41:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 22:41:10,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:10,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:41:10,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:41:10,266 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:10,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-11-23 22:41:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:10,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777557753] [2023-11-23 22:41:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:10,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777557753] [2023-11-23 22:41:10,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777557753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:41:10,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:41:10,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:41:10,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066957087] [2023-11-23 22:41:10,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:41:10,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:41:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:41:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:41:10,661 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:11,215 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-11-23 22:41:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:41:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-23 22:41:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:11,220 INFO L225 Difference]: With dead ends: 101 [2023-11-23 22:41:11,221 INFO L226 Difference]: Without dead ends: 98 [2023-11-23 22:41:11,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:41:11,227 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 233 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:11,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 87 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:41:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-23 22:41:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-23 22:41:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-23 22:41:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-11-23 22:41:11,268 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-11-23 22:41:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:11,270 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-11-23 22:41:11,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-11-23 22:41:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 22:41:11,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:11,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:41:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:41:11,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:11,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-11-23 22:41:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:11,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233743594] [2023-11-23 22:41:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:12,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:12,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233743594] [2023-11-23 22:41:12,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233743594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:41:12,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:41:12,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 22:41:12,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641994772] [2023-11-23 22:41:12,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:41:12,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 22:41:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:12,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 22:41:12,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:41:12,174 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:13,553 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-11-23 22:41:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:41:13,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-23 22:41:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:13,557 INFO L225 Difference]: With dead ends: 187 [2023-11-23 22:41:13,557 INFO L226 Difference]: Without dead ends: 181 [2023-11-23 22:41:13,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-11-23 22:41:13,559 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 462 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:13,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 122 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 22:41:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-23 22:41:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2023-11-23 22:41:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-23 22:41:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-11-23 22:41:13,612 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2023-11-23 22:41:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:13,613 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-11-23 22:41:13,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-11-23 22:41:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 22:41:13,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:13,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:41:13,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:41:13,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:13,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-11-23 22:41:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665525708] [2023-11-23 22:41:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:14,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665525708] [2023-11-23 22:41:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665525708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:41:14,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:41:14,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 22:41:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538188950] [2023-11-23 22:41:14,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:41:14,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 22:41:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:14,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 22:41:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:41:14,834 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:16,017 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2023-11-23 22:41:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 22:41:16,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-11-23 22:41:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:16,022 INFO L225 Difference]: With dead ends: 259 [2023-11-23 22:41:16,023 INFO L226 Difference]: Without dead ends: 256 [2023-11-23 22:41:16,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:41:16,031 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 299 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:16,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 160 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 22:41:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-23 22:41:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2023-11-23 22:41:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 218 states have internal predecessors, (255), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 22:41:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 294 transitions. [2023-11-23 22:41:16,090 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 294 transitions. Word has length 23 [2023-11-23 22:41:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:16,091 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 294 transitions. [2023-11-23 22:41:16,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2023-11-23 22:41:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 22:41:16,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:16,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:41:16,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:41:16,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:16,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-11-23 22:41:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189937359] [2023-11-23 22:41:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:16,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:17,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:17,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189937359] [2023-11-23 22:41:17,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189937359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:41:17,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:41:17,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 22:41:17,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235154765] [2023-11-23 22:41:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:41:17,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 22:41:17,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 22:41:17,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-23 22:41:17,232 INFO L87 Difference]: Start difference. First operand 238 states and 294 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:18,492 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2023-11-23 22:41:18,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 22:41:18,492 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-11-23 22:41:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:18,495 INFO L225 Difference]: With dead ends: 258 [2023-11-23 22:41:18,495 INFO L226 Difference]: Without dead ends: 255 [2023-11-23 22:41:18,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-11-23 22:41:18,496 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:18,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 160 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 22:41:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-23 22:41:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2023-11-23 22:41:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.251231527093596) internal successors, (254), 218 states have internal predecessors, (254), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 22:41:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2023-11-23 22:41:18,553 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 26 [2023-11-23 22:41:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:18,554 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2023-11-23 22:41:18,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2023-11-23 22:41:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 22:41:18,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:18,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:41:18,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:41:18,557 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:18,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-11-23 22:41:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:18,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403107249] [2023-11-23 22:41:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:18,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:19,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403107249] [2023-11-23 22:41:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403107249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:41:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:41:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 22:41:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438906281] [2023-11-23 22:41:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:41:19,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 22:41:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 22:41:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 22:41:19,804 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:21,336 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2023-11-23 22:41:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 22:41:21,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-11-23 22:41:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:21,339 INFO L225 Difference]: With dead ends: 257 [2023-11-23 22:41:21,340 INFO L226 Difference]: Without dead ends: 254 [2023-11-23 22:41:21,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-23 22:41:21,342 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 332 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:21,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 173 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-23 22:41:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-23 22:41:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2023-11-23 22:41:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 218 states have internal predecessors, (253), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 22:41:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2023-11-23 22:41:21,397 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 29 [2023-11-23 22:41:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:21,397 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2023-11-23 22:41:21,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2023-11-23 22:41:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 22:41:21,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:21,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:41:21,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:41:21,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:21,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-11-23 22:41:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:21,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562190690] [2023-11-23 22:41:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562190690] [2023-11-23 22:41:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562190690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:41:22,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:41:22,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 22:41:22,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74440343] [2023-11-23 22:41:22,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:41:22,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 22:41:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:22,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 22:41:22,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 22:41:22,685 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:24,083 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2023-11-23 22:41:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 22:41:24,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-11-23 22:41:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:24,088 INFO L225 Difference]: With dead ends: 256 [2023-11-23 22:41:24,088 INFO L226 Difference]: Without dead ends: 253 [2023-11-23 22:41:24,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-23 22:41:24,090 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 325 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:24,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 176 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 22:41:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-23 22:41:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2023-11-23 22:41:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 22:41:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2023-11-23 22:41:24,148 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 32 [2023-11-23 22:41:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:24,149 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2023-11-23 22:41:24,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2023-11-23 22:41:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 22:41:24,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:24,158 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] [2023-11-23 22:41:24,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:41:24,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:24,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-11-23 22:41:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398248833] [2023-11-23 22:41:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:24,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:41:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 22:41:25,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:25,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398248833] [2023-11-23 22:41:25,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398248833] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:41:25,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160591981] [2023-11-23 22:41:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:25,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:41:25,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:41:25,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:41:25,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:41:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:25,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-23 22:41:25,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:41:26,072 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 22:41:26,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 22:41:26,163 INFO L378 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-23 22:41:26,174 INFO L378 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-23 22:41:26,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2023-11-23 22:41:26,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:26,771 INFO L378 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 47 treesize of output 26 [2023-11-23 22:41:26,778 INFO L378 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 14 treesize of output 9 [2023-11-23 22:41:26,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-23 22:41:26,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 90 [2023-11-23 22:41:26,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2023-11-23 22:41:26,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:26,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2023-11-23 22:41:26,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-11-23 22:41:26,952 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 22:41:26,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 45 [2023-11-23 22:41:26,962 INFO L378 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 11 [2023-11-23 22:41:27,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 22:41:27,079 INFO L378 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 11 treesize of output 11 [2023-11-23 22:41:27,155 INFO L378 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-23 22:41:27,163 INFO L378 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 28 treesize of output 19 [2023-11-23 22:41:27,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:27,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-11-23 22:41:27,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:27,335 INFO L378 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 26 treesize of output 23 [2023-11-23 22:41:27,339 INFO L378 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 18 treesize of output 11 [2023-11-23 22:41:27,389 INFO L378 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-23 22:41:27,568 INFO L378 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 15 treesize of output 7 [2023-11-23 22:41:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:27,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:41:27,755 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array Int Int))) (< |c_~#gl_list~0.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_577) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)))) is different from false [2023-11-23 22:41:31,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160591981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:41:31,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:41:31,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2023-11-23 22:41:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632636969] [2023-11-23 22:41:31,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 22:41:31,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 22:41:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 22:41:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=925, Unknown=13, NotChecked=62, Total=1122 [2023-11-23 22:41:31,992 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 22:41:35,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 22:41:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:40,554 INFO L93 Difference]: Finished difference Result 442 states and 529 transitions. [2023-11-23 22:41:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-23 22:41:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2023-11-23 22:41:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:40,566 INFO L225 Difference]: With dead ends: 442 [2023-11-23 22:41:40,567 INFO L226 Difference]: Without dead ends: 439 [2023-11-23 22:41:40,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=423, Invalid=2298, Unknown=39, NotChecked=102, Total=2862 [2023-11-23 22:41:40,570 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1711 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 315 mSolverCounterUnsat, 246 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 246 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:40,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 253 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2160 Invalid, 246 Unknown, 0 Unchecked, 6.5s Time] [2023-11-23 22:41:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-23 22:41:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 327. [2023-11-23 22:41:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 282 states have (on average 1.2375886524822695) internal successors, (349), 298 states have internal predecessors, (349), 34 states have call successors, (34), 12 states have call predecessors, (34), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:41:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 399 transitions. [2023-11-23 22:41:40,658 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 399 transitions. Word has length 33 [2023-11-23 22:41:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:40,658 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 399 transitions. [2023-11-23 22:41:40,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 22:41:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 399 transitions. [2023-11-23 22:41:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 22:41:40,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:40,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:41:40,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:41:40,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:41:40,882 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:40,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1581408063, now seen corresponding path program 1 times [2023-11-23 22:41:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874293793] [2023-11-23 22:41:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:41:41,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:41,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874293793] [2023-11-23 22:41:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874293793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:41:41,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:41:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 22:41:41,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078728303] [2023-11-23 22:41:41,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:41:41,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 22:41:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:41:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 22:41:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 22:41:41,770 INFO L87 Difference]: Start difference. First operand 327 states and 399 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:41:43,578 INFO L93 Difference]: Finished difference Result 341 states and 411 transitions. [2023-11-23 22:41:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 22:41:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-11-23 22:41:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:41:43,581 INFO L225 Difference]: With dead ends: 341 [2023-11-23 22:41:43,582 INFO L226 Difference]: Without dead ends: 338 [2023-11-23 22:41:43,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-11-23 22:41:43,584 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 399 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:41:43,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 163 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-23 22:41:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-23 22:41:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 327. [2023-11-23 22:41:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 282 states have (on average 1.2340425531914894) internal successors, (348), 298 states have internal predecessors, (348), 34 states have call successors, (34), 12 states have call predecessors, (34), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:41:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 398 transitions. [2023-11-23 22:41:43,665 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 398 transitions. Word has length 35 [2023-11-23 22:41:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:41:43,666 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 398 transitions. [2023-11-23 22:41:43,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:41:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 398 transitions. [2023-11-23 22:41:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-23 22:41:43,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:41:43,668 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] [2023-11-23 22:41:43,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:41:43,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:41:43,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:41:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1738679921, now seen corresponding path program 1 times [2023-11-23 22:41:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:41:43,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970163083] [2023-11-23 22:41:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:41:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:45,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 22:41:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:41:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 22:41:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:41:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970163083] [2023-11-23 22:41:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970163083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:41:45,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130950925] [2023-11-23 22:41:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:41:45,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:41:45,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:41:45,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:41:45,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85253cbc-f6ab-4606-9790-a274017ad40d/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:41:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:41:45,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-23 22:41:45,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:41:45,719 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 22:41:45,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 22:41:45,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 22:41:45,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 22:41:46,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 90 [2023-11-23 22:41:46,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:46,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2023-11-23 22:41:46,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2023-11-23 22:41:46,333 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-23 22:41:46,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2023-11-23 22:41:46,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 22:41:46,489 INFO L378 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 11 treesize of output 11 [2023-11-23 22:41:46,581 INFO L378 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 36 treesize of output 25 [2023-11-23 22:41:46,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2023-11-23 22:41:46,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-11-23 22:41:46,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-11-23 22:41:46,706 INFO L378 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 49 treesize of output 45 [2023-11-23 22:41:46,715 INFO L378 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 36 treesize of output 32 [2023-11-23 22:41:47,138 INFO L349 Elim1Store]: treesize reduction 215, result has 4.9 percent of original size [2023-11-23 22:41:47,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 184 treesize of output 449 [2023-11-23 22:41:47,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:47,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,258 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,260 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,261 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,264 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 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 419 treesize of output 948 [2023-11-23 22:41:47,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:47,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:47,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,664 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,682 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:47,798 INFO L224 Elim1Store]: Index analysis took 218 ms [2023-11-23 22:41:47,824 INFO L349 Elim1Store]: treesize reduction 114, result has 0.9 percent of original size [2023-11-23 22:41:47,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 587 [2023-11-23 22:41:50,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:50,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:50,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:41:50,406 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 22:41:50,422 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 22:41:50,487 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse4 (select .cse5 0))) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_8))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7))) (let ((.cse3 (select .cse0 3))) (let ((.cse1 (select .cse3 0))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_20) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_21) 3 v_DerPreprocessor_22)) (.cse2 (store .cse3 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse7 (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_23) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_24) 3 v_DerPreprocessor_25)) (.cse10 (select .cse3 4))) (and (= (select .cse0 .cse1) (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_18) 3 .cse2) .cse1) (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (store .cse3 0 .cse4) .cse5) (= .cse1 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_20 (select .cse6 .cse1)) (= (select .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (= v_DerPreprocessor_22 (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_22 0))) (not (= .cse10 0)) (= .cse8 (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_25 (store (select (store (store |c_#memory_$Pointer$#1.base| 3 .cse2) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_25 0))) (= (select .cse7 .cse1) v_DerPreprocessor_23) (= .cse1 .cse10)))))))) (exists ((v_arrayElimCell_40 Int) (v_DerPreprocessor_29 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_29 v_DerPreprocessor_34) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_35) 3 v_DerPreprocessor_36))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_29 (select .cse18 v_DerPreprocessor_29)))) (let ((.cse19 (store (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9))) (let ((.cse17 (select .cse19 3))) (let ((.cse13 (select .cse17 0))) (let ((.cse14 (select .cse19 .cse13)) (.cse11 (store |c_#memory_$Pointer$#1.base| .cse13 (select .cse18 .cse13))) (.cse12 (store .cse17 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse15 (select .cse17 4))) (and (= (store (select (store (store .cse11 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse12) .cse13) (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse14) (= .cse15 .cse13) (= .cse8 (select (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_31) 3 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_32 (store .cse17 0 (select v_DerPreprocessor_32 0))) (= .cse8 (select .cse18 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_29 .cse13) (= .cse19 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse17) .cse13 .cse14)) (= (store (select (store (store (store .cse16 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 .cse4) .cse5) (= (store (select (store (store .cse11 3 .cse12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_36 0)) v_DerPreprocessor_36) (not (= .cse15 0)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse13)) (= v_DerPreprocessor_6 .cse13) (not (= v_DerPreprocessor_29 3)))))))))) (exists ((v_arrayElimCell_40 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_8))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7))) (let ((.cse20 (select .cse25 3))) (let ((.cse21 (select .cse20 0))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_15) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_16) 3 v_DerPreprocessor_17)) (.cse22 (store (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) 3 v_DerPreprocessor_14)) (.cse24 (select .cse20 4))) (and (= (store .cse20 0 .cse4) .cse5) (= .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_17 (store (store .cse20 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select v_DerPreprocessor_17 0))) (= (select .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (= (select .cse23 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (not (= .cse24 0)) (= v_DerPreprocessor_15 (select .cse23 .cse21)) (= (select .cse25 .cse21) (store v_DerPreprocessor_10 (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_12 (select .cse22 .cse21)) (= .cse21 .cse24) (= v_DerPreprocessor_14 (store (select (store .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_14 0)))))))))) (exists ((v_arrayElimCell_40 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9))) (let ((.cse32 (select .cse33 3))) (let ((.cse28 (select .cse32 0))) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| .cse28 v_DerPreprocessor_26)) (.cse31 (store .cse32 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse27 (select .cse32 4)) (.cse29 (select (store (store .cse30 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse31) .cse28)) (.cse34 (store (store (store |c_#memory_$Pointer$#1.base| .cse28 v_DerPreprocessor_41) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_42) 3 v_DerPreprocessor_43))) (and (= .cse27 .cse28) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_43 0)) v_DerPreprocessor_43) (= v_DerPreprocessor_26 .cse29) (= (store (select (store (store .cse30 3 .cse31) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_45 0)) v_DerPreprocessor_45) (not (= .cse27 0)) (= (store .cse32 0 .cse4) .cse5) (= (select .cse33 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) v_DerPreprocessor_7) (= v_DerPreprocessor_6 .cse28) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse28) (= v_DerPreprocessor_41 (select .cse34 .cse28)) (= (store .cse29 (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (select .cse33 .cse28)) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_44) 3 v_DerPreprocessor_45) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (= .cse8 (select .cse34 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))))))) (exists ((v_DerPreprocessor_33 Int) (v_arrayElimCell_40 Int) (v_DerPreprocessor_29 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_33 v_DerPreprocessor_34))) (let ((.cse43 (store (store .cse44 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_35) 3 v_DerPreprocessor_36))) (let ((.cse35 (store .cse44 v_DerPreprocessor_29 (select .cse43 v_DerPreprocessor_29)))) (let ((.cse39 (store (store (store .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9))) (let ((.cse36 (select .cse39 3))) (let ((.cse37 (select .cse36 0))) (let ((.cse40 (store |c_#memory_$Pointer$#1.base| .cse37 (select .cse43 .cse37))) (.cse41 (store .cse36 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse38 (select .cse39 .cse37)) (.cse42 (select .cse36 4))) (and (= .cse8 (select (store (store .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_31) 3 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse36) .cse37 .cse38) .cse39) (= v_DerPreprocessor_36 (store (select (store (store .cse40 3 .cse41) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_36 0))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_29)) (= (store .cse36 0 (select v_DerPreprocessor_32 0)) v_DerPreprocessor_32) (= .cse37 .cse42) (= .cse37 v_DerPreprocessor_6) (= (select .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (= .cse37 v_DerPreprocessor_33) (= (store (select (store (store .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse41) .cse37) (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse38) (= (store (select (store (store (store .cse35 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 .cse4) .cse5) (= .cse37 v_DerPreprocessor_29) (not (= v_DerPreprocessor_29 3)) (not (= .cse42 0)))))))))))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3))) is different from true [2023-11-23 22:41:50,682 INFO L190 IndexEqualityManager]: detected not equals via solver