./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu --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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:43:03,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:43:03,833 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:43:03,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:43:03,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:43:03,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:43:03,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:43:03,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:43:03,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:43:03,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:43:03,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:43:03,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:43:03,869 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:43:03,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:43:03,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:43:03,870 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:43:03,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:43:03,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:43:03,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:43:03,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:43:03,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:43:03,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:43:03,874 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:43:03,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:43:03,875 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:43:03,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:43:03,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:43:03,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:43:03,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:43:03,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:43:03,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:43:03,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:43:03,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:43:03,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:43:03,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:43:03,879 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:43:03,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:43:03,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:43:03,880 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:43:03,881 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_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/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_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2023-11-19 07:43:04,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:43:04,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:43:04,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:43:04,269 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:43:04,269 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:43:04,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-19 07:43:07,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:43:07,808 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:43:07,809 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-11-19 07:43:07,831 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/data/6ed9fcb4f/356fd0ece1fc43b1a8c9c7a268d87a44/FLAGcf1489d5a [2023-11-19 07:43:07,849 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/data/6ed9fcb4f/356fd0ece1fc43b1a8c9c7a268d87a44 [2023-11-19 07:43:07,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:43:07,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:43:07,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:07,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:43:07,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:43:07,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:43:07" (1/1) ... [2023-11-19 07:43:07,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b5962c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:07, skipping insertion in model container [2023-11-19 07:43:07,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:43:07" (1/1) ... [2023-11-19 07:43:07,938 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:43:08,341 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_e463fe46-88ba-40aa-b732-1ce035091af9/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-19 07:43:08,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:08,354 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:43:08,398 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_e463fe46-88ba-40aa-b732-1ce035091af9/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-19 07:43:08,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:08,441 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:43:08,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08 WrapperNode [2023-11-19 07:43:08,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:08,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:08,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:43:08,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:43:08,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,494 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2023-11-19 07:43:08,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:08,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:43:08,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:43:08,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:43:08,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:43:08,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:43:08,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:43:08,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:43:08,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (1/1) ... [2023-11-19 07:43:08,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:43:08,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:43:08,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:43:08,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:43:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:43:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:43:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 07:43:08,638 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 07:43:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:43:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:43:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:43:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:43:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:43:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:43:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:43:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:43:08,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:43:08,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:43:08,782 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:43:08,784 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:43:09,071 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:43:09,079 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:43:09,079 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 07:43:09,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:09 BoogieIcfgContainer [2023-11-19 07:43:09,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:43:09,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:43:09,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:43:09,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:43:09,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:43:07" (1/3) ... [2023-11-19 07:43:09,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e54161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:09, skipping insertion in model container [2023-11-19 07:43:09,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:08" (2/3) ... [2023-11-19 07:43:09,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e54161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:09, skipping insertion in model container [2023-11-19 07:43:09,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:09" (3/3) ... [2023-11-19 07:43:09,093 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2023-11-19 07:43:09,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:43:09,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:43:09,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:43:09,170 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;@77e24ed0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:43:09,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:43:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:43:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:43:09,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:09,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:09,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:09,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1237252285, now seen corresponding path program 1 times [2023-11-19 07:43:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:09,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861060172] [2023-11-19 07:43:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:09,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:43:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:09,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:43:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:43:09,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:09,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861060172] [2023-11-19 07:43:09,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861060172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:09,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:09,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:43:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965193251] [2023-11-19 07:43:09,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:09,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:43:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:09,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:43:09,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:09,757 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:43:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:09,864 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2023-11-19 07:43:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:43:09,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-19 07:43:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:09,875 INFO L225 Difference]: With dead ends: 67 [2023-11-19 07:43:09,875 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 07:43:09,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:09,882 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:09,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:43:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 07:43:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 07:43:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:43:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2023-11-19 07:43:09,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 25 [2023-11-19 07:43:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:09,925 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-19 07:43:09,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:43:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2023-11-19 07:43:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:43:09,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:09,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:09,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:43:09,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:09,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1104710801, now seen corresponding path program 1 times [2023-11-19 07:43:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194991439] [2023-11-19 07:43:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:43:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:43:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:43:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:10,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194991439] [2023-11-19 07:43:10,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194991439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:10,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:10,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:43:10,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531396151] [2023-11-19 07:43:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:10,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:43:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:10,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:43:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:10,338 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:43:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:10,450 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2023-11-19 07:43:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:43:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-11-19 07:43:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:10,454 INFO L225 Difference]: With dead ends: 56 [2023-11-19 07:43:10,454 INFO L226 Difference]: Without dead ends: 35 [2023-11-19 07:43:10,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:10,462 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:10,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:43:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-19 07:43:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-19 07:43:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:43:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-11-19 07:43:10,480 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2023-11-19 07:43:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:10,481 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-19 07:43:10,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:43:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-11-19 07:43:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 07:43:10,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:10,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-19 07:43:10,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:43:10,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:10,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -313226979, now seen corresponding path program 1 times [2023-11-19 07:43:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:10,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548021700] [2023-11-19 07:43:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:43:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:43:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:43:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:43:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548021700] [2023-11-19 07:43:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548021700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:43:10,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949102506] [2023-11-19 07:43:10,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:10,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:43:10,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:10,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:43:10,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:10,774 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:43:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:10,872 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-19 07:43:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:43:10,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-11-19 07:43:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:10,876 INFO L225 Difference]: With dead ends: 42 [2023-11-19 07:43:10,876 INFO L226 Difference]: Without dead ends: 34 [2023-11-19 07:43:10,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:10,881 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:10,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 81 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:43:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-19 07:43:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-19 07:43:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:43:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-11-19 07:43:10,896 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 35 [2023-11-19 07:43:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:10,897 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-11-19 07:43:10,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:43:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-11-19 07:43:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 07:43:10,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:10,901 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-19 07:43:10,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:43:10,901 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:10,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 415590512, now seen corresponding path program 1 times [2023-11-19 07:43:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714721487] [2023-11-19 07:43:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:10,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:43:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:15,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:43:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:43:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:43:16,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:16,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714721487] [2023-11-19 07:43:16,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714721487] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:43:16,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224348833] [2023-11-19 07:43:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:16,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:43:16,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:43:16,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:43:16,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:43:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:16,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 143 conjunts are in the unsatisfiable core [2023-11-19 07:43:16,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:43:16,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 07:43:17,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 07:43:17,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:43:17,596 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 07:43:17,602 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 17 treesize of output 21 [2023-11-19 07:43:17,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:43:17,815 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 23 treesize of output 11 [2023-11-19 07:43:17,986 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 07:43:17,986 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 66 treesize of output 57 [2023-11-19 07:43:18,006 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-19 07:43:18,422 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-11-19 07:43:18,422 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 53 [2023-11-19 07:43:18,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:18,445 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 30 treesize of output 27 [2023-11-19 07:43:18,452 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-19 07:43:18,970 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-19 07:43:18,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 41 [2023-11-19 07:43:18,977 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 7 treesize of output 3 [2023-11-19 07:43:18,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:43:18,993 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 7 treesize of output 3 [2023-11-19 07:43:19,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:19,307 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-19 07:43:19,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:19,345 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-19 07:43:19,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 78 [2023-11-19 07:43:19,377 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 07:43:19,377 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-19 07:43:19,424 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 07:43:19,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-19 07:43:20,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:20,342 INFO L349 Elim1Store]: treesize reduction 122, result has 3.9 percent of original size [2023-11-19 07:43:20,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 243 treesize of output 151 [2023-11-19 07:43:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:20,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:20,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2023-11-19 07:43:20,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2023-11-19 07:43:20,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 15 [2023-11-19 07:43:20,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-19 07:43:20,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:20,401 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-19 07:43:20,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-19 07:43:20,518 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 28 treesize of output 16 [2023-11-19 07:43:20,523 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 7 treesize of output 3 [2023-11-19 07:43:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:20,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:43:35,997 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_618 Int) (v_ArrVal_617 Int) (v_ArrVal_616 Int) (v_ArrVal_610 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_617)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_605) .cse2 v_ArrVal_607) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_610) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_615) .cse2 v_ArrVal_613) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_618)))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4) v_ArrVal_616) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_609))) .cse2 v_ArrVal_614) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2023-11-19 07:43:36,209 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| Int) (v_ArrVal_609 Int) (v_ArrVal_618 Int) (v_ArrVal_617 Int) (v_ArrVal_616 Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_628)) (.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_627))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select .cse5 .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_629) .cse0) .cse1 v_ArrVal_617)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_605) .cse2 v_ArrVal_607) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_610) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_615) .cse2 v_ArrVal_613) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (let ((.cse3 (store (select .cse4 .cse0) .cse1 v_ArrVal_618))) (store (store |c_#memory_$Pointer$.offset| .cse0 .cse3) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| (store (store (select (store .cse4 .cse0 .cse3) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10|) 4 v_ArrVal_616) 0 v_ArrVal_609))) .cse2 v_ArrVal_614) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| 1)))) is different from false [2023-11-19 07:43:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224348833] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:43:36,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:43:36,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2023-11-19 07:43:36,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098147385] [2023-11-19 07:43:36,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:43:36,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-19 07:43:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:36,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-19 07:43:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2137, Unknown=80, NotChecked=190, Total=2550 [2023-11-19 07:43:36,219 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:44:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:44:00,750 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2023-11-19 07:44:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-19 07:44:00,751 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-11-19 07:44:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:44:00,753 INFO L225 Difference]: With dead ends: 101 [2023-11-19 07:44:00,754 INFO L226 Difference]: Without dead ends: 99 [2023-11-19 07:44:00,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=459, Invalid=5925, Unknown=104, NotChecked=318, Total=6806 [2023-11-19 07:44:00,759 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 175 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:44:00,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 389 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-19 07:44:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-19 07:44:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 53. [2023-11-19 07:44:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:44:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2023-11-19 07:44:00,780 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 36 [2023-11-19 07:44:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:44:00,781 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2023-11-19 07:44:00,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:44:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2023-11-19 07:44:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 07:44:00,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:44:00,783 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-19 07:44:00,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:01,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:44:01,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:44:01,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1234028387, now seen corresponding path program 1 times [2023-11-19 07:44:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:01,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017503042] [2023-11-19 07:44:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:01,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:44:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:01,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:44:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:44:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:44:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017503042] [2023-11-19 07:44:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017503042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:01,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:01,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:44:01,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439850135] [2023-11-19 07:44:01,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:01,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:44:01,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:01,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:44:01,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:44:01,243 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:44:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:44:01,348 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2023-11-19 07:44:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:44:01,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-11-19 07:44:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:44:01,350 INFO L225 Difference]: With dead ends: 63 [2023-11-19 07:44:01,350 INFO L226 Difference]: Without dead ends: 52 [2023-11-19 07:44:01,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:44:01,352 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:44:01,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 86 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:44:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-19 07:44:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-19 07:44:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:44:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2023-11-19 07:44:01,375 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 37 [2023-11-19 07:44:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:44:01,377 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2023-11-19 07:44:01,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:44:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2023-11-19 07:44:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 07:44:01,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:44:01,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:01,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:44:01,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:44:01,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1534096253, now seen corresponding path program 2 times [2023-11-19 07:44:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:01,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962946909] [2023-11-19 07:44:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:01,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:44:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:44:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:44:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:44:01,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:01,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962946909] [2023-11-19 07:44:01,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962946909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:01,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:01,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:44:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128320676] [2023-11-19 07:44:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:01,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:44:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:01,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:44:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:44:01,641 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:44:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:44:01,742 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2023-11-19 07:44:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:44:01,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-11-19 07:44:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:44:01,748 INFO L225 Difference]: With dead ends: 64 [2023-11-19 07:44:01,748 INFO L226 Difference]: Without dead ends: 52 [2023-11-19 07:44:01,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:44:01,749 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:44:01,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 80 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:44:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-19 07:44:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-19 07:44:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:44:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2023-11-19 07:44:01,772 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 37 [2023-11-19 07:44:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:44:01,772 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2023-11-19 07:44:01,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:44:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2023-11-19 07:44:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-19 07:44:01,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:44:01,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-19 07:44:01,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:44:01,775 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:44:01,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1547967990, now seen corresponding path program 1 times [2023-11-19 07:44:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432108328] [2023-11-19 07:44:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:02,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:44:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:44:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:44:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:44:02,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:02,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432108328] [2023-11-19 07:44:02,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432108328] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:44:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890077636] [2023-11-19 07:44:02,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:02,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:44:02,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:02,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:44:02,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:44:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:02,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-19 07:44:02,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:44:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:44:02,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:44:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:44:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890077636] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:44:02,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:44:02,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-19 07:44:02,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132875674] [2023-11-19 07:44:02,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:44:02,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:44:02,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:44:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:44:02,412 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:44:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:44:02,606 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2023-11-19 07:44:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:44:02,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-11-19 07:44:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:44:02,608 INFO L225 Difference]: With dead ends: 62 [2023-11-19 07:44:02,608 INFO L226 Difference]: Without dead ends: 53 [2023-11-19 07:44:02,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:44:02,609 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:44:02,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 120 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:44:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-19 07:44:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-11-19 07:44:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:44:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-11-19 07:44:02,633 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 38 [2023-11-19 07:44:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:44:02,634 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-11-19 07:44:02,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:44:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-11-19 07:44:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-19 07:44:02,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:44:02,636 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-19 07:44:02,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:02,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 07:44:02,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:44:02,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1605226292, now seen corresponding path program 1 times [2023-11-19 07:44:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980911294] [2023-11-19 07:44:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:44:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:44:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:44:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:44:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980911294] [2023-11-19 07:44:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980911294] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:44:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020311705] [2023-11-19 07:44:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:03,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:44:03,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:03,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:44:03,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e463fe46-88ba-40aa-b732-1ce035091af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:44:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:03,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-19 07:44:03,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:44:03,771 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 8 treesize of output 4 [2023-11-19 07:44:03,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:44:03,867 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 17 treesize of output 12 [2023-11-19 07:44:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:44:04,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:44:04,170 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array Int Int)) (|v_node_create_~temp~0#1.base_19| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_1414) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_19| 1)))) is different from false [2023-11-19 07:44:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020311705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:44:04,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:44:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2023-11-19 07:44:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399408485] [2023-11-19 07:44:04,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:44:04,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-19 07:44:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:04,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-19 07:44:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=531, Unknown=3, NotChecked=46, Total=650 [2023-11-19 07:44:04,174 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 22 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)