./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:02:40,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:02:40,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:02:40,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:02:40,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:02:40,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:02:40,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:02:40,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:02:40,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:02:40,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:02:40,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:02:40,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:02:40,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:02:40,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:02:40,955 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:02:40,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:02:40,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:02:40,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:02:40,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:02:40,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:02:40,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:02:40,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:02:40,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:02:40,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:02:40,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:02:40,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:02:40,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:02:40,963 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:02:40,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:02:40,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:02:40,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:02:40,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:02:40,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:02:40,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:02:40,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:02:40,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:02:40,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:02:40,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:02:40,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:02:40,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:02:40,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:02:40,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:02:40,968 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d [2024-10-11 05:02:41,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:02:41,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:02:41,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:02:41,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:02:41,204 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:02:41,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2024-10-11 05:02:42,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:02:42,851 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:02:42,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2024-10-11 05:02:42,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ea6267554/94c9b0e2e60a44cf98ebf8934e9dcd68/FLAG5a89878c8 [2024-10-11 05:02:42,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ea6267554/94c9b0e2e60a44cf98ebf8934e9dcd68 [2024-10-11 05:02:42,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:02:42,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:02:42,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:02:42,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:02:42,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:02:42,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:42" (1/1) ... [2024-10-11 05:02:42,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d3e4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:42, skipping insertion in model container [2024-10-11 05:02:42,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:42" (1/1) ... [2024-10-11 05:02:42,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:02:43,126 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2024-10-11 05:02:43,174 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2024-10-11 05:02:43,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:02:43,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:02:43,228 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2024-10-11 05:02:43,246 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2024-10-11 05:02:43,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:02:43,293 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:02:43,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43 WrapperNode [2024-10-11 05:02:43,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:02:43,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:02:43,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:02:43,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:02:43,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,342 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 474 [2024-10-11 05:02:43,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:02:43,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:02:43,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:02:43,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:02:43,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,373 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:02:43,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:02:43,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:02:43,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:02:43,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:02:43,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (1/1) ... [2024-10-11 05:02:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:02:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:02:43,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:02:43,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:02:43,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:02:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:02:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:02:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:02:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:02:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:02:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:02:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:02:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:02:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:02:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:02:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:02:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:02:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:02:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:02:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:02:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:02:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:02:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:02:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:02:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:02:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:02:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:02:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:02:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:02:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:02:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:02:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:02:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:02:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:02:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:02:43,491 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:02:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:02:43,491 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:02:43,597 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:02:43,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:02:44,224 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-11 05:02:44,225 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:02:44,283 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:02:44,283 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-11 05:02:44,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:44 BoogieIcfgContainer [2024-10-11 05:02:44,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:02:44,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:02:44,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:02:44,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:02:44,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:02:42" (1/3) ... [2024-10-11 05:02:44,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ce84bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:44, skipping insertion in model container [2024-10-11 05:02:44,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:43" (2/3) ... [2024-10-11 05:02:44,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ce84bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:44, skipping insertion in model container [2024-10-11 05:02:44,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:44" (3/3) ... [2024-10-11 05:02:44,295 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2024-10-11 05:02:44,311 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:02:44,311 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:02:44,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:02:44,401 INFO L333 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, 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;@33d51caa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:02:44,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:02:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 167 states have (on average 1.6467065868263473) internal successors, (275), 175 states have internal predecessors, (275), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 05:02:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:02:44,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:44,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:44,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2083918704, now seen corresponding path program 1 times [2024-10-11 05:02:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149563923] [2024-10-11 05:02:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:02:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:02:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:44,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:02:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:02:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:02:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:44,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:44,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149563923] [2024-10-11 05:02:44,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149563923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:44,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:44,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:02:44,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003850690] [2024-10-11 05:02:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:02:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:02:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:02:44,888 INFO L87 Difference]: Start difference. First operand has 217 states, 167 states have (on average 1.6467065868263473) internal successors, (275), 175 states have internal predecessors, (275), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:02:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:45,574 INFO L93 Difference]: Finished difference Result 437 states and 682 transitions. [2024-10-11 05:02:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:02:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:02:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:45,595 INFO L225 Difference]: With dead ends: 437 [2024-10-11 05:02:45,595 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 05:02:45,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:45,608 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 433 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:45,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 518 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:02:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 05:02:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2024-10-11 05:02:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 164 states have (on average 1.5182926829268293) internal successors, (249), 169 states have internal predecessors, (249), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 05:02:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 309 transitions. [2024-10-11 05:02:45,718 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 309 transitions. Word has length 58 [2024-10-11 05:02:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:45,719 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 309 transitions. [2024-10-11 05:02:45,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:02:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 309 transitions. [2024-10-11 05:02:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:02:45,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:45,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:02:45,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:45,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash -182462482, now seen corresponding path program 1 times [2024-10-11 05:02:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338499485] [2024-10-11 05:02:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:45,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:02:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:45,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:02:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:02:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:45,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:02:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:02:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:45,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:45,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338499485] [2024-10-11 05:02:45,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338499485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:45,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:45,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:02:45,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854286924] [2024-10-11 05:02:45,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:45,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:02:45,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:02:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:02:45,985 INFO L87 Difference]: Start difference. First operand 211 states and 309 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:02:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:46,828 INFO L93 Difference]: Finished difference Result 417 states and 606 transitions. [2024-10-11 05:02:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:02:46,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:02:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:46,833 INFO L225 Difference]: With dead ends: 417 [2024-10-11 05:02:46,833 INFO L226 Difference]: Without dead ends: 336 [2024-10-11 05:02:46,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:02:46,835 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 433 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:46,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 814 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:02:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-11 05:02:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 299. [2024-10-11 05:02:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 232 states have (on average 1.4870689655172413) internal successors, (345), 239 states have internal predecessors, (345), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2024-10-11 05:02:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 432 transitions. [2024-10-11 05:02:46,901 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 432 transitions. Word has length 58 [2024-10-11 05:02:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:46,902 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 432 transitions. [2024-10-11 05:02:46,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:02:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 432 transitions. [2024-10-11 05:02:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:02:46,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:46,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:46,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:02:46,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -316696146, now seen corresponding path program 1 times [2024-10-11 05:02:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110140498] [2024-10-11 05:02:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:02:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:02:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:47,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:02:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:02:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:47,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:02:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:47,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:47,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110140498] [2024-10-11 05:02:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110140498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:02:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667959972] [2024-10-11 05:02:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:47,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:02:47,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:47,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:02:47,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:02:47,118 INFO L87 Difference]: Start difference. First operand 299 states and 432 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:02:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:47,850 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2024-10-11 05:02:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:02:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 05:02:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:47,857 INFO L225 Difference]: With dead ends: 493 [2024-10-11 05:02:47,857 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 05:02:47,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:02:47,859 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 344 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:47,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1025 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:02:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 05:02:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 303. [2024-10-11 05:02:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.476595744680851) internal successors, (347), 242 states have internal predecessors, (347), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2024-10-11 05:02:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 435 transitions. [2024-10-11 05:02:47,911 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 435 transitions. Word has length 58 [2024-10-11 05:02:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:47,912 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 435 transitions. [2024-10-11 05:02:47,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:02:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 435 transitions. [2024-10-11 05:02:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:02:47,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:47,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:47,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:02:47,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:47,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:47,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1734287852, now seen corresponding path program 1 times [2024-10-11 05:02:47,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:47,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797042559] [2024-10-11 05:02:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:47,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:02:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:02:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:02:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:02:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:02:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:48,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:48,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797042559] [2024-10-11 05:02:48,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797042559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:48,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:48,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:02:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920405256] [2024-10-11 05:02:48,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:48,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:02:48,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:48,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:02:48,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:02:48,096 INFO L87 Difference]: Start difference. First operand 303 states and 435 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:02:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:49,809 INFO L93 Difference]: Finished difference Result 1136 states and 1586 transitions. [2024-10-11 05:02:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:02:49,810 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-11 05:02:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:49,817 INFO L225 Difference]: With dead ends: 1136 [2024-10-11 05:02:49,817 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 05:02:49,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 05:02:49,820 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1791 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:49,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 1336 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:02:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 05:02:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 841. [2024-10-11 05:02:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 654 states have (on average 1.4051987767584098) internal successors, (919), 669 states have internal predecessors, (919), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2024-10-11 05:02:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1133 transitions. [2024-10-11 05:02:49,915 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1133 transitions. Word has length 58 [2024-10-11 05:02:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:49,915 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1133 transitions. [2024-10-11 05:02:49,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:02:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1133 transitions. [2024-10-11 05:02:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:02:49,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:49,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:49,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:02:49,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:49,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1696915276, now seen corresponding path program 1 times [2024-10-11 05:02:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475734056] [2024-10-11 05:02:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:49,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:49,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:02:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:02:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:50,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:02:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:50,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:02:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:02:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:50,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:50,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475734056] [2024-10-11 05:02:50,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475734056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:50,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:50,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:02:50,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720316256] [2024-10-11 05:02:50,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:50,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:02:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:02:50,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:02:50,086 INFO L87 Difference]: Start difference. First operand 841 states and 1133 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:02:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:50,860 INFO L93 Difference]: Finished difference Result 1651 states and 2205 transitions. [2024-10-11 05:02:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:02:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-11 05:02:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:50,896 INFO L225 Difference]: With dead ends: 1651 [2024-10-11 05:02:50,897 INFO L226 Difference]: Without dead ends: 941 [2024-10-11 05:02:50,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:02:50,899 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 236 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:50,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1144 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:02:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-11 05:02:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 857. [2024-10-11 05:02:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 666 states have (on average 1.3903903903903905) internal successors, (926), 681 states have internal predecessors, (926), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2024-10-11 05:02:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1144 transitions. [2024-10-11 05:02:50,982 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1144 transitions. Word has length 59 [2024-10-11 05:02:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:50,983 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1144 transitions. [2024-10-11 05:02:50,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:02:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1144 transitions. [2024-10-11 05:02:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:02:50,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:50,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:50,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:02:50,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:50,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash 226312758, now seen corresponding path program 1 times [2024-10-11 05:02:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:50,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083132884] [2024-10-11 05:02:50,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:50,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:02:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:02:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:02:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:02:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:02:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083132884] [2024-10-11 05:02:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083132884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:51,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:51,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:02:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57615593] [2024-10-11 05:02:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:02:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:02:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:02:51,149 INFO L87 Difference]: Start difference. First operand 857 states and 1144 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:02:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:52,058 INFO L93 Difference]: Finished difference Result 2297 states and 2963 transitions. [2024-10-11 05:02:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:02:52,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-11 05:02:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:52,068 INFO L225 Difference]: With dead ends: 2297 [2024-10-11 05:02:52,068 INFO L226 Difference]: Without dead ends: 1572 [2024-10-11 05:02:52,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:02:52,074 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 749 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:52,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 718 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:02:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-10-11 05:02:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1270. [2024-10-11 05:02:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 984 states have (on average 1.3617886178861789) internal successors, (1340), 1008 states have internal predecessors, (1340), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2024-10-11 05:02:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1676 transitions. [2024-10-11 05:02:52,242 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1676 transitions. Word has length 59 [2024-10-11 05:02:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1676 transitions. [2024-10-11 05:02:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:02:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1676 transitions. [2024-10-11 05:02:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:02:52,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:52,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:52,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:02:52,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:52,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 445167476, now seen corresponding path program 1 times [2024-10-11 05:02:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272091782] [2024-10-11 05:02:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:52,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:52,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:52,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:02:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:02:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:02:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:02:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:02:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:52,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:52,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272091782] [2024-10-11 05:02:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272091782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:52,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:52,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:52,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969527846] [2024-10-11 05:02:52,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:52,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:52,350 INFO L87 Difference]: Start difference. First operand 1270 states and 1676 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:02:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:53,082 INFO L93 Difference]: Finished difference Result 3541 states and 4615 transitions. [2024-10-11 05:02:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:02:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-11 05:02:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:53,098 INFO L225 Difference]: With dead ends: 3541 [2024-10-11 05:02:53,098 INFO L226 Difference]: Without dead ends: 2405 [2024-10-11 05:02:53,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:02:53,104 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 585 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:53,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 685 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:02:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2024-10-11 05:02:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2301. [2024-10-11 05:02:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 1755 states have (on average 1.3071225071225072) internal successors, (2294), 1800 states have internal predecessors, (2294), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2024-10-11 05:02:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 2962 transitions. [2024-10-11 05:02:53,337 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 2962 transitions. Word has length 59 [2024-10-11 05:02:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:53,338 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 2962 transitions. [2024-10-11 05:02:53,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:02:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2962 transitions. [2024-10-11 05:02:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:02:53,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:53,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-10-11 05:02:53,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:02:53,340 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:53,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1598525080, now seen corresponding path program 1 times [2024-10-11 05:02:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:53,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592062697] [2024-10-11 05:02:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:53,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:02:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:53,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:02:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:02:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:02:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:53,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:02:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592062697] [2024-10-11 05:02:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592062697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:53,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:02:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078179526] [2024-10-11 05:02:53,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:53,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:02:53,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:53,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:02:53,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:02:53,426 INFO L87 Difference]: Start difference. First operand 2301 states and 2962 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:02:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:54,262 INFO L93 Difference]: Finished difference Result 5359 states and 6872 transitions. [2024-10-11 05:02:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:02:54,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-11 05:02:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:54,283 INFO L225 Difference]: With dead ends: 5359 [2024-10-11 05:02:54,284 INFO L226 Difference]: Without dead ends: 3192 [2024-10-11 05:02:54,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:54,290 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 551 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:54,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 549 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:02:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2024-10-11 05:02:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 2948. [2024-10-11 05:02:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2245 states have (on average 1.2966592427616928) internal successors, (2911), 2296 states have internal predecessors, (2911), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2024-10-11 05:02:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3751 transitions. [2024-10-11 05:02:54,588 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3751 transitions. Word has length 60 [2024-10-11 05:02:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 2948 states and 3751 transitions. [2024-10-11 05:02:54,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:02:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3751 transitions. [2024-10-11 05:02:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 05:02:54,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:54,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:54,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:02:54,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:54,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash -713989047, now seen corresponding path program 1 times [2024-10-11 05:02:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:54,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144669745] [2024-10-11 05:02:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:54,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:02:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:54,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:02:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:02:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144669745] [2024-10-11 05:02:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144669745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:54,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:54,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:02:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794798915] [2024-10-11 05:02:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:54,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:02:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:02:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:02:54,658 INFO L87 Difference]: Start difference. First operand 2948 states and 3751 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:55,445 INFO L93 Difference]: Finished difference Result 3097 states and 3984 transitions. [2024-10-11 05:02:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:02:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-11 05:02:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:55,460 INFO L225 Difference]: With dead ends: 3097 [2024-10-11 05:02:55,461 INFO L226 Difference]: Without dead ends: 2978 [2024-10-11 05:02:55,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:02:55,465 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 379 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:55,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 455 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:02:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2024-10-11 05:02:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2948. [2024-10-11 05:02:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2245 states have (on average 1.2962138084632517) internal successors, (2910), 2296 states have internal predecessors, (2910), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2024-10-11 05:02:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3750 transitions. [2024-10-11 05:02:55,931 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3750 transitions. Word has length 62 [2024-10-11 05:02:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 2948 states and 3750 transitions. [2024-10-11 05:02:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3750 transitions. [2024-10-11 05:02:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 05:02:55,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:55,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:55,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:02:55,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -754663797, now seen corresponding path program 1 times [2024-10-11 05:02:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584372711] [2024-10-11 05:02:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:02:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:02:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:02:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584372711] [2024-10-11 05:02:56,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584372711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:56,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:56,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:02:56,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531592362] [2024-10-11 05:02:56,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:56,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:02:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:02:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:02:56,034 INFO L87 Difference]: Start difference. First operand 2948 states and 3750 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:57,103 INFO L93 Difference]: Finished difference Result 3237 states and 4200 transitions. [2024-10-11 05:02:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:02:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-11 05:02:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:57,120 INFO L225 Difference]: With dead ends: 3237 [2024-10-11 05:02:57,120 INFO L226 Difference]: Without dead ends: 3122 [2024-10-11 05:02:57,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:02:57,122 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 605 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:57,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 592 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:02:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2024-10-11 05:02:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3061. [2024-10-11 05:02:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 2340 states have (on average 1.3068376068376069) internal successors, (3058), 2392 states have internal predecessors, (3058), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2024-10-11 05:02:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 3923 transitions. [2024-10-11 05:02:57,517 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 3923 transitions. Word has length 62 [2024-10-11 05:02:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:57,517 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 3923 transitions. [2024-10-11 05:02:57,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3923 transitions. [2024-10-11 05:02:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 05:02:57,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:57,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:57,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:02:57,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:57,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1511717389, now seen corresponding path program 1 times [2024-10-11 05:02:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375677344] [2024-10-11 05:02:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:02:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:02:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:02:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:57,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:57,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375677344] [2024-10-11 05:02:57,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375677344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:57,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:57,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255628782] [2024-10-11 05:02:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:57,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:57,636 INFO L87 Difference]: Start difference. First operand 3061 states and 3923 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:02:59,009 INFO L93 Difference]: Finished difference Result 3492 states and 4586 transitions. [2024-10-11 05:02:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:02:59,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-11 05:02:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:02:59,026 INFO L225 Difference]: With dead ends: 3492 [2024-10-11 05:02:59,026 INFO L226 Difference]: Without dead ends: 3264 [2024-10-11 05:02:59,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:02:59,029 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 608 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:02:59,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 988 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:02:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2024-10-11 05:02:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3167. [2024-10-11 05:02:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2428 states have (on average 1.314662273476112) internal successors, (3192), 2481 states have internal predecessors, (3192), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2024-10-11 05:02:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4081 transitions. [2024-10-11 05:02:59,417 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4081 transitions. Word has length 62 [2024-10-11 05:02:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:02:59,418 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 4081 transitions. [2024-10-11 05:02:59,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:02:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4081 transitions. [2024-10-11 05:02:59,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 05:02:59,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:02:59,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:02:59,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:02:59,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:02:59,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:02:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1030637131, now seen corresponding path program 1 times [2024-10-11 05:02:59,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:02:59,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628504348] [2024-10-11 05:02:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:02:59,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:02:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:59,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:02:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:59,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:02:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:02:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:02:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:59,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:02:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:02:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:02:59,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:02:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628504348] [2024-10-11 05:02:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628504348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:02:59,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:02:59,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:02:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052224313] [2024-10-11 05:02:59,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:02:59,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:02:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:02:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:02:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:02:59,537 INFO L87 Difference]: Start difference. First operand 3167 states and 4081 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:00,841 INFO L93 Difference]: Finished difference Result 3928 states and 5248 transitions. [2024-10-11 05:03:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:00,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-11 05:03:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:00,860 INFO L225 Difference]: With dead ends: 3928 [2024-10-11 05:03:00,860 INFO L226 Difference]: Without dead ends: 3594 [2024-10-11 05:03:00,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:00,863 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 622 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:00,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 979 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:03:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2024-10-11 05:03:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3379. [2024-10-11 05:03:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3379 states, 2606 states have (on average 1.329623944742901) internal successors, (3465), 2661 states have internal predecessors, (3465), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2024-10-11 05:03:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 4402 transitions. [2024-10-11 05:03:01,247 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 4402 transitions. Word has length 62 [2024-10-11 05:03:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:01,248 INFO L471 AbstractCegarLoop]: Abstraction has 3379 states and 4402 transitions. [2024-10-11 05:03:01,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 4402 transitions. [2024-10-11 05:03:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 05:03:01,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:01,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:01,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:03:01,252 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:01,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1325168119, now seen corresponding path program 1 times [2024-10-11 05:03:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961779733] [2024-10-11 05:03:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:01,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:01,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961779733] [2024-10-11 05:03:01,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961779733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:01,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:01,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:01,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177722457] [2024-10-11 05:03:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:01,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:01,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:01,378 INFO L87 Difference]: Start difference. First operand 3379 states and 4402 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:02,683 INFO L93 Difference]: Finished difference Result 4662 states and 6359 transitions. [2024-10-11 05:03:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:02,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-11 05:03:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:02,702 INFO L225 Difference]: With dead ends: 4662 [2024-10-11 05:03:02,702 INFO L226 Difference]: Without dead ends: 4116 [2024-10-11 05:03:02,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:02,706 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 649 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:02,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 975 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:03:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2024-10-11 05:03:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 3760. [2024-10-11 05:03:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2921 states have (on average 1.3478260869565217) internal successors, (3937), 2980 states have internal predecessors, (3937), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2024-10-11 05:03:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 4972 transitions. [2024-10-11 05:03:03,144 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 4972 transitions. Word has length 62 [2024-10-11 05:03:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:03,145 INFO L471 AbstractCegarLoop]: Abstraction has 3760 states and 4972 transitions. [2024-10-11 05:03:03,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4972 transitions. [2024-10-11 05:03:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 05:03:03,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:03,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:03,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:03:03,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:03,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1678256501, now seen corresponding path program 1 times [2024-10-11 05:03:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:03,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270683480] [2024-10-11 05:03:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:03,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270683480] [2024-10-11 05:03:03,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270683480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:03,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:03,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:03,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388332950] [2024-10-11 05:03:03,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:03,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:03,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:03,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:03,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:03,262 INFO L87 Difference]: Start difference. First operand 3760 states and 4972 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:04,136 INFO L93 Difference]: Finished difference Result 4900 states and 6722 transitions. [2024-10-11 05:03:04,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:04,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-11 05:03:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:04,153 INFO L225 Difference]: With dead ends: 4900 [2024-10-11 05:03:04,154 INFO L226 Difference]: Without dead ends: 3973 [2024-10-11 05:03:04,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:04,159 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 514 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:04,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 601 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2024-10-11 05:03:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3760. [2024-10-11 05:03:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2921 states have (on average 1.344744950359466) internal successors, (3928), 2980 states have internal predecessors, (3928), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2024-10-11 05:03:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 4963 transitions. [2024-10-11 05:03:04,623 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 4963 transitions. Word has length 62 [2024-10-11 05:03:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 3760 states and 4963 transitions. [2024-10-11 05:03:04,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4963 transitions. [2024-10-11 05:03:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 05:03:04,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:04,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:04,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:03:04,626 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:04,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash 250016201, now seen corresponding path program 1 times [2024-10-11 05:03:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:04,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787204174] [2024-10-11 05:03:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:04,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787204174] [2024-10-11 05:03:04,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787204174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:04,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926607542] [2024-10-11 05:03:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:04,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:04,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:04,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:04,710 INFO L87 Difference]: Start difference. First operand 3760 states and 4963 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:05,540 INFO L93 Difference]: Finished difference Result 4897 states and 6701 transitions. [2024-10-11 05:03:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-11 05:03:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:05,564 INFO L225 Difference]: With dead ends: 4897 [2024-10-11 05:03:05,564 INFO L226 Difference]: Without dead ends: 3971 [2024-10-11 05:03:05,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:05,572 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 231 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:05,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 700 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2024-10-11 05:03:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3778. [2024-10-11 05:03:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3778 states, 2939 states have (on average 1.3426335488261314) internal successors, (3946), 2998 states have internal predecessors, (3946), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2024-10-11 05:03:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 4981 transitions. [2024-10-11 05:03:06,087 INFO L78 Accepts]: Start accepts. Automaton has 3778 states and 4981 transitions. Word has length 62 [2024-10-11 05:03:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:06,089 INFO L471 AbstractCegarLoop]: Abstraction has 3778 states and 4981 transitions. [2024-10-11 05:03:06,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 4981 transitions. [2024-10-11 05:03:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 05:03:06,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:06,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:06,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:03:06,092 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:06,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -779343097, now seen corresponding path program 1 times [2024-10-11 05:03:06,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:06,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893080501] [2024-10-11 05:03:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893080501] [2024-10-11 05:03:06,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893080501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:06,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:06,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862823670] [2024-10-11 05:03:06,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:06,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:06,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:06,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:06,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:06,245 INFO L87 Difference]: Start difference. First operand 3778 states and 4981 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:07,997 INFO L93 Difference]: Finished difference Result 7010 states and 9947 transitions. [2024-10-11 05:03:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:03:07,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-11 05:03:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:08,027 INFO L225 Difference]: With dead ends: 7010 [2024-10-11 05:03:08,027 INFO L226 Difference]: Without dead ends: 6066 [2024-10-11 05:03:08,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:03:08,036 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1292 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:08,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 777 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2024-10-11 05:03:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 5544. [2024-10-11 05:03:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4393 states have (on average 1.3792396995219667) internal successors, (6059), 4483 states have internal predecessors, (6059), 610 states have call successors, (610), 446 states have call predecessors, (610), 539 states have return successors, (908), 624 states have call predecessors, (908), 606 states have call successors, (908) [2024-10-11 05:03:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7577 transitions. [2024-10-11 05:03:08,591 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7577 transitions. Word has length 62 [2024-10-11 05:03:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:08,591 INFO L471 AbstractCegarLoop]: Abstraction has 5544 states and 7577 transitions. [2024-10-11 05:03:08,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:03:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7577 transitions. [2024-10-11 05:03:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 05:03:08,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:08,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:08,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:03:08,595 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:08,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1532828887, now seen corresponding path program 1 times [2024-10-11 05:03:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:08,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9421325] [2024-10-11 05:03:08,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:08,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:08,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:08,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9421325] [2024-10-11 05:03:08,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9421325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:08,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:08,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522398961] [2024-10-11 05:03:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:08,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:08,715 INFO L87 Difference]: Start difference. First operand 5544 states and 7577 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:09,866 INFO L93 Difference]: Finished difference Result 8847 states and 11724 transitions. [2024-10-11 05:03:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:09,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-11 05:03:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:09,889 INFO L225 Difference]: With dead ends: 8847 [2024-10-11 05:03:09,890 INFO L226 Difference]: Without dead ends: 6031 [2024-10-11 05:03:09,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:09,898 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 544 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:09,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 611 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2024-10-11 05:03:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 5802. [2024-10-11 05:03:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5802 states, 4593 states have (on average 1.3720879599390376) internal successors, (6302), 4686 states have internal predecessors, (6302), 638 states have call successors, (638), 471 states have call predecessors, (638), 569 states have return successors, (942), 654 states have call predecessors, (942), 634 states have call successors, (942) [2024-10-11 05:03:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5802 states to 5802 states and 7882 transitions. [2024-10-11 05:03:10,520 INFO L78 Accepts]: Start accepts. Automaton has 5802 states and 7882 transitions. Word has length 66 [2024-10-11 05:03:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:10,521 INFO L471 AbstractCegarLoop]: Abstraction has 5802 states and 7882 transitions. [2024-10-11 05:03:10,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5802 states and 7882 transitions. [2024-10-11 05:03:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 05:03:10,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:10,523 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:10,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:03:10,524 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -243171438, now seen corresponding path program 1 times [2024-10-11 05:03:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224347152] [2024-10-11 05:03:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:10,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:10,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224347152] [2024-10-11 05:03:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224347152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:10,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582230311] [2024-10-11 05:03:10,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:10,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:10,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:10,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:10,600 INFO L87 Difference]: Start difference. First operand 5802 states and 7882 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:12,115 INFO L93 Difference]: Finished difference Result 6778 states and 9071 transitions. [2024-10-11 05:03:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:03:12,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-11 05:03:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:12,141 INFO L225 Difference]: With dead ends: 6778 [2024-10-11 05:03:12,141 INFO L226 Difference]: Without dead ends: 6775 [2024-10-11 05:03:12,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:12,145 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 979 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:12,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 461 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6775 states. [2024-10-11 05:03:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6775 to 6491. [2024-10-11 05:03:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6491 states, 5103 states have (on average 1.358612580834803) internal successors, (6933), 5203 states have internal predecessors, (6933), 721 states have call successors, (721), 543 states have call predecessors, (721), 665 states have return successors, (1070), 754 states have call predecessors, (1070), 718 states have call successors, (1070) [2024-10-11 05:03:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 8724 transitions. [2024-10-11 05:03:12,965 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 8724 transitions. Word has length 67 [2024-10-11 05:03:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:12,965 INFO L471 AbstractCegarLoop]: Abstraction has 6491 states and 8724 transitions. [2024-10-11 05:03:12,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 8724 transitions. [2024-10-11 05:03:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 05:03:12,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:12,968 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:12,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:03:12,968 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1050889345, now seen corresponding path program 1 times [2024-10-11 05:03:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318914613] [2024-10-11 05:03:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318914613] [2024-10-11 05:03:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318914613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94438111] [2024-10-11 05:03:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:13,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:13,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:03:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:03:13,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:13,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:03:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94438111] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:03:13,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:03:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-11 05:03:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849548191] [2024-10-11 05:03:13,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:03:13,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:03:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:13,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:03:13,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:13,583 INFO L87 Difference]: Start difference. First operand 6491 states and 8724 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:03:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:16,331 INFO L93 Difference]: Finished difference Result 10556 states and 13744 transitions. [2024-10-11 05:03:16,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 05:03:16,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-11 05:03:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:16,363 INFO L225 Difference]: With dead ends: 10556 [2024-10-11 05:03:16,363 INFO L226 Difference]: Without dead ends: 10553 [2024-10-11 05:03:16,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-11 05:03:16,367 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 1194 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:16,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1008 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:03:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10553 states. [2024-10-11 05:03:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10553 to 9742. [2024-10-11 05:03:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9742 states, 7580 states have (on average 1.3269129287598944) internal successors, (10058), 7731 states have internal predecessors, (10058), 1091 states have call successors, (1091), 868 states have call predecessors, (1091), 1069 states have return successors, (1616), 1152 states have call predecessors, (1616), 1088 states have call successors, (1616) [2024-10-11 05:03:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9742 states to 9742 states and 12765 transitions. [2024-10-11 05:03:17,715 INFO L78 Accepts]: Start accepts. Automaton has 9742 states and 12765 transitions. Word has length 68 [2024-10-11 05:03:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:17,715 INFO L471 AbstractCegarLoop]: Abstraction has 9742 states and 12765 transitions. [2024-10-11 05:03:17,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:03:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9742 states and 12765 transitions. [2024-10-11 05:03:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:17,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:17,719 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:17,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:03:17,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:17,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:17,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash 104005074, now seen corresponding path program 2 times [2024-10-11 05:03:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:17,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960471519] [2024-10-11 05:03:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960471519] [2024-10-11 05:03:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960471519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025008370] [2024-10-11 05:03:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:17,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:17,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:17,995 INFO L87 Difference]: Start difference. First operand 9742 states and 12765 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:19,150 INFO L93 Difference]: Finished difference Result 12511 states and 16249 transitions. [2024-10-11 05:03:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:03:19,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-11 05:03:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:19,175 INFO L225 Difference]: With dead ends: 12511 [2024-10-11 05:03:19,175 INFO L226 Difference]: Without dead ends: 6299 [2024-10-11 05:03:19,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:19,188 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 499 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:19,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 646 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6299 states. [2024-10-11 05:03:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6299 to 5345. [2024-10-11 05:03:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5345 states, 4249 states have (on average 1.364321016709814) internal successors, (5797), 4322 states have internal predecessors, (5797), 591 states have call successors, (591), 433 states have call predecessors, (591), 503 states have return successors, (842), 599 states have call predecessors, (842), 588 states have call successors, (842) [2024-10-11 05:03:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5345 states to 5345 states and 7230 transitions. [2024-10-11 05:03:19,785 INFO L78 Accepts]: Start accepts. Automaton has 5345 states and 7230 transitions. Word has length 71 [2024-10-11 05:03:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:19,786 INFO L471 AbstractCegarLoop]: Abstraction has 5345 states and 7230 transitions. [2024-10-11 05:03:19,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5345 states and 7230 transitions. [2024-10-11 05:03:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:03:19,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:19,789 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:19,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:03:19,790 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:19,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:19,790 INFO L85 PathProgramCache]: Analyzing trace with hash 178274904, now seen corresponding path program 1 times [2024-10-11 05:03:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:19,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178169988] [2024-10-11 05:03:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:19,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:03:19,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178169988] [2024-10-11 05:03:19,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178169988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:19,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:19,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136263881] [2024-10-11 05:03:19,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:19,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:19,890 INFO L87 Difference]: Start difference. First operand 5345 states and 7230 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:21,335 INFO L93 Difference]: Finished difference Result 10612 states and 13697 transitions. [2024-10-11 05:03:21,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 05:03:21,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-11 05:03:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:21,366 INFO L225 Difference]: With dead ends: 10612 [2024-10-11 05:03:21,366 INFO L226 Difference]: Without dead ends: 7127 [2024-10-11 05:03:21,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-11 05:03:21,379 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1025 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:21,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 759 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7127 states. [2024-10-11 05:03:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7127 to 6896. [2024-10-11 05:03:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6896 states, 5397 states have (on average 1.3255512321660181) internal successors, (7154), 5507 states have internal predecessors, (7154), 775 states have call successors, (775), 591 states have call predecessors, (775), 722 states have return successors, (1163), 807 states have call predecessors, (1163), 772 states have call successors, (1163) [2024-10-11 05:03:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 9092 transitions. [2024-10-11 05:03:22,244 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 9092 transitions. Word has length 76 [2024-10-11 05:03:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:22,245 INFO L471 AbstractCegarLoop]: Abstraction has 6896 states and 9092 transitions. [2024-10-11 05:03:22,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 9092 transitions. [2024-10-11 05:03:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 05:03:22,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:22,250 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:03:22,250 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:22,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1670249923, now seen corresponding path program 1 times [2024-10-11 05:03:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:22,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831701971] [2024-10-11 05:03:22,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:03:22,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:22,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831701971] [2024-10-11 05:03:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831701971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:22,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820707765] [2024-10-11 05:03:22,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:22,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:22,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:22,366 INFO L87 Difference]: Start difference. First operand 6896 states and 9092 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:23,853 INFO L93 Difference]: Finished difference Result 9546 states and 12347 transitions. [2024-10-11 05:03:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 05:03:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-11 05:03:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:23,880 INFO L225 Difference]: With dead ends: 9546 [2024-10-11 05:03:23,880 INFO L226 Difference]: Without dead ends: 6052 [2024-10-11 05:03:23,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-11 05:03:23,891 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1310 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:23,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 896 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2024-10-11 05:03:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 5690. [2024-10-11 05:03:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 4475 states have (on average 1.3369832402234636) internal successors, (5983), 4568 states have internal predecessors, (5983), 633 states have call successors, (633), 467 states have call predecessors, (633), 580 states have return successors, (928), 664 states have call predecessors, (928), 630 states have call successors, (928) [2024-10-11 05:03:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 7544 transitions. [2024-10-11 05:03:24,657 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 7544 transitions. Word has length 86 [2024-10-11 05:03:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:24,658 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 7544 transitions. [2024-10-11 05:03:24,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 7544 transitions. [2024-10-11 05:03:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 05:03:24,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:24,663 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:24,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:03:24,664 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:24,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1894959182, now seen corresponding path program 1 times [2024-10-11 05:03:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:24,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26071067] [2024-10-11 05:03:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:03:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 05:03:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:03:24,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:24,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26071067] [2024-10-11 05:03:24,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26071067] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:24,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851960936] [2024-10-11 05:03:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:24,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:24,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:24,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:24,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:03:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:24,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:03:24,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 05:03:24,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:24,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851960936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:24,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:24,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:03:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657230678] [2024-10-11 05:03:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:24,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:24,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:24,899 INFO L87 Difference]: Start difference. First operand 5690 states and 7544 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:03:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:26,060 INFO L93 Difference]: Finished difference Result 8593 states and 11937 transitions. [2024-10-11 05:03:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2024-10-11 05:03:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:26,087 INFO L225 Difference]: With dead ends: 8593 [2024-10-11 05:03:26,087 INFO L226 Difference]: Without dead ends: 6176 [2024-10-11 05:03:26,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:26,100 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 133 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:26,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 683 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:03:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2024-10-11 05:03:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 6176. [2024-10-11 05:03:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6176 states, 4878 states have (on average 1.346248462484625) internal successors, (6567), 4975 states have internal predecessors, (6567), 682 states have call successors, (682), 497 states have call predecessors, (682), 614 states have return successors, (1006), 713 states have call predecessors, (1006), 679 states have call successors, (1006) [2024-10-11 05:03:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6176 states to 6176 states and 8255 transitions. [2024-10-11 05:03:26,849 INFO L78 Accepts]: Start accepts. Automaton has 6176 states and 8255 transitions. Word has length 100 [2024-10-11 05:03:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:26,850 INFO L471 AbstractCegarLoop]: Abstraction has 6176 states and 8255 transitions. [2024-10-11 05:03:26,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:03:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6176 states and 8255 transitions. [2024-10-11 05:03:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:03:26,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:26,856 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:26,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 05:03:27,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:27,057 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:27,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:27,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1644455643, now seen corresponding path program 1 times [2024-10-11 05:03:27,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:27,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962748977] [2024-10-11 05:03:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:27,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:03:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:03:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:03:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 05:03:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:03:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 05:03:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 05:03:27,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:27,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962748977] [2024-10-11 05:03:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962748977] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:27,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487677017] [2024-10-11 05:03:27,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:27,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:27,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:27,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:27,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:03:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:27,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:03:27,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 05:03:27,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:27,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487677017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:27,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:27,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-11 05:03:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908563317] [2024-10-11 05:03:27,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:27,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:03:27,382 INFO L87 Difference]: Start difference. First operand 6176 states and 8255 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:03:27,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:27,868 INFO L93 Difference]: Finished difference Result 7605 states and 9978 transitions. [2024-10-11 05:03:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:03:27,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-11 05:03:27,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:27,890 INFO L225 Difference]: With dead ends: 7605 [2024-10-11 05:03:27,890 INFO L226 Difference]: Without dead ends: 4645 [2024-10-11 05:03:27,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:03:27,900 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:27,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1393 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:03:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2024-10-11 05:03:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 4630. [2024-10-11 05:03:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 3774 states have (on average 1.3863275039745628) internal successors, (5232), 3832 states have internal predecessors, (5232), 474 states have call successors, (474), 314 states have call predecessors, (474), 380 states have return successors, (712), 491 states have call predecessors, (712), 471 states have call successors, (712) [2024-10-11 05:03:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 6418 transitions. [2024-10-11 05:03:28,459 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 6418 transitions. Word has length 131 [2024-10-11 05:03:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:28,459 INFO L471 AbstractCegarLoop]: Abstraction has 4630 states and 6418 transitions. [2024-10-11 05:03:28,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:03:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 6418 transitions. [2024-10-11 05:03:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 05:03:28,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:28,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:28,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 05:03:28,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:28,665 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:28,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:28,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1177748283, now seen corresponding path program 1 times [2024-10-11 05:03:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317348280] [2024-10-11 05:03:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:03:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:03:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 05:03:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-11 05:03:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317348280] [2024-10-11 05:03:28,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317348280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:28,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509179175] [2024-10-11 05:03:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:28,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:28,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:28,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:28,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:03:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:03:28,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 05:03:29,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509179175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:29,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:29,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:03:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233648536] [2024-10-11 05:03:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:29,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:29,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:29,097 INFO L87 Difference]: Start difference. First operand 4630 states and 6418 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 05:03:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:29,644 INFO L93 Difference]: Finished difference Result 8108 states and 11662 transitions. [2024-10-11 05:03:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2024-10-11 05:03:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:29,667 INFO L225 Difference]: With dead ends: 8108 [2024-10-11 05:03:29,667 INFO L226 Difference]: Without dead ends: 6105 [2024-10-11 05:03:29,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:29,674 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 219 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:29,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 430 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:03:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2024-10-11 05:03:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 6072. [2024-10-11 05:03:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6072 states, 4976 states have (on average 1.4061495176848875) internal successors, (6997), 5051 states have internal predecessors, (6997), 614 states have call successors, (614), 402 states have call predecessors, (614), 480 states have return successors, (913), 626 states have call predecessors, (913), 611 states have call successors, (913) [2024-10-11 05:03:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6072 states to 6072 states and 8524 transitions. [2024-10-11 05:03:30,260 INFO L78 Accepts]: Start accepts. Automaton has 6072 states and 8524 transitions. Word has length 128 [2024-10-11 05:03:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:30,260 INFO L471 AbstractCegarLoop]: Abstraction has 6072 states and 8524 transitions. [2024-10-11 05:03:30,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 05:03:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6072 states and 8524 transitions. [2024-10-11 05:03:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 05:03:30,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:30,266 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:30,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 05:03:30,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 05:03:30,467 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:30,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2096722906, now seen corresponding path program 1 times [2024-10-11 05:03:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033818798] [2024-10-11 05:03:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:03:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:03:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 05:03:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 05:03:30,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033818798] [2024-10-11 05:03:30,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033818798] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670409201] [2024-10-11 05:03:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:30,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:30,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:30,579 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:30,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 05:03:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:03:30,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 05:03:30,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:30,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670409201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:30,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:30,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:03:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264039667] [2024-10-11 05:03:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:30,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:30,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:30,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:30,775 INFO L87 Difference]: Start difference. First operand 6072 states and 8524 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 05:03:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:31,623 INFO L93 Difference]: Finished difference Result 15180 states and 22122 transitions. [2024-10-11 05:03:31,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:31,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2024-10-11 05:03:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:31,651 INFO L225 Difference]: With dead ends: 15180 [2024-10-11 05:03:31,651 INFO L226 Difference]: Without dead ends: 10542 [2024-10-11 05:03:31,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:31,663 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 224 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:31,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 429 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:03:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10542 states. [2024-10-11 05:03:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10542 to 10490. [2024-10-11 05:03:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10490 states, 8643 states have (on average 1.4249681823440934) internal successors, (12316), 8778 states have internal predecessors, (12316), 1046 states have call successors, (1046), 681 states have call predecessors, (1046), 799 states have return successors, (1557), 1038 states have call predecessors, (1557), 1043 states have call successors, (1557) [2024-10-11 05:03:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10490 states to 10490 states and 14919 transitions. [2024-10-11 05:03:32,568 INFO L78 Accepts]: Start accepts. Automaton has 10490 states and 14919 transitions. Word has length 128 [2024-10-11 05:03:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:32,568 INFO L471 AbstractCegarLoop]: Abstraction has 10490 states and 14919 transitions. [2024-10-11 05:03:32,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 05:03:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 10490 states and 14919 transitions. [2024-10-11 05:03:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:03:32,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:32,580 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:32,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 05:03:32,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 05:03:32,781 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:32,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2069395970, now seen corresponding path program 1 times [2024-10-11 05:03:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:32,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524365027] [2024-10-11 05:03:32,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:03:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:03:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:03:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:03:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:03:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:03:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 05:03:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 05:03:32,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:32,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524365027] [2024-10-11 05:03:32,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524365027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:32,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029946811] [2024-10-11 05:03:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:32,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:32,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:32,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:32,908 INFO L87 Difference]: Start difference. First operand 10490 states and 14919 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:03:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:34,108 INFO L93 Difference]: Finished difference Result 11657 states and 16323 transitions. [2024-10-11 05:03:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:03:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-11 05:03:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:34,150 INFO L225 Difference]: With dead ends: 11657 [2024-10-11 05:03:34,150 INFO L226 Difference]: Without dead ends: 10398 [2024-10-11 05:03:34,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:34,162 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 378 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:34,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 746 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10398 states. [2024-10-11 05:03:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10398 to 10259. [2024-10-11 05:03:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10259 states, 8463 states have (on average 1.4306983339241404) internal successors, (12108), 8598 states have internal predecessors, (12108), 1021 states have call successors, (1021), 660 states have call predecessors, (1021), 773 states have return successors, (1519), 1008 states have call predecessors, (1519), 1018 states have call successors, (1519) [2024-10-11 05:03:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10259 states to 10259 states and 14648 transitions. [2024-10-11 05:03:35,231 INFO L78 Accepts]: Start accepts. Automaton has 10259 states and 14648 transitions. Word has length 145 [2024-10-11 05:03:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:35,231 INFO L471 AbstractCegarLoop]: Abstraction has 10259 states and 14648 transitions. [2024-10-11 05:03:35,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:03:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 10259 states and 14648 transitions. [2024-10-11 05:03:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 05:03:35,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:35,243 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:35,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:03:35,243 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:35,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2105371629, now seen corresponding path program 1 times [2024-10-11 05:03:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586400316] [2024-10-11 05:03:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:03:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:03:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:03:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:03:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 05:03:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:03:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:03:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-11 05:03:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586400316] [2024-10-11 05:03:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586400316] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136442627] [2024-10-11 05:03:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:35,485 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:35,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 05:03:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 05:03:35,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 05:03:35,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:35,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136442627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:35,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:35,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-10-11 05:03:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156164101] [2024-10-11 05:03:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:35,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:03:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:03:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:35,724 INFO L87 Difference]: Start difference. First operand 10259 states and 14648 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:03:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:36,822 INFO L93 Difference]: Finished difference Result 12369 states and 17240 transitions. [2024-10-11 05:03:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:03:36,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2024-10-11 05:03:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:36,858 INFO L225 Difference]: With dead ends: 12369 [2024-10-11 05:03:36,858 INFO L226 Difference]: Without dead ends: 11087 [2024-10-11 05:03:36,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:03:36,867 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 167 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:36,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 449 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:03:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11087 states. [2024-10-11 05:03:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11087 to 11048. [2024-10-11 05:03:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11048 states, 9109 states have (on average 1.411790536831705) internal successors, (12860), 9248 states have internal predecessors, (12860), 1091 states have call successors, (1091), 711 states have call predecessors, (1091), 846 states have return successors, (1630), 1096 states have call predecessors, (1630), 1088 states have call successors, (1630) [2024-10-11 05:03:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 15581 transitions. [2024-10-11 05:03:37,838 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 15581 transitions. Word has length 147 [2024-10-11 05:03:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:37,839 INFO L471 AbstractCegarLoop]: Abstraction has 11048 states and 15581 transitions. [2024-10-11 05:03:37,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:03:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 15581 transitions. [2024-10-11 05:03:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 05:03:37,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:37,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:37,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 05:03:38,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 05:03:38,051 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:38,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1607928724, now seen corresponding path program 1 times [2024-10-11 05:03:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831073182] [2024-10-11 05:03:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 05:03:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:03:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:03:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 05:03:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-11 05:03:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831073182] [2024-10-11 05:03:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831073182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483139605] [2024-10-11 05:03:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:38,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:38,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:38,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:38,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 05:03:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:03:38,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 05:03:38,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483139605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:38,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:38,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:03:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706141016] [2024-10-11 05:03:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:38,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:38,359 INFO L87 Difference]: Start difference. First operand 11048 states and 15581 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 05:03:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:39,503 INFO L93 Difference]: Finished difference Result 16297 states and 23258 transitions. [2024-10-11 05:03:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:39,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2024-10-11 05:03:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:39,528 INFO L225 Difference]: With dead ends: 16297 [2024-10-11 05:03:39,528 INFO L226 Difference]: Without dead ends: 8272 [2024-10-11 05:03:39,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:39,545 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 241 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:39,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 303 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:03:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8272 states. [2024-10-11 05:03:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8272 to 7812. [2024-10-11 05:03:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7812 states, 6438 states have (on average 1.3432743087915502) internal successors, (8648), 6511 states have internal predecessors, (8648), 752 states have call successors, (752), 527 states have call predecessors, (752), 620 states have return successors, (1000), 777 states have call predecessors, (1000), 749 states have call successors, (1000) [2024-10-11 05:03:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7812 states to 7812 states and 10400 transitions. [2024-10-11 05:03:40,259 INFO L78 Accepts]: Start accepts. Automaton has 7812 states and 10400 transitions. Word has length 144 [2024-10-11 05:03:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:40,260 INFO L471 AbstractCegarLoop]: Abstraction has 7812 states and 10400 transitions. [2024-10-11 05:03:40,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 05:03:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7812 states and 10400 transitions. [2024-10-11 05:03:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 05:03:40,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:40,266 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:40,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 05:03:40,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 05:03:40,467 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:40,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash -694760969, now seen corresponding path program 1 times [2024-10-11 05:03:40,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:40,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443003925] [2024-10-11 05:03:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 05:03:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:03:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:03:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 05:03:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-11 05:03:40,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:40,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443003925] [2024-10-11 05:03:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443003925] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:40,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223542364] [2024-10-11 05:03:40,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:40,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:40,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:40,583 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:40,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 05:03:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 05:03:40,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 05:03:40,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223542364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:40,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:03:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818691545] [2024-10-11 05:03:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:40,711 INFO L87 Difference]: Start difference. First operand 7812 states and 10400 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 05:03:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:41,465 INFO L93 Difference]: Finished difference Result 14139 states and 19084 transitions. [2024-10-11 05:03:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:41,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 144 [2024-10-11 05:03:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:41,491 INFO L225 Difference]: With dead ends: 14139 [2024-10-11 05:03:41,491 INFO L226 Difference]: Without dead ends: 8320 [2024-10-11 05:03:41,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:41,501 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 264 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:41,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 435 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:03:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8320 states. [2024-10-11 05:03:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8320 to 8195. [2024-10-11 05:03:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8195 states, 6784 states have (on average 1.3170695754716981) internal successors, (8935), 6852 states have internal predecessors, (8935), 754 states have call successors, (754), 559 states have call predecessors, (754), 655 states have return successors, (996), 787 states have call predecessors, (996), 751 states have call successors, (996) [2024-10-11 05:03:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8195 states to 8195 states and 10685 transitions. [2024-10-11 05:03:42,233 INFO L78 Accepts]: Start accepts. Automaton has 8195 states and 10685 transitions. Word has length 144 [2024-10-11 05:03:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:42,234 INFO L471 AbstractCegarLoop]: Abstraction has 8195 states and 10685 transitions. [2024-10-11 05:03:42,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 05:03:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8195 states and 10685 transitions. [2024-10-11 05:03:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:03:42,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:42,242 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:42,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 05:03:42,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:42,443 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1741339516, now seen corresponding path program 1 times [2024-10-11 05:03:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071903953] [2024-10-11 05:03:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:03:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 05:03:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 05:03:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 05:03:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-11 05:03:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071903953] [2024-10-11 05:03:42,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071903953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:42,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819285627] [2024-10-11 05:03:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:42,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:42,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:42,550 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:42,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 05:03:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:03:42,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 05:03:42,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819285627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:42,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:42,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:03:42,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166700797] [2024-10-11 05:03:42,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:42,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:42,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:42,759 INFO L87 Difference]: Start difference. First operand 8195 states and 10685 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 05:03:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:43,821 INFO L93 Difference]: Finished difference Result 19656 states and 26268 transitions. [2024-10-11 05:03:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:43,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2024-10-11 05:03:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:43,881 INFO L225 Difference]: With dead ends: 19656 [2024-10-11 05:03:43,882 INFO L226 Difference]: Without dead ends: 13454 [2024-10-11 05:03:43,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:43,904 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 144 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:43,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 683 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:03:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13454 states. [2024-10-11 05:03:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13454 to 13450. [2024-10-11 05:03:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13450 states, 11136 states have (on average 1.3247126436781609) internal successors, (14752), 11254 states have internal predecessors, (14752), 1261 states have call successors, (1261), 914 states have call predecessors, (1261), 1051 states have return successors, (1831), 1289 states have call predecessors, (1831), 1258 states have call successors, (1831) [2024-10-11 05:03:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13450 states to 13450 states and 17844 transitions. [2024-10-11 05:03:45,366 INFO L78 Accepts]: Start accepts. Automaton has 13450 states and 17844 transitions. Word has length 145 [2024-10-11 05:03:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:45,367 INFO L471 AbstractCegarLoop]: Abstraction has 13450 states and 17844 transitions. [2024-10-11 05:03:45,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 05:03:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 13450 states and 17844 transitions. [2024-10-11 05:03:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 05:03:45,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:45,376 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:45,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 05:03:45,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:45,577 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:45,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash -172480370, now seen corresponding path program 1 times [2024-10-11 05:03:45,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:45,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476408609] [2024-10-11 05:03:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:03:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:03:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:03:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 05:03:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-11 05:03:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:45,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476408609] [2024-10-11 05:03:45,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476408609] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:45,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754702863] [2024-10-11 05:03:45,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:45,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:45,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:45,681 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:45,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 05:03:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 05:03:45,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 05:03:45,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754702863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:45,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:03:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491758888] [2024-10-11 05:03:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:45,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:45,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:45,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:45,840 INFO L87 Difference]: Start difference. First operand 13450 states and 17844 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 05:03:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:47,886 INFO L93 Difference]: Finished difference Result 35813 states and 48654 transitions. [2024-10-11 05:03:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2024-10-11 05:03:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:47,948 INFO L225 Difference]: With dead ends: 35813 [2024-10-11 05:03:47,948 INFO L226 Difference]: Without dead ends: 24360 [2024-10-11 05:03:47,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:47,968 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 260 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:47,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 456 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:03:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24360 states. [2024-10-11 05:03:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24360 to 24144. [2024-10-11 05:03:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24144 states, 20068 states have (on average 1.3245963723340641) internal successors, (26582), 20286 states have internal predecessors, (26582), 2231 states have call successors, (2231), 1630 states have call predecessors, (2231), 1843 states have return successors, (3908), 2243 states have call predecessors, (3908), 2228 states have call successors, (3908) [2024-10-11 05:03:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24144 states to 24144 states and 32721 transitions. [2024-10-11 05:03:50,496 INFO L78 Accepts]: Start accepts. Automaton has 24144 states and 32721 transitions. Word has length 146 [2024-10-11 05:03:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:50,496 INFO L471 AbstractCegarLoop]: Abstraction has 24144 states and 32721 transitions. [2024-10-11 05:03:50,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 05:03:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24144 states and 32721 transitions. [2024-10-11 05:03:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 05:03:50,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:50,512 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:50,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 05:03:50,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 05:03:50,712 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:50,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:50,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1046343504, now seen corresponding path program 1 times [2024-10-11 05:03:50,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:50,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868767538] [2024-10-11 05:03:50,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:03:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:03:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 05:03:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 05:03:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-11 05:03:50,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:50,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868767538] [2024-10-11 05:03:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868767538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:03:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862115396] [2024-10-11 05:03:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:50,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:03:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:03:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:03:50,789 INFO L87 Difference]: Start difference. First operand 24144 states and 32721 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:53,128 INFO L93 Difference]: Finished difference Result 44323 states and 60244 transitions. [2024-10-11 05:03:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 146 [2024-10-11 05:03:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:53,201 INFO L225 Difference]: With dead ends: 44323 [2024-10-11 05:03:53,201 INFO L226 Difference]: Without dead ends: 22174 [2024-10-11 05:03:53,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:53,242 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 404 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:53,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 439 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:03:53,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22174 states. [2024-10-11 05:03:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22174 to 20232. [2024-10-11 05:03:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20232 states, 16766 states have (on average 1.3239293808898962) internal successors, (22197), 17113 states have internal predecessors, (22197), 1741 states have call successors, (1741), 1270 states have call predecessors, (1741), 1723 states have return successors, (3357), 1856 states have call predecessors, (3357), 1738 states have call successors, (3357) [2024-10-11 05:03:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20232 states to 20232 states and 27295 transitions. [2024-10-11 05:03:55,378 INFO L78 Accepts]: Start accepts. Automaton has 20232 states and 27295 transitions. Word has length 146 [2024-10-11 05:03:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:55,379 INFO L471 AbstractCegarLoop]: Abstraction has 20232 states and 27295 transitions. [2024-10-11 05:03:55,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 20232 states and 27295 transitions. [2024-10-11 05:03:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 05:03:55,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:55,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:55,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 05:03:55,392 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:55,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2138917230, now seen corresponding path program 1 times [2024-10-11 05:03:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:55,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883268792] [2024-10-11 05:03:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:55,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:03:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:03:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 05:03:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:03:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:03:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 05:03:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 05:03:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-11 05:03:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883268792] [2024-10-11 05:03:55,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883268792] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755180765] [2024-10-11 05:03:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:55,492 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:55,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 05:03:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 05:03:55,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:03:55,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755180765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:55,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:55,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:03:55,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098794194] [2024-10-11 05:03:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:55,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:55,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:55,658 INFO L87 Difference]: Start difference. First operand 20232 states and 27295 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)