./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.10.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.10.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 fe6bee847a7b573239a2f60b60a87297f25c539812daa07adcb7591b7977879b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:41:38,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:41:39,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:41:39,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:41:39,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:41:39,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:41:39,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:41:39,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:41:39,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:41:39,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:41:39,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:41:39,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:41:39,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:41:39,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:41:39,087 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:41:39,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:41:39,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:41:39,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:41:39,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:41:39,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:41:39,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:41:39,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:41:39,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:41:39,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:41:39,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:41:39,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:41:39,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:41:39,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:41:39,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:41:39,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:41:39,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:41:39,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:41:39,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:41:39,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:41:39,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:41:39,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:41:39,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:41:39,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:41:39,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:41:39,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:41:39,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:41:39,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:41:39,097 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/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/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 -> fe6bee847a7b573239a2f60b60a87297f25c539812daa07adcb7591b7977879b [2024-10-12 21:41:39,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:41:39,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:41:39,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:41:39,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:41:39,427 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:41:39,428 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.10.cil-1.c [2024-10-12 21:41:40,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:41:41,127 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:41:41,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.10.cil-1.c [2024-10-12 21:41:41,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092a78c18/0634543766dc442c8d41fbc405269483/FLAGbdcf7a30e [2024-10-12 21:41:41,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092a78c18/0634543766dc442c8d41fbc405269483 [2024-10-12 21:41:41,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:41:41,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:41:41,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:41:41,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:41:41,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:41:41,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f29d206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41, skipping insertion in model container [2024-10-12 21:41:41,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:41:41,410 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.10.cil-1.c[913,926] [2024-10-12 21:41:41,475 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.10.cil-1.c[5977,5990] [2024-10-12 21:41:41,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:41:41,621 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:41:41,633 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.10.cil-1.c[913,926] [2024-10-12 21:41:41,646 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.10.cil-1.c[5977,5990] [2024-10-12 21:41:41,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:41:41,747 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:41:41,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41 WrapperNode [2024-10-12 21:41:41,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:41:41,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:41:41,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:41:41,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:41:41,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,829 INFO L138 Inliner]: procedures = 68, calls = 79, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 969 [2024-10-12 21:41:41,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:41:41,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:41:41,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:41:41,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:41:41,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,894 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-12 21:41:41,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:41:41,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:41:41,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:41:41,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:41:41,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (1/1) ... [2024-10-12 21:41:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:41:41,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:41,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:41:41,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:41:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:41:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:41:42,030 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:41:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-12 21:41:42,031 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-12 21:41:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:41:42,032 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:41:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:41:42,032 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:41:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:41:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:41:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:41:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:41:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:41:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:41:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:41:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:41:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:41:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:41:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:41:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:41:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:41:42,035 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:41:42,035 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:41:42,244 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:41:42,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:41:43,197 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-10-12 21:41:43,197 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:41:43,276 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:41:43,277 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-12 21:41:43,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:41:43 BoogieIcfgContainer [2024-10-12 21:41:43,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:41:43,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:41:43,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:41:43,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:41:43,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:41:41" (1/3) ... [2024-10-12 21:41:43,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ba26ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:41:43, skipping insertion in model container [2024-10-12 21:41:43,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:41" (2/3) ... [2024-10-12 21:41:43,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ba26ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:41:43, skipping insertion in model container [2024-10-12 21:41:43,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:41:43" (3/3) ... [2024-10-12 21:41:43,292 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.10.cil-1.c [2024-10-12 21:41:43,312 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:41:43,312 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:41:43,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:41:43,405 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;@59e18349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:41:43,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:41:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 373 states, 328 states have (on average 1.7225609756097562) internal successors, (565), 335 states have internal predecessors, (565), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-12 21:41:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:41:43,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:43,423 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-12 21:41:43,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2128058392, now seen corresponding path program 1 times [2024-10-12 21:41:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:43,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158571892] [2024-10-12 21:41:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:43,778 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-12 21:41:43,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:43,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158571892] [2024-10-12 21:41:43,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158571892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:43,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:43,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:43,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499755818] [2024-10-12 21:41:43,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:43,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:43,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:43,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:43,826 INFO L87 Difference]: Start difference. First operand has 373 states, 328 states have (on average 1.7225609756097562) internal successors, (565), 335 states have internal predecessors, (565), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 21:41:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:44,593 INFO L93 Difference]: Finished difference Result 734 states and 1234 transitions. [2024-10-12 21:41:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:44,597 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), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-12 21:41:44,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:44,611 INFO L225 Difference]: With dead ends: 734 [2024-10-12 21:41:44,612 INFO L226 Difference]: Without dead ends: 375 [2024-10-12 21:41:44,619 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-12 21:41:44,622 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 326 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:44,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 820 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:41:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-12 21:41:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2024-10-12 21:41:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 325 states have (on average 1.6092307692307692) internal successors, (523), 329 states have internal predecessors, (523), 32 states have call successors, (32), 10 states have call predecessors, (32), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-12 21:41:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 583 transitions. [2024-10-12 21:41:44,717 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 583 transitions. Word has length 37 [2024-10-12 21:41:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:44,718 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 583 transitions. [2024-10-12 21:41:44,718 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), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 21:41:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 583 transitions. [2024-10-12 21:41:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:41:44,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:44,720 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-12 21:41:44,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:41:44,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:44,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1284052890, now seen corresponding path program 1 times [2024-10-12 21:41:44,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:44,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080894321] [2024-10-12 21:41:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:44,832 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-12 21:41:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080894321] [2024-10-12 21:41:44,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080894321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:44,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:44,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:44,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772024466] [2024-10-12 21:41:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:44,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:44,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:44,837 INFO L87 Difference]: Start difference. First operand 367 states and 583 transitions. 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-12 21:41:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:45,352 INFO L93 Difference]: Finished difference Result 484 states and 753 transitions. [2024-10-12 21:41:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:45,353 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-12 21:41:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:45,356 INFO L225 Difference]: With dead ends: 484 [2024-10-12 21:41:45,357 INFO L226 Difference]: Without dead ends: 428 [2024-10-12 21:41:45,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-12 21:41:45,360 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 780 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:45,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 641 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-12 21:41:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 422. [2024-10-12 21:41:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 373 states have (on average 1.581769436997319) internal successors, (590), 378 states have internal predecessors, (590), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2024-10-12 21:41:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 664 transitions. [2024-10-12 21:41:45,412 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 664 transitions. Word has length 37 [2024-10-12 21:41:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:45,413 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 664 transitions. [2024-10-12 21:41:45,413 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-12 21:41:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 664 transitions. [2024-10-12 21:41:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 21:41:45,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:45,417 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-12 21:41:45,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:41:45,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1913421637, now seen corresponding path program 1 times [2024-10-12 21:41:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:45,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980033532] [2024-10-12 21:41:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:45,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:45,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:41:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:45,513 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-12 21:41:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980033532] [2024-10-12 21:41:45,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980033532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:45,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384598181] [2024-10-12 21:41:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:45,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:45,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:45,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:45,516 INFO L87 Difference]: Start difference. First operand 422 states and 664 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-12 21:41:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:45,984 INFO L93 Difference]: Finished difference Result 656 states and 1008 transitions. [2024-10-12 21:41:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:45,984 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-12 21:41:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:45,988 INFO L225 Difference]: With dead ends: 656 [2024-10-12 21:41:45,988 INFO L226 Difference]: Without dead ends: 545 [2024-10-12 21:41:45,989 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-12 21:41:45,990 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 797 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:45,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 648 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:41:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-12 21:41:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 522. [2024-10-12 21:41:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 460 states have (on average 1.5391304347826087) internal successors, (708), 466 states have internal predecessors, (708), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (52), 40 states have call predecessors, (52), 40 states have call successors, (52) [2024-10-12 21:41:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 804 transitions. [2024-10-12 21:41:46,027 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 804 transitions. Word has length 38 [2024-10-12 21:41:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:46,027 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 804 transitions. [2024-10-12 21:41:46,027 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-12 21:41:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 804 transitions. [2024-10-12 21:41:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 21:41:46,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:46,029 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-12 21:41:46,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:41:46,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:46,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -252467639, now seen corresponding path program 1 times [2024-10-12 21:41:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50744916] [2024-10-12 21:41:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 21:41:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50744916] [2024-10-12 21:41:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50744916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:46,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289927113] [2024-10-12 21:41:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:46,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:46,118 INFO L87 Difference]: Start difference. First operand 522 states and 804 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-12 21:41:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:46,736 INFO L93 Difference]: Finished difference Result 922 states and 1355 transitions. [2024-10-12 21:41:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:46,736 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-12 21:41:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:46,741 INFO L225 Difference]: With dead ends: 922 [2024-10-12 21:41:46,741 INFO L226 Difference]: Without dead ends: 711 [2024-10-12 21:41:46,742 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-12 21:41:46,743 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 305 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:46,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 916 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-12 21:41:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 607. [2024-10-12 21:41:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 536 states have (on average 1.5167910447761195) internal successors, (813), 544 states have internal predecessors, (813), 48 states have call successors, (48), 21 states have call predecessors, (48), 21 states have return successors, (54), 42 states have call predecessors, (54), 44 states have call successors, (54) [2024-10-12 21:41:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 915 transitions. [2024-10-12 21:41:46,790 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 915 transitions. Word has length 39 [2024-10-12 21:41:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:46,791 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 915 transitions. [2024-10-12 21:41:46,791 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-12 21:41:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 915 transitions. [2024-10-12 21:41:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 21:41:46,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:46,794 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-12 21:41:46,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:41:46,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:46,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1206059197, now seen corresponding path program 1 times [2024-10-12 21:41:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:46,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247429884] [2024-10-12 21:41:46,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:46,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 21:41:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:46,909 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-12 21:41:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247429884] [2024-10-12 21:41:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247429884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:46,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:46,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141156881] [2024-10-12 21:41:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:46,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:46,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:46,912 INFO L87 Difference]: Start difference. First operand 607 states and 915 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-12 21:41:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:47,498 INFO L93 Difference]: Finished difference Result 1084 states and 1572 transitions. [2024-10-12 21:41:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:47,499 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-12 21:41:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:47,506 INFO L225 Difference]: With dead ends: 1084 [2024-10-12 21:41:47,507 INFO L226 Difference]: Without dead ends: 788 [2024-10-12 21:41:47,509 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-12 21:41:47,512 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 294 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:47,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 961 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-12 21:41:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 754. [2024-10-12 21:41:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 662 states have (on average 1.4637462235649548) internal successors, (969), 672 states have internal predecessors, (969), 60 states have call successors, (60), 28 states have call predecessors, (60), 30 states have return successors, (74), 54 states have call predecessors, (74), 56 states have call successors, (74) [2024-10-12 21:41:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1103 transitions. [2024-10-12 21:41:47,593 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1103 transitions. Word has length 54 [2024-10-12 21:41:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:47,593 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1103 transitions. [2024-10-12 21:41:47,594 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-12 21:41:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1103 transitions. [2024-10-12 21:41:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:41:47,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:47,596 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-12 21:41:47,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:41:47,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2005994393, now seen corresponding path program 1 times [2024-10-12 21:41:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292033985] [2024-10-12 21:41:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:41:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:41:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,687 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-12 21:41:47,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:47,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292033985] [2024-10-12 21:41:47,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292033985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:47,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:47,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:47,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845017697] [2024-10-12 21:41:47,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:47,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:47,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:47,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:47,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:47,690 INFO L87 Difference]: Start difference. First operand 754 states and 1103 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-12 21:41:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:48,125 INFO L93 Difference]: Finished difference Result 1312 states and 1854 transitions. [2024-10-12 21:41:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:48,126 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-12 21:41:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:48,130 INFO L225 Difference]: With dead ends: 1312 [2024-10-12 21:41:48,130 INFO L226 Difference]: Without dead ends: 910 [2024-10-12 21:41:48,132 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-12 21:41:48,133 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 776 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:48,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 660 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:41:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-10-12 21:41:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 861. [2024-10-12 21:41:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 756 states have (on average 1.4312169312169312) internal successors, (1082), 768 states have internal predecessors, (1082), 66 states have call successors, (66), 33 states have call predecessors, (66), 37 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2024-10-12 21:41:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1232 transitions. [2024-10-12 21:41:48,184 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1232 transitions. Word has length 59 [2024-10-12 21:41:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:48,184 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1232 transitions. [2024-10-12 21:41:48,184 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-12 21:41:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1232 transitions. [2024-10-12 21:41:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:48,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:48,188 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-12 21:41:48,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:41:48,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:48,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1062118076, now seen corresponding path program 1 times [2024-10-12 21:41:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:48,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964204117] [2024-10-12 21:41:48,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,302 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-12 21:41:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964204117] [2024-10-12 21:41:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964204117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751484674] [2024-10-12 21:41:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:48,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:48,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:48,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:48,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:41:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:48,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:41:48,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:48,474 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-12 21:41:48,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:48,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751484674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:48,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:48,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:41:48,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94314542] [2024-10-12 21:41:48,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:48,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:48,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:48,480 INFO L87 Difference]: Start difference. First operand 861 states and 1232 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-12 21:41:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:48,668 INFO L93 Difference]: Finished difference Result 1349 states and 1906 transitions. [2024-10-12 21:41:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:41:48,668 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-12 21:41:48,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:48,674 INFO L225 Difference]: With dead ends: 1349 [2024-10-12 21:41:48,674 INFO L226 Difference]: Without dead ends: 866 [2024-10-12 21:41:48,675 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-12 21:41:48,676 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 0 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:48,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1606 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-10-12 21:41:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2024-10-12 21:41:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 761 states have (on average 1.4178712220762155) internal successors, (1079), 773 states have internal predecessors, (1079), 66 states have call successors, (66), 33 states have call predecessors, (66), 37 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2024-10-12 21:41:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1229 transitions. [2024-10-12 21:41:48,724 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1229 transitions. Word has length 60 [2024-10-12 21:41:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:48,725 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1229 transitions. [2024-10-12 21:41:48,726 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-12 21:41:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1229 transitions. [2024-10-12 21:41:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:48,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:48,731 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-12 21:41:48,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:41:48,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:48,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:48,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1906123578, now seen corresponding path program 1 times [2024-10-12 21:41:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848493745] [2024-10-12 21:41:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,049 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-12 21:41:49,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848493745] [2024-10-12 21:41:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848493745] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240212364] [2024-10-12 21:41:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:49,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:49,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:49,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:49,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:41:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:41:49,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:49,172 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-12 21:41:49,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:49,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240212364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:49,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:49,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:41:49,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241734243] [2024-10-12 21:41:49,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:49,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:49,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:49,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:49,175 INFO L87 Difference]: Start difference. First operand 866 states and 1229 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-12 21:41:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:49,304 INFO L93 Difference]: Finished difference Result 1292 states and 1808 transitions. [2024-10-12 21:41:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:41:49,305 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-12 21:41:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:49,309 INFO L225 Difference]: With dead ends: 1292 [2024-10-12 21:41:49,309 INFO L226 Difference]: Without dead ends: 782 [2024-10-12 21:41:49,311 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-12 21:41:49,312 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 0 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:49,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1606 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-12 21:41:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 775. [2024-10-12 21:41:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 685 states have (on average 1.4262773722627737) internal successors, (977), 695 states have internal predecessors, (977), 58 states have call successors, (58), 28 states have call predecessors, (58), 30 states have return successors, (69), 52 states have call predecessors, (69), 54 states have call successors, (69) [2024-10-12 21:41:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1104 transitions. [2024-10-12 21:41:49,360 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1104 transitions. Word has length 60 [2024-10-12 21:41:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:49,361 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1104 transitions. [2024-10-12 21:41:49,361 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-12 21:41:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1104 transitions. [2024-10-12 21:41:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:49,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:49,362 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-12 21:41:49,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:41:49,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-12 21:41:49,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -108483962, now seen corresponding path program 1 times [2024-10-12 21:41:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:49,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039439006] [2024-10-12 21:41:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:49,680 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-12 21:41:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039439006] [2024-10-12 21:41:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039439006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:49,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:41:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499244128] [2024-10-12 21:41:49,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:49,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:41:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:49,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:41:49,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:49,684 INFO L87 Difference]: Start difference. First operand 775 states and 1104 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-12 21:41:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:50,225 INFO L93 Difference]: Finished difference Result 860 states and 1207 transitions. [2024-10-12 21:41:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:41:50,225 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-12 21:41:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:50,230 INFO L225 Difference]: With dead ends: 860 [2024-10-12 21:41:50,230 INFO L226 Difference]: Without dead ends: 857 [2024-10-12 21:41:50,230 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-12 21:41:50,231 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1306 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:50,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 658 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:50,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-10-12 21:41:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 774. [2024-10-12 21:41:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 685 states have (on average 1.4233576642335766) internal successors, (975), 694 states have internal predecessors, (975), 57 states have call successors, (57), 28 states have call predecessors, (57), 30 states have return successors, (69), 52 states have call predecessors, (69), 54 states have call successors, (69) [2024-10-12 21:41:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1101 transitions. [2024-10-12 21:41:50,271 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1101 transitions. Word has length 60 [2024-10-12 21:41:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:50,272 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1101 transitions. [2024-10-12 21:41:50,272 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-12 21:41:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1101 transitions. [2024-10-12 21:41:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:41:50,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:50,274 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-12 21:41:50,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:41:50,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:50,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 930679752, now seen corresponding path program 1 times [2024-10-12 21:41:50,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:50,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304291807] [2024-10-12 21:41:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,448 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-12 21:41:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:50,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304291807] [2024-10-12 21:41:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304291807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:50,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954460833] [2024-10-12 21:41:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:50,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:50,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:50,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:41:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:50,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:41:50,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:50,813 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-12 21:41:50,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:41:50,886 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-12 21:41:50,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954460833] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:41:50,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:41:50,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-12 21:41:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871744531] [2024-10-12 21:41:50,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:41:50,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:41:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:50,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:41:50,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:50,889 INFO L87 Difference]: Start difference. First operand 774 states and 1101 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-12 21:41:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:51,804 INFO L93 Difference]: Finished difference Result 1577 states and 2136 transitions. [2024-10-12 21:41:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:41:51,804 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-12 21:41:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:51,812 INFO L225 Difference]: With dead ends: 1577 [2024-10-12 21:41:51,812 INFO L226 Difference]: Without dead ends: 1574 [2024-10-12 21:41:51,813 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-12 21:41:51,813 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1436 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:51,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1497 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:41:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-10-12 21:41:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1077. [2024-10-12 21:41:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 952 states have (on average 1.3876050420168067) internal successors, (1321), 967 states have internal predecessors, (1321), 76 states have call successors, (76), 41 states have call predecessors, (76), 47 states have return successors, (99), 69 states have call predecessors, (99), 73 states have call successors, (99) [2024-10-12 21:41:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1496 transitions. [2024-10-12 21:41:51,911 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1496 transitions. Word has length 61 [2024-10-12 21:41:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:51,911 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1496 transitions. [2024-10-12 21:41:51,912 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-12 21:41:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1496 transitions. [2024-10-12 21:41:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:41:51,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:51,914 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-12 21:41:51,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 21:41:52,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:52,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:52,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1814252762, now seen corresponding path program 2 times [2024-10-12 21:41:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:52,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770478184] [2024-10-12 21:41:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:52,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 21:41:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,177 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-12 21:41:52,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770478184] [2024-10-12 21:41:52,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770478184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:52,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:52,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:52,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178654056] [2024-10-12 21:41:52,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:52,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:52,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:52,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:52,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:52,179 INFO L87 Difference]: Start difference. First operand 1077 states and 1496 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-12 21:41:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:52,659 INFO L93 Difference]: Finished difference Result 1705 states and 2313 transitions. [2024-10-12 21:41:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:52,659 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-12 21:41:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:52,665 INFO L225 Difference]: With dead ends: 1705 [2024-10-12 21:41:52,665 INFO L226 Difference]: Without dead ends: 1046 [2024-10-12 21:41:52,667 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-12 21:41:52,667 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 799 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:52,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 674 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:41:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-10-12 21:41:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 969. [2024-10-12 21:41:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 857 states have (on average 1.3920653442240374) internal successors, (1193), 872 states have internal predecessors, (1193), 69 states have call successors, (69), 36 states have call predecessors, (69), 41 states have return successors, (88), 61 states have call predecessors, (88), 66 states have call successors, (88) [2024-10-12 21:41:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1350 transitions. [2024-10-12 21:41:52,721 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1350 transitions. Word has length 78 [2024-10-12 21:41:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:52,721 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1350 transitions. [2024-10-12 21:41:52,721 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-12 21:41:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1350 transitions. [2024-10-12 21:41:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:52,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:52,724 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-12 21:41:52,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:41:52,724 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:52,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:52,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2059529315, now seen corresponding path program 1 times [2024-10-12 21:41:52,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739467078] [2024-10-12 21:41:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 21:41:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 21:41:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 21:41:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,829 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-12 21:41:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739467078] [2024-10-12 21:41:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739467078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770089408] [2024-10-12 21:41:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:52,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:52,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:41:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:41:52,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:52,977 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-12 21:41:52,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:52,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770089408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:52,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:52,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:41:52,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547448394] [2024-10-12 21:41:52,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:52,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:41:52,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:52,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:41:52,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:52,979 INFO L87 Difference]: Start difference. First operand 969 states and 1350 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-12 21:41:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:53,091 INFO L93 Difference]: Finished difference Result 1192 states and 1636 transitions. [2024-10-12 21:41:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:41:53,092 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-12 21:41:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:53,094 INFO L225 Difference]: With dead ends: 1192 [2024-10-12 21:41:53,095 INFO L226 Difference]: Without dead ends: 308 [2024-10-12 21:41:53,096 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-12 21:41:53,097 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 53 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:53,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1085 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-12 21:41:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-12 21:41:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 275 states have (on average 1.6327272727272728) internal successors, (449), 277 states have internal predecessors, (449), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 21:41:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 499 transitions. [2024-10-12 21:41:53,114 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 499 transitions. Word has length 92 [2024-10-12 21:41:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:53,114 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 499 transitions. [2024-10-12 21:41:53,114 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-12 21:41:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 499 transitions. [2024-10-12 21:41:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:41:53,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:53,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:41:53,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:41:53,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:53,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 423959296, now seen corresponding path program 1 times [2024-10-12 21:41:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150356275] [2024-10-12 21:41:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:41:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:41:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:41:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,483 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-12 21:41:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150356275] [2024-10-12 21:41:53,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150356275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:41:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918645478] [2024-10-12 21:41:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:41:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:41:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:53,487 INFO L87 Difference]: Start difference. First operand 308 states and 499 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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-12 21:41:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:55,004 INFO L93 Difference]: Finished difference Result 720 states and 1186 transitions. [2024-10-12 21:41:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:41:55,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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 142 [2024-10-12 21:41:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:55,008 INFO L225 Difference]: With dead ends: 720 [2024-10-12 21:41:55,008 INFO L226 Difference]: Without dead ends: 418 [2024-10-12 21:41:55,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:55,010 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 848 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:55,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 569 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:41:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-12 21:41:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 308. [2024-10-12 21:41:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 275 states have (on average 1.6290909090909091) internal successors, (448), 277 states have internal predecessors, (448), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 21:41:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 498 transitions. [2024-10-12 21:41:55,033 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 498 transitions. Word has length 142 [2024-10-12 21:41:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:55,033 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 498 transitions. [2024-10-12 21:41:55,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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-12 21:41:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 498 transitions. [2024-10-12 21:41:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:41:55,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:55,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:41:55,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:41:55,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:55,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -974994306, now seen corresponding path program 1 times [2024-10-12 21:41:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:55,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640955052] [2024-10-12 21:41:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:41:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:41:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:41:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,246 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-12 21:41:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:55,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640955052] [2024-10-12 21:41:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640955052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:55,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:41:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434183779] [2024-10-12 21:41:55,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:55,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:41:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:41:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:55,250 INFO L87 Difference]: Start difference. First operand 308 states and 498 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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-12 21:41:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:56,706 INFO L93 Difference]: Finished difference Result 712 states and 1169 transitions. [2024-10-12 21:41:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:41:56,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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 142 [2024-10-12 21:41:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:56,710 INFO L225 Difference]: With dead ends: 712 [2024-10-12 21:41:56,710 INFO L226 Difference]: Without dead ends: 418 [2024-10-12 21:41:56,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:56,711 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 839 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:56,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 567 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:41:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-12 21:41:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 308. [2024-10-12 21:41:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 275 states have (on average 1.6254545454545455) internal successors, (447), 277 states have internal predecessors, (447), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 21:41:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 497 transitions. [2024-10-12 21:41:56,736 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 497 transitions. Word has length 142 [2024-10-12 21:41:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:56,736 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 497 transitions. [2024-10-12 21:41:56,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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-12 21:41:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 497 transitions. [2024-10-12 21:41:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:41:56,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:56,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:41:56,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:41:56,738 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:56,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash -540488708, now seen corresponding path program 1 times [2024-10-12 21:41:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710191553] [2024-10-12 21:41:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:56,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:41:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:41:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:41:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,985 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-12 21:41:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710191553] [2024-10-12 21:41:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710191553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:56,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:56,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:41:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215333011] [2024-10-12 21:41:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:56,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:41:56,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:56,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:41:56,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:56,988 INFO L87 Difference]: Start difference. First operand 308 states and 497 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 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-12 21:41:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:59,384 INFO L93 Difference]: Finished difference Result 1125 states and 1859 transitions. [2024-10-12 21:41:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:41:59,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 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 142 [2024-10-12 21:41:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:59,390 INFO L225 Difference]: With dead ends: 1125 [2024-10-12 21:41:59,390 INFO L226 Difference]: Without dead ends: 834 [2024-10-12 21:41:59,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:41:59,392 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 1274 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:59,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 957 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:41:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-12 21:41:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 613. [2024-10-12 21:41:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 554 states have (on average 1.6371841155234657) internal successors, (907), 557 states have internal predecessors, (907), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2024-10-12 21:41:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 998 transitions. [2024-10-12 21:41:59,433 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 998 transitions. Word has length 142 [2024-10-12 21:41:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:59,433 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 998 transitions. [2024-10-12 21:41:59,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 4 states have internal predecessors, (131), 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-12 21:41:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 998 transitions. [2024-10-12 21:41:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:41:59,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:59,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:41:59,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:41:59,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:59,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:59,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1050462404, now seen corresponding path program 1 times [2024-10-12 21:41:59,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:59,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905103463] [2024-10-12 21:41:59,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:59,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:41:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:59,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:41:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:41:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:59,729 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-12 21:41:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:59,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905103463] [2024-10-12 21:41:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905103463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:59,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443392653] [2024-10-12 21:41:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:59,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:59,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:59,733 INFO L87 Difference]: Start difference. First operand 613 states and 998 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:02,702 INFO L93 Difference]: Finished difference Result 1860 states and 3077 transitions. [2024-10-12 21:42:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:02,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:02,710 INFO L225 Difference]: With dead ends: 1860 [2024-10-12 21:42:02,710 INFO L226 Difference]: Without dead ends: 1264 [2024-10-12 21:42:02,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:02,712 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1309 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3196 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:02,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1827 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3196 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 21:42:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2024-10-12 21:42:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 895. [2024-10-12 21:42:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 810 states have (on average 1.6308641975308642) internal successors, (1321), 814 states have internal predecessors, (1321), 64 states have call successors, (64), 19 states have call predecessors, (64), 20 states have return successors, (67), 63 states have call predecessors, (67), 62 states have call successors, (67) [2024-10-12 21:42:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1452 transitions. [2024-10-12 21:42:02,794 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1452 transitions. Word has length 142 [2024-10-12 21:42:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:02,795 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1452 transitions. [2024-10-12 21:42:02,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1452 transitions. [2024-10-12 21:42:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:02,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:02,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:02,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:42:02,797 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:02,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1194095994, now seen corresponding path program 1 times [2024-10-12 21:42:02,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:02,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362959809] [2024-10-12 21:42:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,054 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-12 21:42:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362959809] [2024-10-12 21:42:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362959809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:03,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:03,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:03,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264634808] [2024-10-12 21:42:03,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:03,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:03,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:03,057 INFO L87 Difference]: Start difference. First operand 895 states and 1452 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:04,302 INFO L93 Difference]: Finished difference Result 2154 states and 3563 transitions. [2024-10-12 21:42:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:04,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:04,309 INFO L225 Difference]: With dead ends: 2154 [2024-10-12 21:42:04,309 INFO L226 Difference]: Without dead ends: 1276 [2024-10-12 21:42:04,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:04,312 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1143 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:04,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 779 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:42:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-10-12 21:42:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 895. [2024-10-12 21:42:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 810 states have (on average 1.6271604938271604) internal successors, (1318), 814 states have internal predecessors, (1318), 64 states have call successors, (64), 19 states have call predecessors, (64), 20 states have return successors, (67), 63 states have call predecessors, (67), 62 states have call successors, (67) [2024-10-12 21:42:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1449 transitions. [2024-10-12 21:42:04,380 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1449 transitions. Word has length 142 [2024-10-12 21:42:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:04,381 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1449 transitions. [2024-10-12 21:42:04,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1449 transitions. [2024-10-12 21:42:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:04,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:04,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:04,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:42:04,384 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:04,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash 101460792, now seen corresponding path program 1 times [2024-10-12 21:42:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:04,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181580228] [2024-10-12 21:42:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:04,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:04,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:04,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:04,614 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-12 21:42:04,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:04,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181580228] [2024-10-12 21:42:04,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181580228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:04,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:04,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:04,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762501689] [2024-10-12 21:42:04,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:04,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:04,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:04,617 INFO L87 Difference]: Start difference. First operand 895 states and 1449 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:05,878 INFO L93 Difference]: Finished difference Result 2150 states and 3546 transitions. [2024-10-12 21:42:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:05,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:05,886 INFO L225 Difference]: With dead ends: 2150 [2024-10-12 21:42:05,886 INFO L226 Difference]: Without dead ends: 1272 [2024-10-12 21:42:05,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:05,890 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1067 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:05,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 780 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:42:05,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-10-12 21:42:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 895. [2024-10-12 21:42:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 810 states have (on average 1.623456790123457) internal successors, (1315), 814 states have internal predecessors, (1315), 64 states have call successors, (64), 19 states have call predecessors, (64), 20 states have return successors, (67), 63 states have call predecessors, (67), 62 states have call successors, (67) [2024-10-12 21:42:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1446 transitions. [2024-10-12 21:42:05,972 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1446 transitions. Word has length 142 [2024-10-12 21:42:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:05,973 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1446 transitions. [2024-10-12 21:42:05,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1446 transitions. [2024-10-12 21:42:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:05,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:05,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:05,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:42:05,975 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:05,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1180711494, now seen corresponding path program 1 times [2024-10-12 21:42:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:05,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441452103] [2024-10-12 21:42:05,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:06,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:06,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:06,193 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-12 21:42:06,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:06,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441452103] [2024-10-12 21:42:06,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441452103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:06,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:06,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276446352] [2024-10-12 21:42:06,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:06,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:06,197 INFO L87 Difference]: Start difference. First operand 895 states and 1446 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:07,770 INFO L93 Difference]: Finished difference Result 2146 states and 3529 transitions. [2024-10-12 21:42:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:07,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:07,776 INFO L225 Difference]: With dead ends: 2146 [2024-10-12 21:42:07,777 INFO L226 Difference]: Without dead ends: 1268 [2024-10-12 21:42:07,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:07,780 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 934 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:07,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 929 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:42:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-10-12 21:42:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 895. [2024-10-12 21:42:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 810 states have (on average 1.6197530864197531) internal successors, (1312), 814 states have internal predecessors, (1312), 64 states have call successors, (64), 19 states have call predecessors, (64), 20 states have return successors, (67), 63 states have call predecessors, (67), 62 states have call successors, (67) [2024-10-12 21:42:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1443 transitions. [2024-10-12 21:42:07,851 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1443 transitions. Word has length 142 [2024-10-12 21:42:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:07,851 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1443 transitions. [2024-10-12 21:42:07,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1443 transitions. [2024-10-12 21:42:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:07,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:07,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:07,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:42:07,854 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:07,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1271780088, now seen corresponding path program 1 times [2024-10-12 21:42:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073786001] [2024-10-12 21:42:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:08,100 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-12 21:42:08,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073786001] [2024-10-12 21:42:08,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073786001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:08,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:08,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657126479] [2024-10-12 21:42:08,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:08,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:08,105 INFO L87 Difference]: Start difference. First operand 895 states and 1443 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:10,924 INFO L93 Difference]: Finished difference Result 2924 states and 4785 transitions. [2024-10-12 21:42:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:10,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:10,935 INFO L225 Difference]: With dead ends: 2924 [2024-10-12 21:42:10,935 INFO L226 Difference]: Without dead ends: 2046 [2024-10-12 21:42:10,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:10,941 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1282 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3100 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 3163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:10,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 1825 Invalid, 3163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3100 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:42:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2024-10-12 21:42:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1472. [2024-10-12 21:42:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1335 states have (on average 1.6127340823970038) internal successors, (2153), 1341 states have internal predecessors, (2153), 102 states have call successors, (102), 31 states have call predecessors, (102), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-10-12 21:42:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2368 transitions. [2024-10-12 21:42:11,084 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2368 transitions. Word has length 142 [2024-10-12 21:42:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:11,084 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 2368 transitions. [2024-10-12 21:42:11,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2368 transitions. [2024-10-12 21:42:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:11,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:11,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:11,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:42:11,088 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:11,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -450222598, now seen corresponding path program 1 times [2024-10-12 21:42:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647205724] [2024-10-12 21:42:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,317 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-12 21:42:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647205724] [2024-10-12 21:42:11,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647205724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:11,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:11,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61644192] [2024-10-12 21:42:11,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:11,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:11,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:11,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:11,321 INFO L87 Difference]: Start difference. First operand 1472 states and 2368 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:12,860 INFO L93 Difference]: Finished difference Result 3486 states and 5696 transitions. [2024-10-12 21:42:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:12,871 INFO L225 Difference]: With dead ends: 3486 [2024-10-12 21:42:12,872 INFO L226 Difference]: Without dead ends: 2031 [2024-10-12 21:42:12,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:12,877 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 933 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:12,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 929 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:42:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2024-10-12 21:42:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1472. [2024-10-12 21:42:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1335 states have (on average 1.6089887640449438) internal successors, (2148), 1341 states have internal predecessors, (2148), 102 states have call successors, (102), 31 states have call predecessors, (102), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-10-12 21:42:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2363 transitions. [2024-10-12 21:42:13,010 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2363 transitions. Word has length 142 [2024-10-12 21:42:13,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:13,011 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 2363 transitions. [2024-10-12 21:42:13,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2363 transitions. [2024-10-12 21:42:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:13,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:13,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:42:13,013 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:13,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash -782865736, now seen corresponding path program 1 times [2024-10-12 21:42:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:13,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70660050] [2024-10-12 21:42:13,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:13,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,256 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-12 21:42:13,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:13,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70660050] [2024-10-12 21:42:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70660050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:13,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:13,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:13,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597570050] [2024-10-12 21:42:13,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:13,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:13,259 INFO L87 Difference]: Start difference. First operand 1472 states and 2363 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:16,319 INFO L93 Difference]: Finished difference Result 4991 states and 8114 transitions. [2024-10-12 21:42:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:16,334 INFO L225 Difference]: With dead ends: 4991 [2024-10-12 21:42:16,334 INFO L226 Difference]: Without dead ends: 3536 [2024-10-12 21:42:16,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:16,340 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1274 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3062 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:16,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 1825 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3062 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 21:42:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2024-10-12 21:42:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2626. [2024-10-12 21:42:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2385 states have (on average 1.60167714884696) internal successors, (3820), 2395 states have internal predecessors, (3820), 178 states have call successors, (178), 55 states have call predecessors, (178), 62 states have return successors, (211), 183 states have call predecessors, (211), 176 states have call successors, (211) [2024-10-12 21:42:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4209 transitions. [2024-10-12 21:42:16,570 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4209 transitions. Word has length 142 [2024-10-12 21:42:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:16,570 INFO L471 AbstractCegarLoop]: Abstraction has 2626 states and 4209 transitions. [2024-10-12 21:42:16,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4209 transitions. [2024-10-12 21:42:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:16,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:16,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:16,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:42:16,574 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:16,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1146066490, now seen corresponding path program 1 times [2024-10-12 21:42:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618936550] [2024-10-12 21:42:16,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,823 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-12 21:42:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618936550] [2024-10-12 21:42:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618936550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:16,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200255873] [2024-10-12 21:42:16,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:16,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:16,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:16,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:16,826 INFO L87 Difference]: Start difference. First operand 2626 states and 4209 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:19,968 INFO L93 Difference]: Finished difference Result 9131 states and 14826 transitions. [2024-10-12 21:42:19,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:19,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:19,991 INFO L225 Difference]: With dead ends: 9131 [2024-10-12 21:42:19,991 INFO L226 Difference]: Without dead ends: 6522 [2024-10-12 21:42:20,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:20,001 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 1279 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3044 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:20,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1825 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3044 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:42:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6522 states. [2024-10-12 21:42:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6522 to 4939. [2024-10-12 21:42:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4490 states have (on average 1.5968819599109132) internal successors, (7170), 4508 states have internal predecessors, (7170), 330 states have call successors, (330), 103 states have call predecessors, (330), 118 states have return successors, (425), 343 states have call predecessors, (425), 328 states have call successors, (425) [2024-10-12 21:42:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 7925 transitions. [2024-10-12 21:42:20,485 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 7925 transitions. Word has length 142 [2024-10-12 21:42:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:20,488 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 7925 transitions. [2024-10-12 21:42:20,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7925 transitions. [2024-10-12 21:42:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:20,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:20,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:20,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:42:20,494 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:20,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1147014536, now seen corresponding path program 1 times [2024-10-12 21:42:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:20,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70967929] [2024-10-12 21:42:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,747 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-12 21:42:20,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70967929] [2024-10-12 21:42:20,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70967929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:20,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:20,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:20,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562572587] [2024-10-12 21:42:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:20,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:20,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:20,750 INFO L87 Difference]: Start difference. First operand 4939 states and 7925 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:24,122 INFO L93 Difference]: Finished difference Result 19440 states and 31586 transitions. [2024-10-12 21:42:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:24,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:24,189 INFO L225 Difference]: With dead ends: 19440 [2024-10-12 21:42:24,190 INFO L226 Difference]: Without dead ends: 14518 [2024-10-12 21:42:24,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:42:24,210 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 1718 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:24,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 1182 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 21:42:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14518 states. [2024-10-12 21:42:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14518 to 9565. [2024-10-12 21:42:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9565 states, 8716 states have (on average 1.595915557595227) internal successors, (13910), 8750 states have internal predecessors, (13910), 618 states have call successors, (618), 199 states have call predecessors, (618), 230 states have return successors, (891), 647 states have call predecessors, (891), 616 states have call successors, (891) [2024-10-12 21:42:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9565 states to 9565 states and 15419 transitions. [2024-10-12 21:42:25,196 INFO L78 Accepts]: Start accepts. Automaton has 9565 states and 15419 transitions. Word has length 142 [2024-10-12 21:42:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:25,196 INFO L471 AbstractCegarLoop]: Abstraction has 9565 states and 15419 transitions. [2024-10-12 21:42:25,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 9565 states and 15419 transitions. [2024-10-12 21:42:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:25,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:25,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:42:25,203 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -675658186, now seen corresponding path program 1 times [2024-10-12 21:42:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470265581] [2024-10-12 21:42:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,407 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-12 21:42:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:25,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470265581] [2024-10-12 21:42:25,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470265581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:25,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:25,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:25,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816243585] [2024-10-12 21:42:25,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:25,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:25,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:25,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:25,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:25,409 INFO L87 Difference]: Start difference. First operand 9565 states and 15419 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:30,289 INFO L93 Difference]: Finished difference Result 37600 states and 61338 transitions. [2024-10-12 21:42:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:30,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:30,389 INFO L225 Difference]: With dead ends: 37600 [2024-10-12 21:42:30,390 INFO L226 Difference]: Without dead ends: 28052 [2024-10-12 21:42:30,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:42:30,432 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 1355 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:30,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 1814 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:42:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2024-10-12 21:42:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 18494. [2024-10-12 21:42:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18494 states, 16861 states have (on average 1.5918391554474824) internal successors, (26840), 16927 states have internal predecessors, (26840), 1178 states have call successors, (1178), 391 states have call predecessors, (1178), 454 states have return successors, (1969), 1239 states have call predecessors, (1969), 1176 states have call successors, (1969) [2024-10-12 21:42:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18494 states to 18494 states and 29987 transitions. [2024-10-12 21:42:32,410 INFO L78 Accepts]: Start accepts. Automaton has 18494 states and 29987 transitions. Word has length 142 [2024-10-12 21:42:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:32,411 INFO L471 AbstractCegarLoop]: Abstraction has 18494 states and 29987 transitions. [2024-10-12 21:42:32,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 18494 states and 29987 transitions. [2024-10-12 21:42:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:32,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:32,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:42:32,427 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:32,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1971946168, now seen corresponding path program 1 times [2024-10-12 21:42:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638350949] [2024-10-12 21:42:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:32,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,678 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-12 21:42:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:32,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638350949] [2024-10-12 21:42:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638350949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342763326] [2024-10-12 21:42:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:32,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:32,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:32,681 INFO L87 Difference]: Start difference. First operand 18494 states and 29987 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:39,921 INFO L93 Difference]: Finished difference Result 72511 states and 118928 transitions. [2024-10-12 21:42:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:39,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:40,157 INFO L225 Difference]: With dead ends: 72511 [2024-10-12 21:42:40,158 INFO L226 Difference]: Without dead ends: 54034 [2024-10-12 21:42:40,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:42:40,240 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 1566 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 2981 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:40,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 1818 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2981 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:42:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54034 states. [2024-10-12 21:42:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54034 to 36671. [2024-10-12 21:42:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36671 states, 33502 states have (on average 1.5920840546833024) internal successors, (53338), 33632 states have internal predecessors, (53338), 2266 states have call successors, (2266), 775 states have call predecessors, (2266), 902 states have return successors, (4579), 2391 states have call predecessors, (4579), 2264 states have call successors, (4579) [2024-10-12 21:42:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36671 states to 36671 states and 60183 transitions. [2024-10-12 21:42:43,377 INFO L78 Accepts]: Start accepts. Automaton has 36671 states and 60183 transitions. Word has length 142 [2024-10-12 21:42:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:43,377 INFO L471 AbstractCegarLoop]: Abstraction has 36671 states and 60183 transitions. [2024-10-12 21:42:43,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 36671 states and 60183 transitions. [2024-10-12 21:42:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:42:43,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:43,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:42:43,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 21:42:43,401 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:43,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:43,401 INFO L85 PathProgramCache]: Analyzing trace with hash -159404554, now seen corresponding path program 1 times [2024-10-12 21:42:43,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:43,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134035988] [2024-10-12 21:42:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:42:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:42:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:42:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,622 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-12 21:42:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:43,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134035988] [2024-10-12 21:42:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134035988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:43,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990423945] [2024-10-12 21:42:43,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:43,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:43,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:43,625 INFO L87 Difference]: Start difference. First operand 36671 states and 60183 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-12 21:42:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:53,779 INFO L93 Difference]: Finished difference Result 142270 states and 236054 transitions. [2024-10-12 21:42:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:53,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:42:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted.