./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_1.cil-2+token_ring.04.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_1.cil-2+token_ring.04.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 c775d42bfad3c45ab40b07224c097c48233d7fc79c2c6639ab29adb0162bc4be --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:00:31,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:00:31,151 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:00:31,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:00:31,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:00:31,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:00:31,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:00:31,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:00:31,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:00:31,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:00:31,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:00:31,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:00:31,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:00:31,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:00:31,206 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:00:31,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:00:31,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:00:31,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:00:31,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:00:31,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:00:31,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:00:31,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:00:31,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:00:31,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:00:31,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:00:31,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:00:31,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:00:31,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:00:31,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:00:31,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:00:31,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:00:31,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:00:31,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:00:31,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:00:31,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:00:31,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:00:31,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:00:31,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:00:31,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:00:31,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:00:31,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:00:31,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:00:31,219 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 -> c775d42bfad3c45ab40b07224c097c48233d7fc79c2c6639ab29adb0162bc4be [2024-10-11 05:00:31,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:00:31,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:00:31,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:00:31,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:00:31,572 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:00:31,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-2.c [2024-10-11 05:00:33,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:00:33,701 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:00:33,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-2.c [2024-10-11 05:00:33,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/320402ff7/9566faaf3b294f9faf362ba42dfef4cf/FLAGac5ee8867 [2024-10-11 05:00:33,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/320402ff7/9566faaf3b294f9faf362ba42dfef4cf [2024-10-11 05:00:33,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:00:33,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:00:33,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:00:33,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:00:33,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:00:33,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:00:33" (1/1) ... [2024-10-11 05:00:33,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb457d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:33, skipping insertion in model container [2024-10-11 05:00:33,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:00:33" (1/1) ... [2024-10-11 05:00:33,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:00:34,277 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_1.cil-2+token_ring.04.cil-2.c[913,926] [2024-10-11 05:00:34,357 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_1.cil-2+token_ring.04.cil-2.c[5977,5990] [2024-10-11 05:00:34,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:00:34,485 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:00:34,512 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_1.cil-2+token_ring.04.cil-2.c[913,926] [2024-10-11 05:00:34,527 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_1.cil-2+token_ring.04.cil-2.c[5977,5990] [2024-10-11 05:00:34,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:00:34,586 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:00:34,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34 WrapperNode [2024-10-11 05:00:34,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:00:34,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:00:34,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:00:34,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:00:34,596 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:00:34" (1/1) ... [2024-10-11 05:00:34,606 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:00:34" (1/1) ... [2024-10-11 05:00:34,640 INFO L138 Inliner]: procedures = 56, calls = 61, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 609 [2024-10-11 05:00:34,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:00:34,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:00:34,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:00:34,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:00:34,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,690 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:00:34,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:00:34,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:00:34,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:00:34,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:00:34,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (1/1) ... [2024-10-11 05:00:34,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:00:34,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:34,789 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:00:34,794 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:00:34,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:00:34,884 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:00:34,885 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:00:34,885 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-11 05:00:34,886 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-11 05:00:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:00:34,886 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:00:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:00:34,886 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:00:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:00:34,887 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:00:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:00:34,887 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:00:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:00:34,887 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:00:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:00:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:00:34,888 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:00:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:00:34,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:00:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:00:34,888 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:00:34,889 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:00:34,889 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:00:35,001 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:00:35,007 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:00:35,673 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-10-11 05:00:35,673 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:00:35,744 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:00:35,744 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 05:00:35,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:00:35 BoogieIcfgContainer [2024-10-11 05:00:35,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:00:35,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:00:35,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:00:35,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:00:35,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:00:33" (1/3) ... [2024-10-11 05:00:35,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214fd56a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:00:35, skipping insertion in model container [2024-10-11 05:00:35,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:34" (2/3) ... [2024-10-11 05:00:35,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214fd56a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:00:35, skipping insertion in model container [2024-10-11 05:00:35,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:00:35" (3/3) ... [2024-10-11 05:00:35,761 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.04.cil-2.c [2024-10-11 05:00:35,790 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:00:35,791 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:00:35,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:00:35,862 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;@1cd29b78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:00:35,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:00:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 196 states have (on average 1.6887755102040816) internal successors, (331), 203 states have internal predecessors, (331), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 05:00:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 05:00:35,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:35,878 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] [2024-10-11 05:00:35,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:35,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1217203649, now seen corresponding path program 1 times [2024-10-11 05:00:35,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:35,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285370628] [2024-10-11 05:00:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:35,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:36,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:36,377 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:00:36,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:36,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285370628] [2024-10-11 05:00:36,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285370628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:36,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:36,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270780959] [2024-10-11 05:00:36,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:36,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:36,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:36,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:36,416 INFO L87 Difference]: Start difference. First operand has 235 states, 196 states have (on average 1.6887755102040816) internal successors, (331), 203 states have internal predecessors, (331), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:37,098 INFO L93 Difference]: Finished difference Result 518 states and 846 transitions. [2024-10-11 05:00:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-11 05:00:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:37,126 INFO L225 Difference]: With dead ends: 518 [2024-10-11 05:00:37,127 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 05:00:37,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:37,146 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 443 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:37,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 453 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 05:00:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2024-10-11 05:00:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 243 states have (on average 1.5308641975308641) internal successors, (372), 248 states have internal predecessors, (372), 30 states have call successors, (30), 12 states have call predecessors, (30), 11 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-10-11 05:00:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 434 transitions. [2024-10-11 05:00:37,254 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 434 transitions. Word has length 37 [2024-10-11 05:00:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:37,255 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 434 transitions. [2024-10-11 05:00:37,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 434 transitions. [2024-10-11 05:00:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 05:00:37,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:37,262 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] [2024-10-11 05:00:37,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:00:37,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:37,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1404925790, now seen corresponding path program 1 times [2024-10-11 05:00:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135403857] [2024-10-11 05:00:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:37,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:37,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 05:00:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:37,507 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:00:37,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135403857] [2024-10-11 05:00:37,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135403857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:37,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:37,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:37,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160573187] [2024-10-11 05:00:37,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:37,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:37,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:37,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:37,526 INFO L87 Difference]: Start difference. First operand 286 states and 434 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:37,924 INFO L93 Difference]: Finished difference Result 520 states and 778 transitions. [2024-10-11 05:00:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-11 05:00:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:37,933 INFO L225 Difference]: With dead ends: 520 [2024-10-11 05:00:37,933 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 05:00:37,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:37,937 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 456 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:37,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 445 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 05:00:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 386. [2024-10-11 05:00:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 330 states have (on average 1.4848484848484849) internal successors, (490), 336 states have internal predecessors, (490), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (46), 34 states have call predecessors, (46), 34 states have call successors, (46) [2024-10-11 05:00:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 574 transitions. [2024-10-11 05:00:37,992 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 574 transitions. Word has length 38 [2024-10-11 05:00:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:37,993 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 574 transitions. [2024-10-11 05:00:37,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 574 transitions. [2024-10-11 05:00:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 05:00:37,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:37,997 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] [2024-10-11 05:00:37,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:00:37,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:38,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1083038728, now seen corresponding path program 1 times [2024-10-11 05:00:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476019537] [2024-10-11 05:00:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:00:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,093 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:00:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476019537] [2024-10-11 05:00:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476019537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:38,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:38,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106666346] [2024-10-11 05:00:38,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:38,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:38,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:38,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:38,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:38,099 INFO L87 Difference]: Start difference. First operand 386 states and 574 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:38,685 INFO L93 Difference]: Finished difference Result 806 states and 1155 transitions. [2024-10-11 05:00:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-11 05:00:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:38,695 INFO L225 Difference]: With dead ends: 806 [2024-10-11 05:00:38,698 INFO L226 Difference]: Without dead ends: 595 [2024-10-11 05:00:38,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:38,700 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 195 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:38,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 610 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-11 05:00:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 491. [2024-10-11 05:00:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 423 states have (on average 1.4633569739952719) internal successors, (619), 431 states have internal predecessors, (619), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (52), 38 states have call predecessors, (52), 40 states have call successors, (52) [2024-10-11 05:00:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 715 transitions. [2024-10-11 05:00:38,764 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 715 transitions. Word has length 39 [2024-10-11 05:00:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:38,765 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 715 transitions. [2024-10-11 05:00:38,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 715 transitions. [2024-10-11 05:00:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 05:00:38,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:38,772 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] [2024-10-11 05:00:38,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:00:38,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:38,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash -365158752, now seen corresponding path program 1 times [2024-10-11 05:00:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528427651] [2024-10-11 05:00:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 05:00:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:00:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,939 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:00:38,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528427651] [2024-10-11 05:00:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528427651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:38,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:38,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:38,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39093827] [2024-10-11 05:00:38,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:38,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:38,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:38,944 INFO L87 Difference]: Start difference. First operand 491 states and 715 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:39,332 INFO L93 Difference]: Finished difference Result 1007 states and 1432 transitions. [2024-10-11 05:00:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:39,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-11 05:00:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:39,339 INFO L225 Difference]: With dead ends: 1007 [2024-10-11 05:00:39,340 INFO L226 Difference]: Without dead ends: 691 [2024-10-11 05:00:39,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:39,343 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 180 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:39,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 657 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-11 05:00:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 657. [2024-10-11 05:00:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 565 states have (on average 1.407079646017699) internal successors, (795), 575 states have internal predecessors, (795), 58 states have call successors, (58), 30 states have call predecessors, (58), 32 states have return successors, (76), 52 states have call predecessors, (76), 54 states have call successors, (76) [2024-10-11 05:00:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 929 transitions. [2024-10-11 05:00:39,400 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 929 transitions. Word has length 54 [2024-10-11 05:00:39,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:39,402 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 929 transitions. [2024-10-11 05:00:39,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 929 transitions. [2024-10-11 05:00:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:00:39,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:39,405 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 05:00:39,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:00:39,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:39,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:39,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1923672539, now seen corresponding path program 1 times [2024-10-11 05:00:39,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:39,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544921626] [2024-10-11 05:00:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:39,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:00:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:00:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:00:39,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544921626] [2024-10-11 05:00:39,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544921626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:39,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:39,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:39,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173654847] [2024-10-11 05:00:39,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:39,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:39,483 INFO L87 Difference]: Start difference. First operand 657 states and 929 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:39,809 INFO L93 Difference]: Finished difference Result 1236 states and 1708 transitions. [2024-10-11 05:00:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:39,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-11 05:00:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:39,815 INFO L225 Difference]: With dead ends: 1236 [2024-10-11 05:00:39,815 INFO L226 Difference]: Without dead ends: 834 [2024-10-11 05:00:39,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:39,817 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 442 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:39,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 457 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:00:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-11 05:00:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 785. [2024-10-11 05:00:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 677 states have (on average 1.3737075332348596) internal successors, (930), 689 states have internal predecessors, (930), 66 states have call successors, (66), 36 states have call predecessors, (66), 40 states have return successors, (90), 60 states have call predecessors, (90), 62 states have call successors, (90) [2024-10-11 05:00:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1086 transitions. [2024-10-11 05:00:39,860 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1086 transitions. Word has length 59 [2024-10-11 05:00:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1086 transitions. [2024-10-11 05:00:39,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1086 transitions. [2024-10-11 05:00:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:39,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:39,863 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] [2024-10-11 05:00:39,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:00:39,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:39,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash -469151263, now seen corresponding path program 1 times [2024-10-11 05:00:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:39,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919026333] [2024-10-11 05:00:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 05:00:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919026333] [2024-10-11 05:00:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919026333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183450041] [2024-10-11 05:00:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:39,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:39,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:39,954 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:00:39,955 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:00:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 05:00:40,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:00:40,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183450041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 05:00:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49054964] [2024-10-11 05:00:40,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:40,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:00:40,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:00:40,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:40,073 INFO L87 Difference]: Start difference. First operand 785 states and 1086 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:40,162 INFO L93 Difference]: Finished difference Result 1266 states and 1747 transitions. [2024-10-11 05:00:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:00:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:00:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:40,167 INFO L225 Difference]: With dead ends: 1266 [2024-10-11 05:00:40,167 INFO L226 Difference]: Without dead ends: 783 [2024-10-11 05:00:40,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:40,169 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 66 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:40,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 663 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:00:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-11 05:00:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 745. [2024-10-11 05:00:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 643 states have (on average 1.3545878693623639) internal successors, (871), 655 states have internal predecessors, (871), 62 states have call successors, (62), 34 states have call predecessors, (62), 38 states have return successors, (84), 56 states have call predecessors, (84), 58 states have call successors, (84) [2024-10-11 05:00:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1017 transitions. [2024-10-11 05:00:40,216 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1017 transitions. Word has length 60 [2024-10-11 05:00:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:40,217 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 1017 transitions. [2024-10-11 05:00:40,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1017 transitions. [2024-10-11 05:00:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:40,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:40,220 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:40,242 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:00:40,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:40,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:40,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash 601272416, now seen corresponding path program 1 times [2024-10-11 05:00:40,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:40,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548243321] [2024-10-11 05:00:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:00:40,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:40,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548243321] [2024-10-11 05:00:40,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548243321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124180541] [2024-10-11 05:00:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:40,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:40,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:40,502 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:00:40,533 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:00:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:00:40,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:00:40,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:40,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124180541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:40,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:40,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:00:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129742835] [2024-10-11 05:00:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:40,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:40,643 INFO L87 Difference]: Start difference. First operand 745 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:40,736 INFO L93 Difference]: Finished difference Result 1191 states and 1620 transitions. [2024-10-11 05:00:40,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:00:40,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:00:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:40,740 INFO L225 Difference]: With dead ends: 1191 [2024-10-11 05:00:40,741 INFO L226 Difference]: Without dead ends: 750 [2024-10-11 05:00:40,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:40,743 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 0 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:40,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 958 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:00:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-10-11 05:00:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2024-10-11 05:00:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 648 states have (on average 1.3395061728395061) internal successors, (868), 660 states have internal predecessors, (868), 62 states have call successors, (62), 34 states have call predecessors, (62), 38 states have return successors, (84), 56 states have call predecessors, (84), 58 states have call successors, (84) [2024-10-11 05:00:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1014 transitions. [2024-10-11 05:00:40,780 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1014 transitions. Word has length 60 [2024-10-11 05:00:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:40,780 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1014 transitions. [2024-10-11 05:00:40,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1014 transitions. [2024-10-11 05:00:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:40,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:40,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:40,804 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:00:40,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:40,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:40,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash -242733086, now seen corresponding path program 1 times [2024-10-11 05:00:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:40,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689590788] [2024-10-11 05:00:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:40,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:00:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689590788] [2024-10-11 05:00:41,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689590788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497450470] [2024-10-11 05:00:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:41,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:41,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:41,084 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:00:41,088 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:00:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:00:41,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:00:41,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497450470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:41,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:00:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310195563] [2024-10-11 05:00:41,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:41,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:41,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:41,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:41,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:41,206 INFO L87 Difference]: Start difference. First operand 750 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:41,297 INFO L93 Difference]: Finished difference Result 1116 states and 1502 transitions. [2024-10-11 05:00:41,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:00:41,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:00:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:41,302 INFO L225 Difference]: With dead ends: 1116 [2024-10-11 05:00:41,302 INFO L226 Difference]: Without dead ends: 647 [2024-10-11 05:00:41,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:41,304 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 0 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:41,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 958 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:00:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-11 05:00:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 640. [2024-10-11 05:00:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 556 states have (on average 1.3453237410071943) internal successors, (748), 566 states have internal predecessors, (748), 52 states have call successors, (52), 28 states have call predecessors, (52), 30 states have return successors, (65), 46 states have call predecessors, (65), 48 states have call successors, (65) [2024-10-11 05:00:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 865 transitions. [2024-10-11 05:00:41,333 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 865 transitions. Word has length 60 [2024-10-11 05:00:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:41,333 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 865 transitions. [2024-10-11 05:00:41,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 865 transitions. [2024-10-11 05:00:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:41,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:41,335 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:41,354 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:00:41,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:41,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:41,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1554906530, now seen corresponding path program 1 times [2024-10-11 05:00:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:41,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762705579] [2024-10-11 05:00:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762705579] [2024-10-11 05:00:41,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762705579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:00:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528221971] [2024-10-11 05:00:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:41,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:00:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:41,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:00:41,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:41,720 INFO L87 Difference]: Start difference. First operand 640 states and 865 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:42,329 INFO L93 Difference]: Finished difference Result 721 states and 962 transitions. [2024-10-11 05:00:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:00:42,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-11 05:00:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:42,340 INFO L225 Difference]: With dead ends: 721 [2024-10-11 05:00:42,340 INFO L226 Difference]: Without dead ends: 718 [2024-10-11 05:00:42,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:00:42,342 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 754 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:42,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 447 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-11 05:00:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 639. [2024-10-11 05:00:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 556 states have (on average 1.341726618705036) internal successors, (746), 565 states have internal predecessors, (746), 51 states have call successors, (51), 28 states have call predecessors, (51), 30 states have return successors, (65), 46 states have call predecessors, (65), 48 states have call successors, (65) [2024-10-11 05:00:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 862 transitions. [2024-10-11 05:00:42,436 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 862 transitions. Word has length 60 [2024-10-11 05:00:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:42,436 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 862 transitions. [2024-10-11 05:00:42,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 862 transitions. [2024-10-11 05:00:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 05:00:42,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:42,442 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:42,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:00:42,443 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 956623462, now seen corresponding path program 1 times [2024-10-11 05:00:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108095248] [2024-10-11 05:00:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:42,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108095248] [2024-10-11 05:00:42,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108095248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:42,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696368021] [2024-10-11 05:00:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:42,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:42,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:42,656 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:00:42,657 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:00:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:00:42,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:42,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:00:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696368021] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:00:42,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:00:42,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-11 05:00:42,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109261689] [2024-10-11 05:00:42,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:00:42,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:00:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:42,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:00:42,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:00:42,991 INFO L87 Difference]: Start difference. First operand 639 states and 862 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:00:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:43,641 INFO L93 Difference]: Finished difference Result 1314 states and 1712 transitions. [2024-10-11 05:00:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 05:00:43,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-11 05:00:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:43,647 INFO L225 Difference]: With dead ends: 1314 [2024-10-11 05:00:43,647 INFO L226 Difference]: Without dead ends: 1311 [2024-10-11 05:00:43,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:00:43,648 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 617 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:43,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1275 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2024-10-11 05:00:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 932. [2024-10-11 05:00:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 813 states have (on average 1.3161131611316113) internal successors, (1070), 828 states have internal predecessors, (1070), 70 states have call successors, (70), 41 states have call predecessors, (70), 47 states have return successors, (95), 63 states have call predecessors, (95), 67 states have call successors, (95) [2024-10-11 05:00:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1235 transitions. [2024-10-11 05:00:43,693 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1235 transitions. Word has length 61 [2024-10-11 05:00:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:43,694 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1235 transitions. [2024-10-11 05:00:43,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:00:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1235 transitions. [2024-10-11 05:00:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 05:00:43,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:43,696 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:43,711 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:00:43,896 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,SelfDestructingSolverStorable9 [2024-10-11 05:00:43,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash -686095514, now seen corresponding path program 2 times [2024-10-11 05:00:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300826972] [2024-10-11 05:00:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:00:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:00:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 05:00:43,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:43,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300826972] [2024-10-11 05:00:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300826972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:43,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:43,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:43,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874837421] [2024-10-11 05:00:43,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:43,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:43,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:43,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:43,948 INFO L87 Difference]: Start difference. First operand 932 states and 1235 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:00:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:44,181 INFO L93 Difference]: Finished difference Result 1528 states and 1992 transitions. [2024-10-11 05:00:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:44,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-11 05:00:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:44,185 INFO L225 Difference]: With dead ends: 1528 [2024-10-11 05:00:44,185 INFO L226 Difference]: Without dead ends: 939 [2024-10-11 05:00:44,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:44,186 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 452 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:44,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 467 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:00:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-11 05:00:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 868. [2024-10-11 05:00:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 756 states have (on average 1.3095238095238095) internal successors, (990), 771 states have internal predecessors, (990), 67 states have call successors, (67), 38 states have call predecessors, (67), 43 states have return successors, (90), 59 states have call predecessors, (90), 64 states have call successors, (90) [2024-10-11 05:00:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1147 transitions. [2024-10-11 05:00:44,251 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1147 transitions. Word has length 78 [2024-10-11 05:00:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:44,252 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1147 transitions. [2024-10-11 05:00:44,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:00:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1147 transitions. [2024-10-11 05:00:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:44,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:44,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:44,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:00:44,254 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:44,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1834725124, now seen corresponding path program 1 times [2024-10-11 05:00:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544559963] [2024-10-11 05:00:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,324 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:00:44,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:44,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544559963] [2024-10-11 05:00:44,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544559963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:00:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867849637] [2024-10-11 05:00:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:44,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:00:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:44,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:00:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:44,327 INFO L87 Difference]: Start difference. First operand 868 states and 1147 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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:00:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:45,085 INFO L93 Difference]: Finished difference Result 1079 states and 1486 transitions. [2024-10-11 05:00:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:45,091 INFO L225 Difference]: With dead ends: 1079 [2024-10-11 05:00:45,091 INFO L226 Difference]: Without dead ends: 918 [2024-10-11 05:00:45,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:00:45,093 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 475 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:45,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 505 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:00:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-10-11 05:00:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 868. [2024-10-11 05:00:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 756 states have (on average 1.3082010582010581) internal successors, (989), 771 states have internal predecessors, (989), 67 states have call successors, (67), 38 states have call predecessors, (67), 43 states have return successors, (90), 59 states have call predecessors, (90), 64 states have call successors, (90) [2024-10-11 05:00:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1146 transitions. [2024-10-11 05:00:45,195 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1146 transitions. Word has length 82 [2024-10-11 05:00:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:45,196 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1146 transitions. [2024-10-11 05:00:45,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 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:00:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1146 transitions. [2024-10-11 05:00:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:45,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:45,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:45,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:00:45,199 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1911625922, now seen corresponding path program 1 times [2024-10-11 05:00:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:45,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981239828] [2024-10-11 05:00:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:45,328 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:00:45,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:45,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981239828] [2024-10-11 05:00:45,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981239828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:45,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:45,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:00:45,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138775342] [2024-10-11 05:00:45,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:45,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:00:45,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:00:45,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:45,330 INFO L87 Difference]: Start difference. First operand 868 states and 1146 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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:00:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:46,531 INFO L93 Difference]: Finished difference Result 1289 states and 1824 transitions. [2024-10-11 05:00:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:00:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:46,536 INFO L225 Difference]: With dead ends: 1289 [2024-10-11 05:00:46,536 INFO L226 Difference]: Without dead ends: 1130 [2024-10-11 05:00:46,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:46,538 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 756 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:46,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 713 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:00:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-10-11 05:00:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1029. [2024-10-11 05:00:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 897 states have (on average 1.354515050167224) internal successors, (1215), 913 states have internal predecessors, (1215), 80 states have call successors, (80), 44 states have call predecessors, (80), 50 states have return successors, (106), 72 states have call predecessors, (106), 77 states have call successors, (106) [2024-10-11 05:00:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1401 transitions. [2024-10-11 05:00:46,617 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1401 transitions. Word has length 82 [2024-10-11 05:00:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:46,617 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1401 transitions. [2024-10-11 05:00:46,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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:00:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1401 transitions. [2024-10-11 05:00:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:46,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:46,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:46,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:00:46,620 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:46,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715200, now seen corresponding path program 1 times [2024-10-11 05:00:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:46,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630031335] [2024-10-11 05:00:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,752 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:00:46,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:46,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630031335] [2024-10-11 05:00:46,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630031335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:46,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308273524] [2024-10-11 05:00:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:46,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:46,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:46,755 INFO L87 Difference]: Start difference. First operand 1029 states and 1401 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:49,418 INFO L93 Difference]: Finished difference Result 1666 states and 2424 transitions. [2024-10-11 05:00:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:00:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:49,428 INFO L225 Difference]: With dead ends: 1666 [2024-10-11 05:00:49,428 INFO L226 Difference]: Without dead ends: 1346 [2024-10-11 05:00:49,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:00:49,433 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 765 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:49,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1236 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:00:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2024-10-11 05:00:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1180. [2024-10-11 05:00:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1028 states have (on average 1.382295719844358) internal successors, (1421), 1045 states have internal predecessors, (1421), 93 states have call successors, (93), 50 states have call predecessors, (93), 57 states have return successors, (121), 86 states have call predecessors, (121), 90 states have call successors, (121) [2024-10-11 05:00:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1635 transitions. [2024-10-11 05:00:49,611 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1635 transitions. Word has length 82 [2024-10-11 05:00:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:49,612 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1635 transitions. [2024-10-11 05:00:49,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1635 transitions. [2024-10-11 05:00:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:49,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:49,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:49,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:00:49,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:49,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash 674561474, now seen corresponding path program 1 times [2024-10-11 05:00:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309604358] [2024-10-11 05:00:49,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:49,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,773 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:00:49,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:49,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309604358] [2024-10-11 05:00:49,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309604358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:49,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:49,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788556487] [2024-10-11 05:00:49,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:49,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:49,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:49,775 INFO L87 Difference]: Start difference. First operand 1180 states and 1635 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:50,763 INFO L93 Difference]: Finished difference Result 1817 states and 2664 transitions. [2024-10-11 05:00:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:50,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:50,770 INFO L225 Difference]: With dead ends: 1817 [2024-10-11 05:00:50,770 INFO L226 Difference]: Without dead ends: 1346 [2024-10-11 05:00:50,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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:00:50,773 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 597 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:50,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 722 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:00:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2024-10-11 05:00:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1180. [2024-10-11 05:00:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1028 states have (on average 1.3793774319066148) internal successors, (1418), 1045 states have internal predecessors, (1418), 93 states have call successors, (93), 50 states have call predecessors, (93), 57 states have return successors, (121), 86 states have call predecessors, (121), 90 states have call successors, (121) [2024-10-11 05:00:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1632 transitions. [2024-10-11 05:00:50,843 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1632 transitions. Word has length 82 [2024-10-11 05:00:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:50,843 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1632 transitions. [2024-10-11 05:00:50,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1632 transitions. [2024-10-11 05:00:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:50,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:50,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:00:50,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:50,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash -57405952, now seen corresponding path program 1 times [2024-10-11 05:00:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928585914] [2024-10-11 05:00:50,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,956 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:00:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928585914] [2024-10-11 05:00:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928585914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:50,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:50,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985102210] [2024-10-11 05:00:50,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:50,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:50,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:50,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:50,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:50,958 INFO L87 Difference]: Start difference. First operand 1180 states and 1632 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:52,037 INFO L93 Difference]: Finished difference Result 1813 states and 2647 transitions. [2024-10-11 05:00:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:52,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:52,046 INFO L225 Difference]: With dead ends: 1813 [2024-10-11 05:00:52,047 INFO L226 Difference]: Without dead ends: 1342 [2024-10-11 05:00:52,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:52,050 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 595 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:52,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 722 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:00:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-10-11 05:00:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1180. [2024-10-11 05:00:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1028 states have (on average 1.3764591439688716) internal successors, (1415), 1045 states have internal predecessors, (1415), 93 states have call successors, (93), 50 states have call predecessors, (93), 57 states have return successors, (121), 86 states have call predecessors, (121), 90 states have call successors, (121) [2024-10-11 05:00:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1629 transitions. [2024-10-11 05:00:52,172 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1629 transitions. Word has length 82 [2024-10-11 05:00:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:52,172 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1629 transitions. [2024-10-11 05:00:52,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1629 transitions. [2024-10-11 05:00:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:52,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:52,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:52,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:00:52,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:52,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1743585790, now seen corresponding path program 1 times [2024-10-11 05:00:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:52,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140848119] [2024-10-11 05:00:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,333 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:00:52,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:52,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140848119] [2024-10-11 05:00:52,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140848119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:52,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:52,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:52,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513905696] [2024-10-11 05:00:52,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:52,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:52,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:52,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:52,335 INFO L87 Difference]: Start difference. First operand 1180 states and 1629 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:53,836 INFO L93 Difference]: Finished difference Result 2320 states and 3426 transitions. [2024-10-11 05:00:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:00:53,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:53,844 INFO L225 Difference]: With dead ends: 2320 [2024-10-11 05:00:53,844 INFO L226 Difference]: Without dead ends: 1849 [2024-10-11 05:00:53,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:00:53,845 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 900 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:53,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1227 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:00:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2024-10-11 05:00:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1487. [2024-10-11 05:00:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1297 states have (on average 1.4140323824209715) internal successors, (1834), 1316 states have internal predecessors, (1834), 117 states have call successors, (117), 62 states have call predecessors, (117), 71 states have return successors, (153), 112 states have call predecessors, (153), 114 states have call successors, (153) [2024-10-11 05:00:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2104 transitions. [2024-10-11 05:00:53,938 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2104 transitions. Word has length 82 [2024-10-11 05:00:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:53,938 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2104 transitions. [2024-10-11 05:00:53,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2104 transitions. [2024-10-11 05:00:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:53,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:53,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:53,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:00:53,941 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:53,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1797978688, now seen corresponding path program 1 times [2024-10-11 05:00:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220950240] [2024-10-11 05:00:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,053 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:00:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220950240] [2024-10-11 05:00:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220950240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928450066] [2024-10-11 05:00:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:54,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:54,055 INFO L87 Difference]: Start difference. First operand 1487 states and 2104 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:55,702 INFO L93 Difference]: Finished difference Result 3445 states and 5179 transitions. [2024-10-11 05:00:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:00:55,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:55,715 INFO L225 Difference]: With dead ends: 3445 [2024-10-11 05:00:55,715 INFO L226 Difference]: Without dead ends: 2667 [2024-10-11 05:00:55,719 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:00:55,719 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 773 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:55,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1223 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:00:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2024-10-11 05:00:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2056. [2024-10-11 05:00:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 1792 states have (on average 1.4475446428571428) internal successors, (2594), 1815 states have internal predecessors, (2594), 163 states have call successors, (163), 86 states have call predecessors, (163), 99 states have return successors, (221), 162 states have call predecessors, (221), 160 states have call successors, (221) [2024-10-11 05:00:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2978 transitions. [2024-10-11 05:00:55,935 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2978 transitions. Word has length 82 [2024-10-11 05:00:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:55,936 INFO L471 AbstractCegarLoop]: Abstraction has 2056 states and 2978 transitions. [2024-10-11 05:00:55,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2978 transitions. [2024-10-11 05:00:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:55,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:55,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:00:55,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2079592002, now seen corresponding path program 1 times [2024-10-11 05:00:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294997372] [2024-10-11 05:00:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:55,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,045 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:00:56,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:56,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294997372] [2024-10-11 05:00:56,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294997372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:56,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:56,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62673212] [2024-10-11 05:00:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:56,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:56,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:56,048 INFO L87 Difference]: Start difference. First operand 2056 states and 2978 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:56,832 INFO L93 Difference]: Finished difference Result 3777 states and 5692 transitions. [2024-10-11 05:00:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:56,842 INFO L225 Difference]: With dead ends: 3777 [2024-10-11 05:00:56,842 INFO L226 Difference]: Without dead ends: 2430 [2024-10-11 05:00:56,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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:00:56,846 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 593 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:56,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 721 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2024-10-11 05:00:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2056. [2024-10-11 05:00:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 1792 states have (on average 1.4425223214285714) internal successors, (2585), 1815 states have internal predecessors, (2585), 163 states have call successors, (163), 86 states have call predecessors, (163), 99 states have return successors, (221), 162 states have call predecessors, (221), 160 states have call successors, (221) [2024-10-11 05:00:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2969 transitions. [2024-10-11 05:00:57,010 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2969 transitions. Word has length 82 [2024-10-11 05:00:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:57,011 INFO L471 AbstractCegarLoop]: Abstraction has 2056 states and 2969 transitions. [2024-10-11 05:00:57,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2969 transitions. [2024-10-11 05:00:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:57,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:57,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:57,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:00:57,013 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1536103040, now seen corresponding path program 1 times [2024-10-11 05:00:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349488195] [2024-10-11 05:00:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:57,166 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:00:57,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:57,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349488195] [2024-10-11 05:00:57,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349488195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:57,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:57,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:57,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283300317] [2024-10-11 05:00:57,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:57,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:57,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:57,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:57,168 INFO L87 Difference]: Start difference. First operand 2056 states and 2969 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:59,332 INFO L93 Difference]: Finished difference Result 5410 states and 8175 transitions. [2024-10-11 05:00:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:00:59,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2024-10-11 05:00:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:59,353 INFO L225 Difference]: With dead ends: 5410 [2024-10-11 05:00:59,353 INFO L226 Difference]: Without dead ends: 4063 [2024-10-11 05:00:59,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:00:59,362 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 782 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:59,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 862 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:00:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2024-10-11 05:00:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 3242. [2024-10-11 05:00:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3242 states, 2834 states have (on average 1.476711362032463) internal successors, (4185), 2865 states have internal predecessors, (4185), 251 states have call successors, (251), 134 states have call predecessors, (251), 155 states have return successors, (371), 258 states have call predecessors, (371), 248 states have call successors, (371) [2024-10-11 05:00:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 4807 transitions. [2024-10-11 05:00:59,707 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 4807 transitions. Word has length 82 [2024-10-11 05:00:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:59,707 INFO L471 AbstractCegarLoop]: Abstraction has 3242 states and 4807 transitions. [2024-10-11 05:00:59,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 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:00:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 4807 transitions. [2024-10-11 05:00:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 05:00:59,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:59,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:59,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:00:59,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:59,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 425471618, now seen corresponding path program 1 times [2024-10-11 05:00:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:59,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833054962] [2024-10-11 05:00:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:00:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:00:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:00:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:00:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,803 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:00:59,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:59,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833054962] [2024-10-11 05:00:59,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833054962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:59,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:59,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:00:59,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676560117] [2024-10-11 05:00:59,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:59,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:00:59,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:59,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:00:59,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:59,804 INFO L87 Difference]: Start difference. First operand 3242 states and 4807 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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:01:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:01,350 INFO L93 Difference]: Finished difference Result 7984 states and 12202 transitions. [2024-10-11 05:01:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:01:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2024-10-11 05:01:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:01,386 INFO L225 Difference]: With dead ends: 7984 [2024-10-11 05:01:01,386 INFO L226 Difference]: Without dead ends: 5452 [2024-10-11 05:01:01,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:01:01,391 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 925 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:01,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 908 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:01:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2024-10-11 05:01:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4535. [2024-10-11 05:01:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 3955 states have (on average 1.4836915297092288) internal successors, (5868), 4003 states have internal predecessors, (5868), 361 states have call successors, (361), 188 states have call predecessors, (361), 217 states have return successors, (509), 359 states have call predecessors, (509), 358 states have call successors, (509) [2024-10-11 05:01:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6738 transitions. [2024-10-11 05:01:01,747 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6738 transitions. Word has length 82 [2024-10-11 05:01:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:01,748 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6738 transitions. [2024-10-11 05:01:01,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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:01:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6738 transitions. [2024-10-11 05:01:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:01:01,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:01,756 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-11 05:01:01,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:01:01,756 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:01,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash -293752583, now seen corresponding path program 1 times [2024-10-11 05:01:01,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:01,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872233463] [2024-10-11 05:01:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:01,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:01:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:01:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 05:01:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 05:01:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 05:01:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 05:01:01,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:01,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872233463] [2024-10-11 05:01:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872233463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:01,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284381661] [2024-10-11 05:01:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:01,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:01,833 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:01:01,834 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:01:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:01,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:01,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:01:01,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:01,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284381661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:01,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:01,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 05:01:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667360161] [2024-10-11 05:01:01,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:01,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:01:01,946 INFO L87 Difference]: Start difference. First operand 4535 states and 6738 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:01:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:02,339 INFO L93 Difference]: Finished difference Result 4816 states and 7087 transitions. [2024-10-11 05:01:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:02,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-11 05:01:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:02,355 INFO L225 Difference]: With dead ends: 4816 [2024-10-11 05:01:02,355 INFO L226 Difference]: Without dead ends: 3837 [2024-10-11 05:01:02,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:01:02,359 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 54 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:02,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 645 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:01:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2024-10-11 05:01:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3837. [2024-10-11 05:01:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3342 states have (on average 1.5275284260921604) internal successors, (5105), 3377 states have internal predecessors, (5105), 314 states have call successors, (314), 157 states have call predecessors, (314), 180 states have return successors, (437), 318 states have call predecessors, (437), 312 states have call successors, (437) [2024-10-11 05:01:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5856 transitions. [2024-10-11 05:01:02,740 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5856 transitions. Word has length 92 [2024-10-11 05:01:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:02,740 INFO L471 AbstractCegarLoop]: Abstraction has 3837 states and 5856 transitions. [2024-10-11 05:01:02,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:01:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5856 transitions. [2024-10-11 05:01:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 05:01:02,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:02,748 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, 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] [2024-10-11 05:01:02,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 05:01:02,948 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,SelfDestructingSolverStorable21 [2024-10-11 05:01:02,949 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:02,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash 202964871, now seen corresponding path program 1 times [2024-10-11 05:01:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:02,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462310924] [2024-10-11 05:01:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:01:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:01:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:01:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:01:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:01:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:01:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:01:03,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:03,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462310924] [2024-10-11 05:01:03,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462310924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:03,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377691681] [2024-10-11 05:01:03,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:03,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:03,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:03,088 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:01:03,093 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:01:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:03,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:03,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 05:01:03,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377691681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:03,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930235743] [2024-10-11 05:01:03,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:03,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:03,247 INFO L87 Difference]: Start difference. First operand 3837 states and 5856 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:03,876 INFO L93 Difference]: Finished difference Result 11406 states and 17532 transitions. [2024-10-11 05:01:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:03,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 132 [2024-10-11 05:01:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:03,903 INFO L225 Difference]: With dead ends: 11406 [2024-10-11 05:01:03,904 INFO L226 Difference]: Without dead ends: 7581 [2024-10-11 05:01:03,917 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:01:03,918 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 215 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:03,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 496 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:01:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2024-10-11 05:01:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7551. [2024-10-11 05:01:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7551 states, 6582 states have (on average 1.5232452142206017) internal successors, (10026), 6650 states have internal predecessors, (10026), 608 states have call successors, (608), 313 states have call predecessors, (608), 360 states have return successors, (841), 603 states have call predecessors, (841), 606 states have call successors, (841) [2024-10-11 05:01:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7551 states to 7551 states and 11475 transitions. [2024-10-11 05:01:04,661 INFO L78 Accepts]: Start accepts. Automaton has 7551 states and 11475 transitions. Word has length 132 [2024-10-11 05:01:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:04,661 INFO L471 AbstractCegarLoop]: Abstraction has 7551 states and 11475 transitions. [2024-10-11 05:01:04,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7551 states and 11475 transitions. [2024-10-11 05:01:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 05:01:04,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:04,671 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, 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] [2024-10-11 05:01:04,687 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:01:04,872 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,SelfDestructingSolverStorable22 [2024-10-11 05:01:04,872 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:04,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 475879591, now seen corresponding path program 1 times [2024-10-11 05:01:04,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:04,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439218002] [2024-10-11 05:01:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:04,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:04,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:01:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:01:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:04,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:01:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:01:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:01:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:01:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:01:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439218002] [2024-10-11 05:01:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439218002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137883610] [2024-10-11 05:01:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:05,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:05,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:05,007 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:01:05,008 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:01:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:05,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:05,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 05:01:05,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:05,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137883610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:05,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:05,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:05,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047528863] [2024-10-11 05:01:05,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:05,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:05,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:05,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:05,193 INFO L87 Difference]: Start difference. First operand 7551 states and 11475 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:06,581 INFO L93 Difference]: Finished difference Result 22468 states and 34393 transitions. [2024-10-11 05:01:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:06,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 132 [2024-10-11 05:01:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:06,630 INFO L225 Difference]: With dead ends: 22468 [2024-10-11 05:01:06,630 INFO L226 Difference]: Without dead ends: 14929 [2024-10-11 05:01:06,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:06,651 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 205 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:06,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 454 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14929 states. [2024-10-11 05:01:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14929 to 14873. [2024-10-11 05:01:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14873 states, 12970 states have (on average 1.5187355435620664) internal successors, (19698), 13104 states have internal predecessors, (19698), 1182 states have call successors, (1182), 625 states have call predecessors, (1182), 720 states have return successors, (1635), 1159 states have call predecessors, (1635), 1180 states have call successors, (1635) [2024-10-11 05:01:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14873 states to 14873 states and 22515 transitions. [2024-10-11 05:01:08,016 INFO L78 Accepts]: Start accepts. Automaton has 14873 states and 22515 transitions. Word has length 132 [2024-10-11 05:01:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:08,016 INFO L471 AbstractCegarLoop]: Abstraction has 14873 states and 22515 transitions. [2024-10-11 05:01:08,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 14873 states and 22515 transitions. [2024-10-11 05:01:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 05:01:08,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:08,043 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, 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] [2024-10-11 05:01:08,062 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:01:08,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:08,244 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -798451257, now seen corresponding path program 1 times [2024-10-11 05:01:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38512957] [2024-10-11 05:01:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:01:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:01:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:01:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:01:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:01:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:01:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:01:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38512957] [2024-10-11 05:01:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38512957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569085364] [2024-10-11 05:01:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:08,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:08,429 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:01:08,434 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:01:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:08,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:08,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 05:01:08,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569085364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:08,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:01:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339297812] [2024-10-11 05:01:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:08,568 INFO L87 Difference]: Start difference. First operand 14873 states and 22515 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:01:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:11,833 INFO L93 Difference]: Finished difference Result 43885 states and 67152 transitions. [2024-10-11 05:01:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:11,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 132 [2024-10-11 05:01:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:11,948 INFO L225 Difference]: With dead ends: 43885 [2024-10-11 05:01:11,948 INFO L226 Difference]: Without dead ends: 29025 [2024-10-11 05:01:11,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:11,982 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 217 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:11,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 686 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29025 states. [2024-10-11 05:01:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29025 to 29025. [2024-10-11 05:01:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29025 states, 25295 states have (on average 1.509626408381103) internal successors, (38186), 25526 states have internal predecessors, (38186), 2289 states have call successors, (2289), 1249 states have call predecessors, (2289), 1440 states have return successors, (3678), 2281 states have call predecessors, (3678), 2287 states have call successors, (3678) [2024-10-11 05:01:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29025 states to 29025 states and 44153 transitions. [2024-10-11 05:01:15,361 INFO L78 Accepts]: Start accepts. Automaton has 29025 states and 44153 transitions. Word has length 132 [2024-10-11 05:01:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:15,362 INFO L471 AbstractCegarLoop]: Abstraction has 29025 states and 44153 transitions. [2024-10-11 05:01:15,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:01:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 29025 states and 44153 transitions. [2024-10-11 05:01:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 05:01:15,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:15,527 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:15,546 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:01:15,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 05:01:15,729 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:15,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2041225473, now seen corresponding path program 1 times [2024-10-11 05:01:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:15,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499951708] [2024-10-11 05:01:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:01:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:01:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:01:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:01:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:01:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 05:01:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 05:01:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 05:01:15,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:15,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499951708] [2024-10-11 05:01:15,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499951708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:15,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099961987] [2024-10-11 05:01:15,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:15,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:15,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:15,889 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:01:15,892 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:01:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:15,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:16,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 05:01:16,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:16,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099961987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:16,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:16,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:16,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23957862] [2024-10-11 05:01:16,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:16,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:16,123 INFO L87 Difference]: Start difference. First operand 29025 states and 44153 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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:01:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:21,385 INFO L93 Difference]: Finished difference Result 86203 states and 132212 transitions. [2024-10-11 05:01:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:21,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 170 [2024-10-11 05:01:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:21,617 INFO L225 Difference]: With dead ends: 86203 [2024-10-11 05:01:21,617 INFO L226 Difference]: Without dead ends: 57197 [2024-10-11 05:01:21,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 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:01:21,696 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 160 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:21,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 454 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:01:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57197 states. [2024-10-11 05:01:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57197 to 56985. [2024-10-11 05:01:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56985 states, 49743 states have (on average 1.5056188810485898) internal successors, (74894), 50202 states have internal predecessors, (74894), 4361 states have call successors, (4361), 2497 states have call predecessors, (4361), 2880 states have return successors, (7006), 4317 states have call predecessors, (7006), 4359 states have call successors, (7006) [2024-10-11 05:01:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56985 states to 56985 states and 86261 transitions. [2024-10-11 05:01:27,542 INFO L78 Accepts]: Start accepts. Automaton has 56985 states and 86261 transitions. Word has length 170 [2024-10-11 05:01:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:27,546 INFO L471 AbstractCegarLoop]: Abstraction has 56985 states and 86261 transitions. [2024-10-11 05:01:27,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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:01:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 56985 states and 86261 transitions. [2024-10-11 05:01:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 05:01:27,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:27,754 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:27,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 05:01:27,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:27,955 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:27,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1702009955, now seen corresponding path program 1 times [2024-10-11 05:01:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362879604] [2024-10-11 05:01:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:27,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 05:01:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 05:01:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:01:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:01:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:01:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:01:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 05:01:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 05:01:28,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:28,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362879604] [2024-10-11 05:01:28,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362879604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:28,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055322007] [2024-10-11 05:01:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:28,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:28,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:28,060 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:01:28,061 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:01:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:28,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:28,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 05:01:28,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055322007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:28,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:28,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214880236] [2024-10-11 05:01:28,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:28,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:28,267 INFO L87 Difference]: Start difference. First operand 56985 states and 86261 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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:01:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:39,366 INFO L93 Difference]: Finished difference Result 169029 states and 257664 transitions. [2024-10-11 05:01:39,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:39,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 170 [2024-10-11 05:01:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:40,099 INFO L225 Difference]: With dead ends: 169029 [2024-10-11 05:01:40,099 INFO L226 Difference]: Without dead ends: 112063 [2024-10-11 05:01:40,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 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:01:40,237 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 162 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:40,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 477 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:01:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112063 states.