./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.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 67128d109acca52d0fda3c2f0434d60ee9cc5cc865496b6446183c0a601e748c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:54:37,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:54:37,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:54:37,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:54:37,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:54:37,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:54:37,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:54:37,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:54:37,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:54:37,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:54:37,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:54:37,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:54:37,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:54:37,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:54:37,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:54:37,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:54:37,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:54:37,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:54:37,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:54:37,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:54:37,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:54:37,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:54:37,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:54:37,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:54:37,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:54:37,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:54:37,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:54:37,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:54:37,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:54:37,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:54:37,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:54:37,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:54:37,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:54:37,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:54:37,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:54:37,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:54:37,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:54:37,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:54:37,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:54:37,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:54:37,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:54:37,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:54:37,429 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 -> 67128d109acca52d0fda3c2f0434d60ee9cc5cc865496b6446183c0a601e748c [2024-11-11 22:54:37,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:54:37,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:54:37,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:54:37,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:54:37,750 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:54:37,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2024-11-11 22:54:39,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:54:39,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:54:39,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2024-11-11 22:54:39,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e9d7c90/833f60e6e1fd443eb842e25c1cd9584b/FLAGd8dce17b4 [2024-11-11 22:54:39,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e9d7c90/833f60e6e1fd443eb842e25c1cd9584b [2024-11-11 22:54:39,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:54:39,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:54:39,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:54:39,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:54:39,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:54:39,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:54:39" (1/1) ... [2024-11-11 22:54:39,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63102b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:39, skipping insertion in model container [2024-11-11 22:54:39,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:54:39" (1/1) ... [2024-11-11 22:54:39,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:54:39,811 WARN L250 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.12.cil-1.c[913,926] [2024-11-11 22:54:39,870 WARN L250 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.12.cil-1.c[5977,5990] [2024-11-11 22:54:40,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:54:40,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:54:40,045 WARN L250 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.12.cil-1.c[913,926] [2024-11-11 22:54:40,064 WARN L250 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.12.cil-1.c[5977,5990] [2024-11-11 22:54:40,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:54:40,162 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:54:40,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40 WrapperNode [2024-11-11 22:54:40,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:54:40,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:54:40,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:54:40,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:54:40,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,264 INFO L138 Inliner]: procedures = 72, calls = 85, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1089 [2024-11-11 22:54:40,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:54:40,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:54:40,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:54:40,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:54:40,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,333 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-11-11 22:54:40,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:54:40,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:54:40,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:54:40,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:54:40,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (1/1) ... [2024-11-11 22:54:40,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:54:40,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:40,468 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-11-11 22:54:40,472 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-11-11 22:54:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:54:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:54:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:54:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-11 22:54:40,527 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-11 22:54:40,528 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:54:40,528 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:54:40,528 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:54:40,528 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:54:40,529 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:54:40,529 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:54:40,529 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:54:40,529 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:54:40,529 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:54:40,529 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:54:40,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:54:40,530 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:54:40,530 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:54:40,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:54:40,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:54:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:54:40,531 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:54:40,531 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-11 22:54:40,531 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-11 22:54:40,679 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:54:40,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:54:41,765 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-11 22:54:41,765 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:54:41,793 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:54:41,793 INFO L316 CfgBuilder]: Removed 19 assume(true) statements. [2024-11-11 22:54:41,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:54:41 BoogieIcfgContainer [2024-11-11 22:54:41,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:54:41,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:54:41,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:54:41,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:54:41,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:54:39" (1/3) ... [2024-11-11 22:54:41,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713aa44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:54:41, skipping insertion in model container [2024-11-11 22:54:41,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:40" (2/3) ... [2024-11-11 22:54:41,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713aa44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:54:41, skipping insertion in model container [2024-11-11 22:54:41,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:54:41" (3/3) ... [2024-11-11 22:54:41,806 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2024-11-11 22:54:41,823 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:54:41,823 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:54:41,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:54:41,909 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;@4d60a72a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:54:41,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:54:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 475 states, 428 states have (on average 1.6331775700934579) internal successors, (699), 435 states have internal predecessors, (699), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-11 22:54:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 22:54:41,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:41,925 INFO L218 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] [2024-11-11 22:54:41,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:41,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1253778206, now seen corresponding path program 1 times [2024-11-11 22:54:41,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:41,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756875476] [2024-11-11 22:54:41,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:42,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 22:54:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:42,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:42,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756875476] [2024-11-11 22:54:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756875476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:42,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:42,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528731300] [2024-11-11 22:54:42,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:42,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:42,333 INFO L87 Difference]: Start difference. First operand has 475 states, 428 states have (on average 1.6331775700934579) internal successors, (699), 435 states have internal predecessors, (699), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-11 22:54:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:43,070 INFO L93 Difference]: Finished difference Result 994 states and 1602 transitions. [2024-11-11 22:54:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 44 [2024-11-11 22:54:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:43,093 INFO L225 Difference]: With dead ends: 994 [2024-11-11 22:54:43,093 INFO L226 Difference]: Without dead ends: 534 [2024-11-11 22:54:43,102 INFO L434 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-11-11 22:54:43,106 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 969 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:43,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 890 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:54:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-11 22:54:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 528. [2024-11-11 22:54:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 477 states have (on average 1.5220125786163523) internal successors, (726), 482 states have internal predecessors, (726), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (40), 34 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-11 22:54:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 804 transitions. [2024-11-11 22:54:43,207 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 804 transitions. Word has length 44 [2024-11-11 22:54:43,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:43,207 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 804 transitions. [2024-11-11 22:54:43,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-11 22:54:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 804 transitions. [2024-11-11 22:54:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:54:43,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:43,216 INFO L218 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] [2024-11-11 22:54:43,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:54:43,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:43,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2136589079, now seen corresponding path program 1 times [2024-11-11 22:54:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:43,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816553518] [2024-11-11 22:54:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:43,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:54:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:43,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816553518] [2024-11-11 22:54:43,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816553518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:43,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:43,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788951546] [2024-11-11 22:54:43,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:43,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:43,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:43,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:43,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:43,364 INFO L87 Difference]: Start difference. First operand 528 states and 804 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:44,000 INFO L93 Difference]: Finished difference Result 776 states and 1144 transitions. [2024-11-11 22:54:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:44,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-11 22:54:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:44,005 INFO L225 Difference]: With dead ends: 776 [2024-11-11 22:54:44,006 INFO L226 Difference]: Without dead ends: 652 [2024-11-11 22:54:44,007 INFO L434 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-11-11 22:54:44,008 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 370 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:44,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1244 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:54:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-11 22:54:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 595. [2024-11-11 22:54:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 538 states have (on average 1.5055762081784387) internal successors, (810), 543 states have internal predecessors, (810), 41 states have call successors, (41), 15 states have call predecessors, (41), 14 states have return successors, (43), 37 states have call predecessors, (43), 37 states have call successors, (43) [2024-11-11 22:54:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 894 transitions. [2024-11-11 22:54:44,058 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 894 transitions. Word has length 45 [2024-11-11 22:54:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:44,059 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 894 transitions. [2024-11-11 22:54:44,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 894 transitions. [2024-11-11 22:54:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:54:44,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:44,062 INFO L218 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] [2024-11-11 22:54:44,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:54:44,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:44,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 852231618, now seen corresponding path program 1 times [2024-11-11 22:54:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219425928] [2024-11-11 22:54:44,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:54:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:44,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:44,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219425928] [2024-11-11 22:54:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219425928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:44,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:44,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:44,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983749589] [2024-11-11 22:54:44,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:44,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:44,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:44,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:44,149 INFO L87 Difference]: Start difference. First operand 595 states and 894 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:44,664 INFO L93 Difference]: Finished difference Result 1003 states and 1453 transitions. [2024-11-11 22:54:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-11 22:54:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:44,672 INFO L225 Difference]: With dead ends: 1003 [2024-11-11 22:54:44,673 INFO L226 Difference]: Without dead ends: 812 [2024-11-11 22:54:44,675 INFO L434 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-11-11 22:54:44,676 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 979 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:44,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 889 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:54:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-11-11 22:54:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 760. [2024-11-11 22:54:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 684 states have (on average 1.4619883040935673) internal successors, (1000), 692 states have internal predecessors, (1000), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (60), 46 states have call predecessors, (60), 48 states have call successors, (60) [2024-11-11 22:54:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1112 transitions. [2024-11-11 22:54:44,761 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1112 transitions. Word has length 45 [2024-11-11 22:54:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:44,761 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1112 transitions. [2024-11-11 22:54:44,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1112 transitions. [2024-11-11 22:54:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:54:44,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:44,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:44,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:54:44,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -83451346, now seen corresponding path program 1 times [2024-11-11 22:54:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244570880] [2024-11-11 22:54:44,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 22:54:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:54:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:54:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244570880] [2024-11-11 22:54:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244570880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:44,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:44,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:44,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73479518] [2024-11-11 22:54:44,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:44,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:44,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:44,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:44,897 INFO L87 Difference]: Start difference. First operand 760 states and 1112 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-11 22:54:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:45,499 INFO L93 Difference]: Finished difference Result 1344 states and 1897 transitions. [2024-11-11 22:54:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:45,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 62 [2024-11-11 22:54:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:45,506 INFO L225 Difference]: With dead ends: 1344 [2024-11-11 22:54:45,506 INFO L226 Difference]: Without dead ends: 988 [2024-11-11 22:54:45,508 INFO L434 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-11-11 22:54:45,509 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 354 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:45,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1297 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:54:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-11 22:54:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 950. [2024-11-11 22:54:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 850 states have (on average 1.411764705882353) internal successors, (1200), 860 states have internal predecessors, (1200), 66 states have call successors, (66), 30 states have call predecessors, (66), 32 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2024-11-11 22:54:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1350 transitions. [2024-11-11 22:54:45,558 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1350 transitions. Word has length 62 [2024-11-11 22:54:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:45,559 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1350 transitions. [2024-11-11 22:54:45,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-11 22:54:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1350 transitions. [2024-11-11 22:54:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:54:45,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:45,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:45,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:54:45,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:45,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 310360724, now seen corresponding path program 1 times [2024-11-11 22:54:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193443361] [2024-11-11 22:54:45,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:54:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:54:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:54:45,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:45,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193443361] [2024-11-11 22:54:45,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193443361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:45,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:45,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:45,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775181362] [2024-11-11 22:54:45,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:45,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:45,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:45,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:45,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:45,665 INFO L87 Difference]: Start difference. First operand 950 states and 1350 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-11 22:54:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:46,145 INFO L93 Difference]: Finished difference Result 1603 states and 2203 transitions. [2024-11-11 22:54:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:46,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 67 [2024-11-11 22:54:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:46,152 INFO L225 Difference]: With dead ends: 1603 [2024-11-11 22:54:46,153 INFO L226 Difference]: Without dead ends: 1149 [2024-11-11 22:54:46,155 INFO L434 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-11-11 22:54:46,155 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 966 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:46,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 888 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:54:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-11 22:54:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1094. [2024-11-11 22:54:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 978 states have (on average 1.3813905930470347) internal successors, (1351), 990 states have internal predecessors, (1351), 74 states have call successors, (74), 36 states have call predecessors, (74), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-11-11 22:54:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1523 transitions. [2024-11-11 22:54:46,215 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1523 transitions. Word has length 67 [2024-11-11 22:54:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:46,215 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1523 transitions. [2024-11-11 22:54:46,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-11 22:54:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1523 transitions. [2024-11-11 22:54:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:54:46,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:46,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:54:46,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1117206201, now seen corresponding path program 1 times [2024-11-11 22:54:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165149714] [2024-11-11 22:54:46,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:54:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:54:46,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165149714] [2024-11-11 22:54:46,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165149714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:46,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35441332] [2024-11-11 22:54:46,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:46,414 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-11-11 22:54:46,415 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-11-11 22:54:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 22:54:46,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:46,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:54:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35441332] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:46,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 22:54:46,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-11 22:54:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755360130] [2024-11-11 22:54:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:46,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:46,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:54:46,736 INFO L87 Difference]: Start difference. First operand 1094 states and 1523 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:54:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:46,952 INFO L93 Difference]: Finished difference Result 1150 states and 1591 transitions. [2024-11-11 22:54:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:54:46,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 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 68 [2024-11-11 22:54:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:46,960 INFO L225 Difference]: With dead ends: 1150 [2024-11-11 22:54:46,960 INFO L226 Difference]: Without dead ends: 1147 [2024-11-11 22:54:46,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:54:46,963 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 1305 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:46,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 804 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:54:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2024-11-11 22:54:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1093. [2024-11-11 22:54:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 978 states have (on average 1.3793456032719837) internal successors, (1349), 989 states have internal predecessors, (1349), 73 states have call successors, (73), 36 states have call predecessors, (73), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-11-11 22:54:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1520 transitions. [2024-11-11 22:54:47,026 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1520 transitions. Word has length 68 [2024-11-11 22:54:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:47,027 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1520 transitions. [2024-11-11 22:54:47,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:54:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1520 transitions. [2024-11-11 22:54:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 22:54:47,030 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:47,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:47,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:54:47,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 22:54:47,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:47,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash 272220471, now seen corresponding path program 1 times [2024-11-11 22:54:47,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:47,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347816114] [2024-11-11 22:54:47,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:54:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:54:47,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:47,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347816114] [2024-11-11 22:54:47,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347816114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366419066] [2024-11-11 22:54:47,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:47,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:47,400 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-11-11 22:54:47,401 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-11-11 22:54:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:54:47,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:47,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:54:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:47,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366419066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:54:47,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:54:47,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-11 22:54:47,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346912773] [2024-11-11 22:54:47,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:54:47,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 22:54:47,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 22:54:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:47,890 INFO L87 Difference]: Start difference. First operand 1093 states and 1520 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:54:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:49,460 INFO L93 Difference]: Finished difference Result 2600 states and 3508 transitions. [2024-11-11 22:54:49,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:54:49,461 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-11 22:54:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:49,474 INFO L225 Difference]: With dead ends: 2600 [2024-11-11 22:54:49,475 INFO L226 Difference]: Without dead ends: 2056 [2024-11-11 22:54:49,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-11 22:54:49,478 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1190 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 3510 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:49,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 3510 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:54:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2024-11-11 22:54:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1456. [2024-11-11 22:54:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1302 states have (on average 1.3433179723502304) internal successors, (1749), 1321 states have internal predecessors, (1749), 93 states have call successors, (93), 50 states have call predecessors, (93), 59 states have return successors, (132), 85 states have call predecessors, (132), 90 states have call successors, (132) [2024-11-11 22:54:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1974 transitions. [2024-11-11 22:54:49,563 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1974 transitions. Word has length 69 [2024-11-11 22:54:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:49,564 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1974 transitions. [2024-11-11 22:54:49,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:54:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1974 transitions. [2024-11-11 22:54:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 22:54:49,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:49,568 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2024-11-11 22:54:49,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 22:54:49,772 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,SelfDestructingSolverStorable6 [2024-11-11 22:54:49,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash 124658480, now seen corresponding path program 1 times [2024-11-11 22:54:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151499746] [2024-11-11 22:54:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:54:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 22:54:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 22:54:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:49,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151499746] [2024-11-11 22:54:49,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151499746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:49,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141579519] [2024-11-11 22:54:49,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:49,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:49,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:49,926 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-11-11 22:54:49,930 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-11-11 22:54:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:50,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:54:50,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:50,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:54:50,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141579519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:50,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:54:50,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:54:50,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657114612] [2024-11-11 22:54:50,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:50,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:54:50,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:50,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:54:50,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:50,082 INFO L87 Difference]: Start difference. First operand 1456 states and 1974 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:54:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:50,137 INFO L93 Difference]: Finished difference Result 2153 states and 2878 transitions. [2024-11-11 22:54:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:54:50,138 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-11 22:54:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:50,144 INFO L225 Difference]: With dead ends: 2153 [2024-11-11 22:54:50,144 INFO L226 Difference]: Without dead ends: 1334 [2024-11-11 22:54:50,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:50,147 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 673 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:50,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 818 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:54:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-11 22:54:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1319. [2024-11-11 22:54:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1181 states have (on average 1.3471634208298053) internal successors, (1591), 1199 states have internal predecessors, (1591), 85 states have call successors, (85), 44 states have call predecessors, (85), 51 states have return successors, (118), 76 states have call predecessors, (118), 82 states have call successors, (118) [2024-11-11 22:54:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1794 transitions. [2024-11-11 22:54:50,205 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1794 transitions. Word has length 88 [2024-11-11 22:54:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:50,205 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1794 transitions. [2024-11-11 22:54:50,206 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:54:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1794 transitions. [2024-11-11 22:54:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 22:54:50,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:50,209 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-11 22:54:50,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 22:54:50,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:50,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:50,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash 404282223, now seen corresponding path program 1 times [2024-11-11 22:54:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:50,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560974198] [2024-11-11 22:54:50,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:50,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:54:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 22:54:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 22:54:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 22:54:50,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:50,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560974198] [2024-11-11 22:54:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560974198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:50,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391211234] [2024-11-11 22:54:50,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:50,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:50,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:50,558 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-11-11 22:54:50,560 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-11-11 22:54:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:50,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:54:50,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 22:54:50,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:54:50,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391211234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:50,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:54:50,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:54:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674725792] [2024-11-11 22:54:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:50,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:54:50,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:54:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:50,728 INFO L87 Difference]: Start difference. First operand 1319 states and 1794 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-11 22:54:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:50,780 INFO L93 Difference]: Finished difference Result 1698 states and 2262 transitions. [2024-11-11 22:54:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:54:50,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 103 [2024-11-11 22:54:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:50,784 INFO L225 Difference]: With dead ends: 1698 [2024-11-11 22:54:50,784 INFO L226 Difference]: Without dead ends: 398 [2024-11-11 22:54:50,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:50,788 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 62 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:50,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1446 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:54:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-11 22:54:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-11-11 22:54:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 363 states have (on average 1.56198347107438) internal successors, (567), 365 states have internal predecessors, (567), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:54:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 621 transitions. [2024-11-11 22:54:50,804 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 621 transitions. Word has length 103 [2024-11-11 22:54:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:50,805 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 621 transitions. [2024-11-11 22:54:50,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-11 22:54:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 621 transitions. [2024-11-11 22:54:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:54:50,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:50,808 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:54:50,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 22:54:51,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:51,009 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:51,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2006047365, now seen corresponding path program 1 times [2024-11-11 22:54:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078194648] [2024-11-11 22:54:51,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078194648] [2024-11-11 22:54:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078194648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:51,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:51,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:54:51,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767144824] [2024-11-11 22:54:51,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:51,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:54:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:51,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:54:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:54:51,223 INFO L87 Difference]: Start difference. First operand 398 states and 621 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:54:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:53,094 INFO L93 Difference]: Finished difference Result 931 states and 1478 transitions. [2024-11-11 22:54:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:54:53,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-11 22:54:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:53,099 INFO L225 Difference]: With dead ends: 931 [2024-11-11 22:54:53,099 INFO L226 Difference]: Without dead ends: 540 [2024-11-11 22:54:53,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:54:53,101 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1061 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:53,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 804 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:54:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-11 22:54:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 398. [2024-11-11 22:54:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 363 states have (on average 1.559228650137741) internal successors, (566), 365 states have internal predecessors, (566), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:54:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 620 transitions. [2024-11-11 22:54:53,129 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 620 transitions. Word has length 179 [2024-11-11 22:54:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:53,130 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 620 transitions. [2024-11-11 22:54:53,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:54:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 620 transitions. [2024-11-11 22:54:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:54:53,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:53,132 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:54:53,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:54:53,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:53,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1640327161, now seen corresponding path program 1 times [2024-11-11 22:54:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:53,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803893449] [2024-11-11 22:54:53,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:53,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803893449] [2024-11-11 22:54:53,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803893449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:53,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:53,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:54:53,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153077676] [2024-11-11 22:54:53,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:53,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:54:53,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:53,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:54:53,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:54:53,396 INFO L87 Difference]: Start difference. First operand 398 states and 620 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:54:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:55,151 INFO L93 Difference]: Finished difference Result 923 states and 1461 transitions. [2024-11-11 22:54:55,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:54:55,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-11 22:54:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:55,155 INFO L225 Difference]: With dead ends: 923 [2024-11-11 22:54:55,155 INFO L226 Difference]: Without dead ends: 540 [2024-11-11 22:54:55,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:54:55,157 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1052 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:55,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 802 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:54:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-11 22:54:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 398. [2024-11-11 22:54:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 363 states have (on average 1.556473829201102) internal successors, (565), 365 states have internal predecessors, (565), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:54:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 619 transitions. [2024-11-11 22:54:55,190 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 619 transitions. Word has length 179 [2024-11-11 22:54:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:55,192 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 619 transitions. [2024-11-11 22:54:55,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:54:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 619 transitions. [2024-11-11 22:54:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:54:55,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:55,195 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:54:55,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:54:55,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:55,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1141770359, now seen corresponding path program 1 times [2024-11-11 22:54:55,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:55,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079127112] [2024-11-11 22:54:55,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079127112] [2024-11-11 22:54:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079127112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:55,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:55,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:54:55,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237617248] [2024-11-11 22:54:55,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:55,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:54:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:55,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:54:55,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:54:55,501 INFO L87 Difference]: Start difference. First operand 398 states and 619 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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-11-11 22:54:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:58,161 INFO L93 Difference]: Finished difference Result 1454 states and 2316 transitions. [2024-11-11 22:54:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:54:58,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2024-11-11 22:54:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:58,167 INFO L225 Difference]: With dead ends: 1454 [2024-11-11 22:54:58,168 INFO L226 Difference]: Without dead ends: 1077 [2024-11-11 22:54:58,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:58,170 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 1589 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:58,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 1372 Invalid, 2385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:54:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-11 22:54:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 792. [2024-11-11 22:54:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 729 states have (on average 1.5692729766803841) internal successors, (1144), 732 states have internal predecessors, (1144), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-11 22:54:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1243 transitions. [2024-11-11 22:54:58,235 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1243 transitions. Word has length 179 [2024-11-11 22:54:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:58,235 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1243 transitions. [2024-11-11 22:54:58,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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-11-11 22:54:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1243 transitions. [2024-11-11 22:54:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:54:58,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:58,237 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:54:58,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:54:58,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:58,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash -243969421, now seen corresponding path program 1 times [2024-11-11 22:54:58,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:58,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887808428] [2024-11-11 22:54:58,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:54:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:54:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:54:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:54:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:58,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887808428] [2024-11-11 22:54:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887808428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:58,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:58,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686630434] [2024-11-11 22:54:58,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:58,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:58,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:58,568 INFO L87 Difference]: Start difference. First operand 792 states and 1243 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:02,124 INFO L93 Difference]: Finished difference Result 2403 states and 3836 transitions. [2024-11-11 22:55:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:02,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:02,133 INFO L225 Difference]: With dead ends: 2403 [2024-11-11 22:55:02,133 INFO L226 Difference]: Without dead ends: 1632 [2024-11-11 22:55:02,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:02,135 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1620 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 3669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:02,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 2672 Invalid, 3669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3604 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 22:55:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-11-11 22:55:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1159. [2024-11-11 22:55:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1068 states have (on average 1.5627340823970037) internal successors, (1669), 1072 states have internal predecessors, (1669), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-11 22:55:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1812 transitions. [2024-11-11 22:55:02,223 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1812 transitions. Word has length 179 [2024-11-11 22:55:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:02,224 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1812 transitions. [2024-11-11 22:55:02,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1812 transitions. [2024-11-11 22:55:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:02,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:02,226 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:02,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:55:02,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:02,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2013441035, now seen corresponding path program 1 times [2024-11-11 22:55:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:02,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995647507] [2024-11-11 22:55:02,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:02,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995647507] [2024-11-11 22:55:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995647507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:02,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238371805] [2024-11-11 22:55:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:02,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:02,538 INFO L87 Difference]: Start difference. First operand 1159 states and 1812 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:06,399 INFO L93 Difference]: Finished difference Result 3803 states and 6059 transitions. [2024-11-11 22:55:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:06,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:06,410 INFO L225 Difference]: With dead ends: 3803 [2024-11-11 22:55:06,410 INFO L226 Difference]: Without dead ends: 2665 [2024-11-11 22:55:06,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:06,414 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1618 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 3600 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 3667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:06,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 2670 Invalid, 3667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3600 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 22:55:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2024-11-11 22:55:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 1894. [2024-11-11 22:55:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1747 states have (on average 1.5569547796222094) internal successors, (2720), 1753 states have internal predecessors, (2720), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-11 22:55:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2955 transitions. [2024-11-11 22:55:06,549 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2955 transitions. Word has length 179 [2024-11-11 22:55:06,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:06,549 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2955 transitions. [2024-11-11 22:55:06,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2955 transitions. [2024-11-11 22:55:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:06,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:06,552 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:06,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:55:06,552 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1670257203, now seen corresponding path program 1 times [2024-11-11 22:55:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939803366] [2024-11-11 22:55:06,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:06,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:06,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:06,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:06,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:06,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939803366] [2024-11-11 22:55:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939803366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:06,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:06,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:06,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367989006] [2024-11-11 22:55:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:06,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:06,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:06,877 INFO L87 Difference]: Start difference. First operand 1894 states and 2955 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:08,839 INFO L93 Difference]: Finished difference Result 4526 states and 7193 transitions. [2024-11-11 22:55:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:08,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:08,851 INFO L225 Difference]: With dead ends: 4526 [2024-11-11 22:55:08,851 INFO L226 Difference]: Without dead ends: 2653 [2024-11-11 22:55:08,857 INFO L434 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-11-11 22:55:08,858 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1328 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:08,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1126 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:55:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-11-11 22:55:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1894. [2024-11-11 22:55:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1747 states have (on average 1.5540927303949628) internal successors, (2715), 1753 states have internal predecessors, (2715), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-11 22:55:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2950 transitions. [2024-11-11 22:55:09,009 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2950 transitions. Word has length 179 [2024-11-11 22:55:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:09,009 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2950 transitions. [2024-11-11 22:55:09,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2950 transitions. [2024-11-11 22:55:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:09,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:09,012 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:09,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:55:09,012 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:09,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash 265065525, now seen corresponding path program 1 times [2024-11-11 22:55:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:09,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525171957] [2024-11-11 22:55:09,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525171957] [2024-11-11 22:55:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525171957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880059360] [2024-11-11 22:55:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:09,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:09,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:09,310 INFO L87 Difference]: Start difference. First operand 1894 states and 2950 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:11,354 INFO L93 Difference]: Finished difference Result 4520 states and 7167 transitions. [2024-11-11 22:55:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:11,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:11,366 INFO L225 Difference]: With dead ends: 4520 [2024-11-11 22:55:11,367 INFO L226 Difference]: Without dead ends: 2647 [2024-11-11 22:55:11,371 INFO L434 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-11-11 22:55:11,372 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1250 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:11,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1341 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:55:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2024-11-11 22:55:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1894. [2024-11-11 22:55:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1747 states have (on average 1.5512306811677161) internal successors, (2710), 1753 states have internal predecessors, (2710), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-11 22:55:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2945 transitions. [2024-11-11 22:55:11,512 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2945 transitions. Word has length 179 [2024-11-11 22:55:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:11,513 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2945 transitions. [2024-11-11 22:55:11,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2945 transitions. [2024-11-11 22:55:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:11,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:11,516 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:55:11,516 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:11,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2135567885, now seen corresponding path program 1 times [2024-11-11 22:55:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675551672] [2024-11-11 22:55:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:11,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:11,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675551672] [2024-11-11 22:55:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675551672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:11,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912127640] [2024-11-11 22:55:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:11,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:11,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:11,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:11,798 INFO L87 Difference]: Start difference. First operand 1894 states and 2945 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:13,522 INFO L93 Difference]: Finished difference Result 4508 states and 7129 transitions. [2024-11-11 22:55:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:13,535 INFO L225 Difference]: With dead ends: 4508 [2024-11-11 22:55:13,535 INFO L226 Difference]: Without dead ends: 2635 [2024-11-11 22:55:13,540 INFO L434 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-11-11 22:55:13,541 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1328 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:13,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1126 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:55:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-11-11 22:55:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 1894. [2024-11-11 22:55:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1747 states have (on average 1.5483686319404695) internal successors, (2705), 1753 states have internal predecessors, (2705), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-11 22:55:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2940 transitions. [2024-11-11 22:55:13,680 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2940 transitions. Word has length 179 [2024-11-11 22:55:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:13,681 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2940 transitions. [2024-11-11 22:55:13,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2940 transitions. [2024-11-11 22:55:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:13,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:13,689 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:13,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:55:13,690 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:13,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:13,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1236231985, now seen corresponding path program 1 times [2024-11-11 22:55:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:13,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397816913] [2024-11-11 22:55:13,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:14,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:14,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397816913] [2024-11-11 22:55:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397816913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:14,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846427535] [2024-11-11 22:55:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:14,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:14,017 INFO L87 Difference]: Start difference. First operand 1894 states and 2940 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:17,546 INFO L93 Difference]: Finished difference Result 6473 states and 10194 transitions. [2024-11-11 22:55:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:17,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:17,564 INFO L225 Difference]: With dead ends: 6473 [2024-11-11 22:55:17,564 INFO L226 Difference]: Without dead ends: 4600 [2024-11-11 22:55:17,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:17,569 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1597 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:17,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1616 Valid, 2670 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:55:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2024-11-11 22:55:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 3383. [2024-11-11 22:55:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 3124 states have (on average 1.543213828425096) internal successors, (4821), 3134 states have internal predecessors, (4821), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-11 22:55:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 5246 transitions. [2024-11-11 22:55:17,886 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 5246 transitions. Word has length 179 [2024-11-11 22:55:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:17,886 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 5246 transitions. [2024-11-11 22:55:17,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 5246 transitions. [2024-11-11 22:55:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:17,889 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:17,890 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:17,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:55:17,890 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:17,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1622094387, now seen corresponding path program 1 times [2024-11-11 22:55:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:17,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675396014] [2024-11-11 22:55:17,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:18,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675396014] [2024-11-11 22:55:18,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675396014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:18,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:18,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509104941] [2024-11-11 22:55:18,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:18,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:18,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:18,152 INFO L87 Difference]: Start difference. First operand 3383 states and 5246 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:19,814 INFO L93 Difference]: Finished difference Result 7982 states and 12568 transitions. [2024-11-11 22:55:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:19,832 INFO L225 Difference]: With dead ends: 7982 [2024-11-11 22:55:19,832 INFO L226 Difference]: Without dead ends: 4620 [2024-11-11 22:55:19,839 INFO L434 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-11-11 22:55:19,840 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1327 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:19,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 1126 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:55:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2024-11-11 22:55:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 3383. [2024-11-11 22:55:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 3124 states have (on average 1.5403329065300897) internal successors, (4812), 3134 states have internal predecessors, (4812), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-11 22:55:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 5237 transitions. [2024-11-11 22:55:20,089 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 5237 transitions. Word has length 179 [2024-11-11 22:55:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:20,090 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 5237 transitions. [2024-11-11 22:55:20,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 5237 transitions. [2024-11-11 22:55:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:20,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:20,094 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:20,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:55:20,094 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:20,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1357446897, now seen corresponding path program 1 times [2024-11-11 22:55:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:20,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865125486] [2024-11-11 22:55:20,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:20,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:20,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865125486] [2024-11-11 22:55:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865125486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:20,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:20,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001761583] [2024-11-11 22:55:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:20,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:20,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:20,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:20,375 INFO L87 Difference]: Start difference. First operand 3383 states and 5237 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:24,182 INFO L93 Difference]: Finished difference Result 11854 states and 18586 transitions. [2024-11-11 22:55:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:24,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:24,217 INFO L225 Difference]: With dead ends: 11854 [2024-11-11 22:55:24,217 INFO L226 Difference]: Without dead ends: 8492 [2024-11-11 22:55:24,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:24,229 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1589 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:24,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 2670 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3456 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:55:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8492 states. [2024-11-11 22:55:24,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8492 to 6369. [2024-11-11 22:55:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6369 states, 5886 states have (on average 1.5358477743798844) internal successors, (9040), 5904 states have internal predecessors, (9040), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-11 22:55:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 9863 transitions. [2024-11-11 22:55:24,781 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 9863 transitions. Word has length 179 [2024-11-11 22:55:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:24,781 INFO L471 AbstractCegarLoop]: Abstraction has 6369 states and 9863 transitions. [2024-11-11 22:55:24,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 9863 transitions. [2024-11-11 22:55:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:24,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:24,786 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:24,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:55:24,787 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1006394765, now seen corresponding path program 1 times [2024-11-11 22:55:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:24,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656073756] [2024-11-11 22:55:24,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:25,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656073756] [2024-11-11 22:55:25,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656073756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274006976] [2024-11-11 22:55:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:25,069 INFO L87 Difference]: Start difference. First operand 6369 states and 9863 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:27,223 INFO L93 Difference]: Finished difference Result 14918 states and 23439 transitions. [2024-11-11 22:55:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:27,252 INFO L225 Difference]: With dead ends: 14918 [2024-11-11 22:55:27,252 INFO L226 Difference]: Without dead ends: 8570 [2024-11-11 22:55:27,271 INFO L434 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-11-11 22:55:27,271 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1159 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:27,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1342 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:55:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8570 states. [2024-11-11 22:55:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8570 to 6369. [2024-11-11 22:55:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6369 states, 5886 states have (on average 1.5329595650696568) internal successors, (9023), 5904 states have internal predecessors, (9023), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-11 22:55:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 9846 transitions. [2024-11-11 22:55:27,825 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 9846 transitions. Word has length 179 [2024-11-11 22:55:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:27,825 INFO L471 AbstractCegarLoop]: Abstraction has 6369 states and 9846 transitions. [2024-11-11 22:55:27,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 9846 transitions. [2024-11-11 22:55:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:27,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:27,831 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:27,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:55:27,831 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:27,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1965393585, now seen corresponding path program 1 times [2024-11-11 22:55:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767291679] [2024-11-11 22:55:27,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:27,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:28,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:28,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767291679] [2024-11-11 22:55:28,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767291679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:28,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:28,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970059970] [2024-11-11 22:55:28,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:28,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:28,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:28,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:28,094 INFO L87 Difference]: Start difference. First operand 6369 states and 9846 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:29,897 INFO L93 Difference]: Finished difference Result 14900 states and 23352 transitions. [2024-11-11 22:55:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:29,927 INFO L225 Difference]: With dead ends: 14900 [2024-11-11 22:55:29,928 INFO L226 Difference]: Without dead ends: 8552 [2024-11-11 22:55:29,947 INFO L434 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-11-11 22:55:29,948 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1324 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:29,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 1126 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:55:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8552 states. [2024-11-11 22:55:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8552 to 6369. [2024-11-11 22:55:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6369 states, 5886 states have (on average 1.5300713557594292) internal successors, (9006), 5904 states have internal predecessors, (9006), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-11 22:55:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 9829 transitions. [2024-11-11 22:55:30,489 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 9829 transitions. Word has length 179 [2024-11-11 22:55:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:30,490 INFO L471 AbstractCegarLoop]: Abstraction has 6369 states and 9829 transitions. [2024-11-11 22:55:30,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 9829 transitions. [2024-11-11 22:55:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:30,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:30,496 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:55:30,497 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:30,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash -432594253, now seen corresponding path program 1 times [2024-11-11 22:55:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444050834] [2024-11-11 22:55:30,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:30,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:30,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444050834] [2024-11-11 22:55:30,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444050834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:30,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:30,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:30,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533890768] [2024-11-11 22:55:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:30,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:30,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:30,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:30,822 INFO L87 Difference]: Start difference. First operand 6369 states and 9829 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:34,848 INFO L93 Difference]: Finished difference Result 22594 states and 35258 transitions. [2024-11-11 22:55:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:34,900 INFO L225 Difference]: With dead ends: 22594 [2024-11-11 22:55:34,900 INFO L226 Difference]: Without dead ends: 16246 [2024-11-11 22:55:34,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:34,918 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1679 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1698 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:34,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1698 Valid, 1694 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2916 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:55:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2024-11-11 22:55:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 12388. [2024-11-11 22:55:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12388 states, 11457 states have (on average 1.5260539408222047) internal successors, (17484), 11491 states have internal predecessors, (17484), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-11 22:55:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 19157 transitions. [2024-11-11 22:55:35,958 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 19157 transitions. Word has length 179 [2024-11-11 22:55:35,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:35,958 INFO L471 AbstractCegarLoop]: Abstraction has 12388 states and 19157 transitions. [2024-11-11 22:55:35,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 19157 transitions. [2024-11-11 22:55:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:35,966 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:35,966 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:35,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:55:35,967 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:35,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash -94306703, now seen corresponding path program 1 times [2024-11-11 22:55:35,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:35,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568611911] [2024-11-11 22:55:35,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568611911] [2024-11-11 22:55:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568611911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095688356] [2024-11-11 22:55:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:36,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:36,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:36,243 INFO L87 Difference]: Start difference. First operand 12388 states and 19157 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:42,153 INFO L93 Difference]: Finished difference Result 49393 states and 77178 transitions. [2024-11-11 22:55:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:55:42,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:55:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:42,280 INFO L225 Difference]: With dead ends: 49393 [2024-11-11 22:55:42,280 INFO L226 Difference]: Without dead ends: 37026 [2024-11-11 22:55:42,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:55:42,316 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1687 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 4090 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 4159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:42,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 2656 Invalid, 4159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4090 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 22:55:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37026 states. [2024-11-11 22:55:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37026 to 24070. [2024-11-11 22:55:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24070 states, 22275 states have (on average 1.5220650953984287) internal successors, (33904), 22341 states have internal predecessors, (33904), 1340 states have call successors, (1340), 391 states have call predecessors, (1340), 454 states have return successors, (2131), 1401 states have call predecessors, (2131), 1338 states have call successors, (2131) [2024-11-11 22:55:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24070 states to 24070 states and 37375 transitions. [2024-11-11 22:55:44,543 INFO L78 Accepts]: Start accepts. Automaton has 24070 states and 37375 transitions. Word has length 179 [2024-11-11 22:55:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:44,544 INFO L471 AbstractCegarLoop]: Abstraction has 24070 states and 37375 transitions. [2024-11-11 22:55:44,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:55:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 24070 states and 37375 transitions. [2024-11-11 22:55:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:55:44,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:44,556 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 22:55:44,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 22:55:44,557 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:44,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash -634736209, now seen corresponding path program 1 times [2024-11-11 22:55:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:44,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120467555] [2024-11-11 22:55:44,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:44,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:55:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:55:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:55:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:55:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:44,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120467555] [2024-11-11 22:55:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120467555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:44,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:44,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338154347] [2024-11-11 22:55:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:44,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:44,813 INFO L87 Difference]: Start difference. First operand 24070 states and 37375 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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)