./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.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 ff5431a1a166986f09cf6e8d9d49f276cd283b8e2ac68f401ad73509be5780b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:41:47,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:41:47,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:41:47,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:41:47,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:41:47,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:41:47,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:41:47,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:41:47,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:41:47,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:41:47,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:41:47,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:41:47,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:41:47,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:41:47,334 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:41:47,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:41:47,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:41:47,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:41:47,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:41:47,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:41:47,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:41:47,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:41:47,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:41:47,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:41:47,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:41:47,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:41:47,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:41:47,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:41:47,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:41:47,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:41:47,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:41:47,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:41:47,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:41:47,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:41:47,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:41:47,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:41:47,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:41:47,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:41:47,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:41:47,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:41:47,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:41:47,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:41:47,347 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 -> ff5431a1a166986f09cf6e8d9d49f276cd283b8e2ac68f401ad73509be5780b8 [2024-10-12 21:41:47,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:41:47,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:41:47,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:41:47,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:41:47,634 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:41:47,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2024-10-12 21:41:48,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:41:49,248 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:41:49,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2024-10-12 21:41:49,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7ca74f5/962134acfcf34a2d8ade92d502f88693/FLAGba453206f [2024-10-12 21:41:49,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7ca74f5/962134acfcf34a2d8ade92d502f88693 [2024-10-12 21:41:49,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:41:49,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:41:49,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:41:49,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:41:49,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:41:49,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:41:49" (1/1) ... [2024-10-12 21:41:49,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b350141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:49, skipping insertion in model container [2024-10-12 21:41:49,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:41:49" (1/1) ... [2024-10-12 21:41:49,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:41:49,797 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[913,926] [2024-10-12 21:41:49,859 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[5977,5990] [2024-10-12 21:41:49,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:41:50,005 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:41:50,018 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[913,926] [2024-10-12 21:41:50,037 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-1.c[5977,5990] [2024-10-12 21:41:50,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:41:50,140 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:41:50,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50 WrapperNode [2024-10-12 21:41:50,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:41:50,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:41:50,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:41:50,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:41:50,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,214 INFO L138 Inliner]: procedures = 70, calls = 82, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 1029 [2024-10-12 21:41:50,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:41:50,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:41:50,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:41:50,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:41:50,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,280 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:41:50,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:41:50,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:41:50,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:41:50,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:41:50,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (1/1) ... [2024-10-12 21:41:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:41:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:50,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:41:50,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:41:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:41:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:41:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:41:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-12 21:41:50,440 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-12 21:41:50,440 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:41:50,440 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:41:50,441 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:41:50,441 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:41:50,441 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:41:50,441 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:41:50,441 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:41:50,441 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:41:50,441 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:41:50,441 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:41:50,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:41:50,442 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:41:50,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:41:50,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:41:50,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:41:50,442 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:41:50,442 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:41:50,442 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:41:50,442 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:41:50,612 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:41:50,615 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:41:51,682 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-10-12 21:41:51,682 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:41:51,749 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:41:51,749 INFO L314 CfgBuilder]: Removed 18 assume(true) statements. [2024-10-12 21:41:51,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:41:51 BoogieIcfgContainer [2024-10-12 21:41:51,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:41:51,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:41:51,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:41:51,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:41:51,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:41:49" (1/3) ... [2024-10-12 21:41:51,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2257f45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:41:51, skipping insertion in model container [2024-10-12 21:41:51,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:50" (2/3) ... [2024-10-12 21:41:51,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2257f45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:41:51, skipping insertion in model container [2024-10-12 21:41:51,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:41:51" (3/3) ... [2024-10-12 21:41:51,764 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.11.cil-1.c [2024-10-12 21:41:51,781 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:41:51,782 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:41:51,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:41:51,878 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;@dc529ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:41:51,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:41:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 350 states have (on average 1.7257142857142858) internal successors, (604), 357 states have internal predecessors, (604), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-12 21:41:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:41:51,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:51,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:51,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash -462489640, now seen corresponding path program 1 times [2024-10-12 21:41:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813684224] [2024-10-12 21:41:51,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813684224] [2024-10-12 21:41:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813684224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:52,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166230607] [2024-10-12 21:41:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:52,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:52,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:52,337 INFO L87 Difference]: Start difference. First operand has 396 states, 350 states have (on average 1.7257142857142858) internal successors, (604), 357 states have internal predecessors, (604), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:53,035 INFO L93 Difference]: Finished difference Result 833 states and 1406 transitions. [2024-10-12 21:41:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:53,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-12 21:41:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:53,058 INFO L225 Difference]: With dead ends: 833 [2024-10-12 21:41:53,058 INFO L226 Difference]: Without dead ends: 453 [2024-10-12 21:41:53,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:53,073 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 842 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:53,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 683 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:41:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-10-12 21:41:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 447. [2024-10-12 21:41:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 397 states have (on average 1.5894206549118388) internal successors, (631), 402 states have internal predecessors, (631), 37 states have call successors, (37), 12 states have call predecessors, (37), 11 states have return successors, (39), 33 states have call predecessors, (39), 33 states have call successors, (39) [2024-10-12 21:41:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 707 transitions. [2024-10-12 21:41:53,164 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 707 transitions. Word has length 37 [2024-10-12 21:41:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:53,164 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 707 transitions. [2024-10-12 21:41:53,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 707 transitions. [2024-10-12 21:41:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 21:41:53,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:53,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:53,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:41:53,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:53,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2026632148, now seen corresponding path program 1 times [2024-10-12 21:41:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554328095] [2024-10-12 21:41:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:41:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:53,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554328095] [2024-10-12 21:41:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554328095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:53,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083186176] [2024-10-12 21:41:53,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:53,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:53,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:53,272 INFO L87 Difference]: Start difference. First operand 447 states and 707 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:53,817 INFO L93 Difference]: Finished difference Result 681 states and 1051 transitions. [2024-10-12 21:41:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-12 21:41:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:53,823 INFO L225 Difference]: With dead ends: 681 [2024-10-12 21:41:53,823 INFO L226 Difference]: Without dead ends: 570 [2024-10-12 21:41:53,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:53,825 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 855 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:53,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 683 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-12 21:41:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 547. [2024-10-12 21:41:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 484 states have (on average 1.5475206611570247) internal successors, (749), 490 states have internal predecessors, (749), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (53), 41 states have call predecessors, (53), 41 states have call successors, (53) [2024-10-12 21:41:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 847 transitions. [2024-10-12 21:41:53,895 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 847 transitions. Word has length 38 [2024-10-12 21:41:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:53,896 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 847 transitions. [2024-10-12 21:41:53,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 847 transitions. [2024-10-12 21:41:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 21:41:53,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:53,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:53,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:41:53,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:53,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:53,902 INFO L85 PathProgramCache]: Analyzing trace with hash -286996888, now seen corresponding path program 1 times [2024-10-12 21:41:53,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793159385] [2024-10-12 21:41:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 21:41:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:53,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793159385] [2024-10-12 21:41:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793159385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35743404] [2024-10-12 21:41:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:53,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:53,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:53,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:53,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:53,989 INFO L87 Difference]: Start difference. First operand 547 states and 847 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:54,593 INFO L93 Difference]: Finished difference Result 967 states and 1428 transitions. [2024-10-12 21:41:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:54,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-12 21:41:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:54,600 INFO L225 Difference]: With dead ends: 967 [2024-10-12 21:41:54,600 INFO L226 Difference]: Without dead ends: 756 [2024-10-12 21:41:54,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:54,602 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 328 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:54,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 967 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-12 21:41:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 652. [2024-10-12 21:41:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 577 states have (on average 1.5216637781629117) internal successors, (878), 585 states have internal predecessors, (878), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (59), 45 states have call predecessors, (59), 47 states have call successors, (59) [2024-10-12 21:41:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 988 transitions. [2024-10-12 21:41:54,664 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 988 transitions. Word has length 39 [2024-10-12 21:41:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:54,664 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 988 transitions. [2024-10-12 21:41:54,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 988 transitions. [2024-10-12 21:41:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 21:41:54,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:54,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:54,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:41:54,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:54,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash -722210131, now seen corresponding path program 1 times [2024-10-12 21:41:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774607679] [2024-10-12 21:41:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 21:41:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:54,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:41:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:54,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774607679] [2024-10-12 21:41:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774607679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:54,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126134196] [2024-10-12 21:41:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:54,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:54,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:54,787 INFO L87 Difference]: Start difference. First operand 652 states and 988 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:55,394 INFO L93 Difference]: Finished difference Result 1168 states and 1705 transitions. [2024-10-12 21:41:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:55,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-12 21:41:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:55,400 INFO L225 Difference]: With dead ends: 1168 [2024-10-12 21:41:55,400 INFO L226 Difference]: Without dead ends: 852 [2024-10-12 21:41:55,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:55,403 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 313 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:55,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1014 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-10-12 21:41:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 818. [2024-10-12 21:41:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 719 states have (on average 1.4659248956884563) internal successors, (1054), 729 states have internal predecessors, (1054), 65 states have call successors, (65), 30 states have call predecessors, (65), 32 states have return successors, (83), 59 states have call predecessors, (83), 61 states have call successors, (83) [2024-10-12 21:41:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1202 transitions. [2024-10-12 21:41:55,449 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1202 transitions. Word has length 54 [2024-10-12 21:41:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:55,449 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1202 transitions. [2024-10-12 21:41:55,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1202 transitions. [2024-10-12 21:41:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:41:55,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:55,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:41:55,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 734186141, now seen corresponding path program 1 times [2024-10-12 21:41:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068699075] [2024-10-12 21:41:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:41:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:41:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:41:55,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:55,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068699075] [2024-10-12 21:41:55,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068699075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:55,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:55,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507404401] [2024-10-12 21:41:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:55,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:55,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:55,562 INFO L87 Difference]: Start difference. First operand 818 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:56,089 INFO L93 Difference]: Finished difference Result 1397 states and 1981 transitions. [2024-10-12 21:41:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-12 21:41:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:56,096 INFO L225 Difference]: With dead ends: 1397 [2024-10-12 21:41:56,096 INFO L226 Difference]: Without dead ends: 995 [2024-10-12 21:41:56,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:56,098 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 841 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:56,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 695 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2024-10-12 21:41:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 946. [2024-10-12 21:41:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 831 states have (on average 1.430806257521059) internal successors, (1189), 843 states have internal predecessors, (1189), 73 states have call successors, (73), 36 states have call predecessors, (73), 40 states have return successors, (97), 67 states have call predecessors, (97), 69 states have call successors, (97) [2024-10-12 21:41:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1359 transitions. [2024-10-12 21:41:56,142 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1359 transitions. Word has length 59 [2024-10-12 21:41:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:56,142 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1359 transitions. [2024-10-12 21:41:56,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1359 transitions. [2024-10-12 21:41:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:56,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:56,144 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:56,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:41:56,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:56,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1816313296, now seen corresponding path program 1 times [2024-10-12 21:41:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091281255] [2024-10-12 21:41:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 21:41:56,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:56,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091281255] [2024-10-12 21:41:56,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091281255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353489464] [2024-10-12 21:41:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:56,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:56,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:56,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:56,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:41:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 21:41:56,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:41:56,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353489464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:56,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:56,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:41:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827066351] [2024-10-12 21:41:56,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:56,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:41:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:41:56,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:56,424 INFO L87 Difference]: Start difference. First operand 946 states and 1359 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:56,542 INFO L93 Difference]: Finished difference Result 1427 states and 2020 transitions. [2024-10-12 21:41:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:41:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:41:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:56,548 INFO L225 Difference]: With dead ends: 1427 [2024-10-12 21:41:56,548 INFO L226 Difference]: Without dead ends: 944 [2024-10-12 21:41:56,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:56,552 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 66 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:56,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1167 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-10-12 21:41:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 906. [2024-10-12 21:41:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 797 states have (on average 1.4178168130489335) internal successors, (1130), 809 states have internal predecessors, (1130), 69 states have call successors, (69), 34 states have call predecessors, (69), 38 states have return successors, (91), 63 states have call predecessors, (91), 65 states have call successors, (91) [2024-10-12 21:41:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1290 transitions. [2024-10-12 21:41:56,611 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1290 transitions. Word has length 60 [2024-10-12 21:41:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:56,612 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1290 transitions. [2024-10-12 21:41:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1290 transitions. [2024-10-12 21:41:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:56,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:56,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:56,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:41:56,818 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-10-12 21:41:56,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:56,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1408230321, now seen corresponding path program 1 times [2024-10-12 21:41:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223196379] [2024-10-12 21:41:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:56,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:41:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223196379] [2024-10-12 21:41:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223196379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325482052] [2024-10-12 21:41:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:56,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:56,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:56,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:56,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:41:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:57,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:41:57,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:41:57,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:57,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325482052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:41:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498660939] [2024-10-12 21:41:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:57,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:57,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:57,052 INFO L87 Difference]: Start difference. First operand 906 states and 1290 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:57,194 INFO L93 Difference]: Finished difference Result 1352 states and 1893 transitions. [2024-10-12 21:41:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:41:57,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:41:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:57,199 INFO L225 Difference]: With dead ends: 1352 [2024-10-12 21:41:57,199 INFO L226 Difference]: Without dead ends: 911 [2024-10-12 21:41:57,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:57,201 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:57,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2024-10-12 21:41:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 911. [2024-10-12 21:41:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 802 states have (on average 1.4052369077306732) internal successors, (1127), 814 states have internal predecessors, (1127), 69 states have call successors, (69), 34 states have call predecessors, (69), 38 states have return successors, (91), 63 states have call predecessors, (91), 65 states have call successors, (91) [2024-10-12 21:41:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1287 transitions. [2024-10-12 21:41:57,248 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1287 transitions. Word has length 60 [2024-10-12 21:41:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:57,248 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1287 transitions. [2024-10-12 21:41:57,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1287 transitions. [2024-10-12 21:41:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:57,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:57,253 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:57,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:41:57,457 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-10-12 21:41:57,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2042731473, now seen corresponding path program 1 times [2024-10-12 21:41:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:57,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586685979] [2024-10-12 21:41:57,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:57,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:41:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586685979] [2024-10-12 21:41:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586685979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93614335] [2024-10-12 21:41:57,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:57,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:57,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:57,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:57,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:41:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:57,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:41:57,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:41:57,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93614335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:57,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:41:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974245429] [2024-10-12 21:41:57,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:57,674 INFO L87 Difference]: Start difference. First operand 911 states and 1287 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:57,822 INFO L93 Difference]: Finished difference Result 1277 states and 1775 transitions. [2024-10-12 21:41:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:41:57,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:41:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:57,826 INFO L225 Difference]: With dead ends: 1277 [2024-10-12 21:41:57,826 INFO L226 Difference]: Without dead ends: 808 [2024-10-12 21:41:57,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:57,828 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:57,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-10-12 21:41:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 801. [2024-10-12 21:41:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 710 states have (on average 1.4183098591549297) internal successors, (1007), 720 states have internal predecessors, (1007), 59 states have call successors, (59), 28 states have call predecessors, (59), 30 states have return successors, (72), 53 states have call predecessors, (72), 55 states have call successors, (72) [2024-10-12 21:41:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1138 transitions. [2024-10-12 21:41:57,862 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1138 transitions. Word has length 60 [2024-10-12 21:41:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:57,863 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1138 transitions. [2024-10-12 21:41:57,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1138 transitions. [2024-10-12 21:41:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:57,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:57,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:57,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 21:41:58,064 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-10-12 21:41:58,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:58,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash -454596207, now seen corresponding path program 1 times [2024-10-12 21:41:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:58,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836354588] [2024-10-12 21:41:58,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:58,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836354588] [2024-10-12 21:41:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836354588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:41:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560810859] [2024-10-12 21:41:58,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:58,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:41:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:41:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:58,176 INFO L87 Difference]: Start difference. First operand 801 states and 1138 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:58,707 INFO L93 Difference]: Finished difference Result 882 states and 1235 transitions. [2024-10-12 21:41:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:41:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-12 21:41:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:58,711 INFO L225 Difference]: With dead ends: 882 [2024-10-12 21:41:58,712 INFO L226 Difference]: Without dead ends: 879 [2024-10-12 21:41:58,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:58,713 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 1405 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:58,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 685 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-10-12 21:41:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 800. [2024-10-12 21:41:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 710 states have (on average 1.4154929577464788) internal successors, (1005), 719 states have internal predecessors, (1005), 58 states have call successors, (58), 28 states have call predecessors, (58), 30 states have return successors, (72), 53 states have call predecessors, (72), 55 states have call successors, (72) [2024-10-12 21:41:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1135 transitions. [2024-10-12 21:41:58,765 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1135 transitions. Word has length 60 [2024-10-12 21:41:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:58,766 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1135 transitions. [2024-10-12 21:41:58,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1135 transitions. [2024-10-12 21:41:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:41:58,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:58,768 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:58,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:41:58,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:58,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:58,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1208939586, now seen corresponding path program 1 times [2024-10-12 21:41:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:58,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858831737] [2024-10-12 21:41:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:58,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:58,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858831737] [2024-10-12 21:41:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858831737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690292096] [2024-10-12 21:41:58,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:58,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:58,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:58,888 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:58,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:41:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:58,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:41:58,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:59,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:41:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:59,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690292096] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:41:59,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:41:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-12 21:41:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803668658] [2024-10-12 21:41:59,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:41:59,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:41:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:41:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:59,289 INFO L87 Difference]: Start difference. First operand 800 states and 1135 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:42:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:00,246 INFO L93 Difference]: Finished difference Result 1475 states and 1985 transitions. [2024-10-12 21:42:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:42:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-12 21:42:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:00,253 INFO L225 Difference]: With dead ends: 1475 [2024-10-12 21:42:00,253 INFO L226 Difference]: Without dead ends: 1472 [2024-10-12 21:42:00,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:42:00,254 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 1529 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:00,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 1534 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:42:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2024-10-12 21:42:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1093. [2024-10-12 21:42:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 967 states have (on average 1.37435367114788) internal successors, (1329), 982 states have internal predecessors, (1329), 77 states have call successors, (77), 41 states have call predecessors, (77), 47 states have return successors, (102), 70 states have call predecessors, (102), 74 states have call successors, (102) [2024-10-12 21:42:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1508 transitions. [2024-10-12 21:42:00,319 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1508 transitions. Word has length 61 [2024-10-12 21:42:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:00,321 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1508 transitions. [2024-10-12 21:42:00,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:42:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1508 transitions. [2024-10-12 21:42:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:42:00,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:00,325 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:00,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:42:00,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:00,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:00,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1619519811, now seen corresponding path program 2 times [2024-10-12 21:42:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:00,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592983945] [2024-10-12 21:42:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:00,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:00,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:42:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 21:42:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 21:42:00,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:00,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592983945] [2024-10-12 21:42:00,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592983945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:00,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:00,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:00,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156664289] [2024-10-12 21:42:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:00,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:00,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:00,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:00,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:00,588 INFO L87 Difference]: Start difference. First operand 1093 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:42:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:01,087 INFO L93 Difference]: Finished difference Result 1689 states and 2265 transitions. [2024-10-12 21:42:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:01,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-12 21:42:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:01,093 INFO L225 Difference]: With dead ends: 1689 [2024-10-12 21:42:01,093 INFO L226 Difference]: Without dead ends: 1100 [2024-10-12 21:42:01,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:01,095 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 851 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:01,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 705 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:42:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-10-12 21:42:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1029. [2024-10-12 21:42:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 910 states have (on average 1.3725274725274725) internal successors, (1249), 925 states have internal predecessors, (1249), 74 states have call successors, (74), 38 states have call predecessors, (74), 43 states have return successors, (97), 66 states have call predecessors, (97), 71 states have call successors, (97) [2024-10-12 21:42:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1420 transitions. [2024-10-12 21:42:01,147 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1420 transitions. Word has length 78 [2024-10-12 21:42:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:01,147 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1420 transitions. [2024-10-12 21:42:01,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:42:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1420 transitions. [2024-10-12 21:42:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:42:01,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:01,152 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:01,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:42:01,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:01,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1853714223, now seen corresponding path program 1 times [2024-10-12 21:42:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728292824] [2024-10-12 21:42:01,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:01,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 21:42:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 21:42:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 21:42:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 21:42:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:01,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728292824] [2024-10-12 21:42:01,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728292824] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:01,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360941264] [2024-10-12 21:42:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:01,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:01,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:01,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:42:01,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 21:42:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:42:01,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:42:01,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:42:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360941264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:42:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:42:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107791725] [2024-10-12 21:42:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:01,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:42:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:42:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:01,377 INFO L87 Difference]: Start difference. First operand 1029 states and 1420 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 21:42:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:01,491 INFO L93 Difference]: Finished difference Result 1310 states and 1769 transitions. [2024-10-12 21:42:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:42:01,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-12 21:42:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:01,494 INFO L225 Difference]: With dead ends: 1310 [2024-10-12 21:42:01,494 INFO L226 Difference]: Without dead ends: 331 [2024-10-12 21:42:01,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:01,497 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 54 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:01,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1157 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:42:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-12 21:42:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-10-12 21:42:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 297 states have (on average 1.6363636363636365) internal successors, (486), 299 states have internal predecessors, (486), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-12 21:42:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 538 transitions. [2024-10-12 21:42:01,513 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 538 transitions. Word has length 92 [2024-10-12 21:42:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 538 transitions. [2024-10-12 21:42:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 21:42:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 538 transitions. [2024-10-12 21:42:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:01,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:01,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:01,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 21:42:01,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 21:42:01,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash -899892870, now seen corresponding path program 1 times [2024-10-12 21:42:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926781099] [2024-10-12 21:42:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:01,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:01,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926781099] [2024-10-12 21:42:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926781099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:01,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:01,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:42:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522865257] [2024-10-12 21:42:01,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:01,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:42:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:01,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:42:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:01,910 INFO L87 Difference]: Start difference. First operand 331 states and 538 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:03,398 INFO L93 Difference]: Finished difference Result 774 states and 1278 transitions. [2024-10-12 21:42:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:42:03,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:03,401 INFO L225 Difference]: With dead ends: 774 [2024-10-12 21:42:03,401 INFO L226 Difference]: Without dead ends: 451 [2024-10-12 21:42:03,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:42:03,403 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 917 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:03,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 610 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:42:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-12 21:42:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 331. [2024-10-12 21:42:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 297 states have (on average 1.632996632996633) internal successors, (485), 299 states have internal predecessors, (485), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-12 21:42:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 537 transitions. [2024-10-12 21:42:03,426 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 537 transitions. Word has length 152 [2024-10-12 21:42:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:03,426 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 537 transitions. [2024-10-12 21:42:03,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 537 transitions. [2024-10-12 21:42:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:03,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:03,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:03,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:42:03,428 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:03,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1326447368, now seen corresponding path program 1 times [2024-10-12 21:42:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:03,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546577776] [2024-10-12 21:42:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:03,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:03,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546577776] [2024-10-12 21:42:03,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546577776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:03,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:42:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766084418] [2024-10-12 21:42:03,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:03,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:42:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:03,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:42:03,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:03,609 INFO L87 Difference]: Start difference. First operand 331 states and 537 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:04,974 INFO L93 Difference]: Finished difference Result 766 states and 1261 transitions. [2024-10-12 21:42:04,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:42:04,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:04,977 INFO L225 Difference]: With dead ends: 766 [2024-10-12 21:42:04,977 INFO L226 Difference]: Without dead ends: 451 [2024-10-12 21:42:04,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:42:04,979 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 908 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:04,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 608 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:42:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-12 21:42:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 331. [2024-10-12 21:42:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 297 states have (on average 1.6296296296296295) internal successors, (484), 299 states have internal predecessors, (484), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-12 21:42:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 536 transitions. [2024-10-12 21:42:05,015 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 536 transitions. Word has length 152 [2024-10-12 21:42:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:05,016 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 536 transitions. [2024-10-12 21:42:05,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 536 transitions. [2024-10-12 21:42:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:05,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:05,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:42:05,018 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1569566326, now seen corresponding path program 1 times [2024-10-12 21:42:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:05,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206224675] [2024-10-12 21:42:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:05,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206224675] [2024-10-12 21:42:05,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206224675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:05,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:42:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103212988] [2024-10-12 21:42:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:05,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:42:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:42:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:05,245 INFO L87 Difference]: Start difference. First operand 331 states and 536 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:07,568 INFO L93 Difference]: Finished difference Result 1214 states and 2012 transitions. [2024-10-12 21:42:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:42:07,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:07,574 INFO L225 Difference]: With dead ends: 1214 [2024-10-12 21:42:07,574 INFO L226 Difference]: Without dead ends: 901 [2024-10-12 21:42:07,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:07,576 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 1389 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:07,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 1027 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:42:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-10-12 21:42:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 660. [2024-10-12 21:42:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 599 states have (on average 1.641068447412354) internal successors, (983), 602 states have internal predecessors, (983), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-12 21:42:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1078 transitions. [2024-10-12 21:42:07,622 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1078 transitions. Word has length 152 [2024-10-12 21:42:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:07,623 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1078 transitions. [2024-10-12 21:42:07,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1078 transitions. [2024-10-12 21:42:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:07,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:07,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:07,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:42:07,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:07,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:07,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2106532210, now seen corresponding path program 1 times [2024-10-12 21:42:07,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:07,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042119135] [2024-10-12 21:42:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:07,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:07,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:07,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:07,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:07,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042119135] [2024-10-12 21:42:07,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042119135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:07,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:07,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518278103] [2024-10-12 21:42:07,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:07,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:07,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:07,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:07,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:07,929 INFO L87 Difference]: Start difference. First operand 660 states and 1078 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:10,999 INFO L93 Difference]: Finished difference Result 2011 states and 3340 transitions. [2024-10-12 21:42:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:11,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:11,007 INFO L225 Difference]: With dead ends: 2011 [2024-10-12 21:42:11,007 INFO L226 Difference]: Without dead ends: 1369 [2024-10-12 21:42:11,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:11,009 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1523 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 3011 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:11,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 1354 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3011 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:42:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-10-12 21:42:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 965. [2024-10-12 21:42:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 877 states have (on average 1.6351197263397947) internal successors, (1434), 881 states have internal predecessors, (1434), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-12 21:42:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1571 transitions. [2024-10-12 21:42:11,080 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1571 transitions. Word has length 152 [2024-10-12 21:42:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:11,080 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1571 transitions. [2024-10-12 21:42:11,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1571 transitions. [2024-10-12 21:42:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:11,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:11,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:11,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:42:11,083 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:11,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1513274960, now seen corresponding path program 1 times [2024-10-12 21:42:11,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538337600] [2024-10-12 21:42:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538337600] [2024-10-12 21:42:11,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538337600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:11,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:11,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508992586] [2024-10-12 21:42:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:11,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:11,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:11,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:11,377 INFO L87 Difference]: Start difference. First operand 965 states and 1571 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:13,027 INFO L93 Difference]: Finished difference Result 2330 states and 3867 transitions. [2024-10-12 21:42:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:13,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:13,034 INFO L225 Difference]: With dead ends: 2330 [2024-10-12 21:42:13,034 INFO L226 Difference]: Without dead ends: 1383 [2024-10-12 21:42:13,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:13,037 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1013 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:13,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1000 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:42:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-10-12 21:42:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 965. [2024-10-12 21:42:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 877 states have (on average 1.6316989737742302) internal successors, (1431), 881 states have internal predecessors, (1431), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-12 21:42:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1568 transitions. [2024-10-12 21:42:13,108 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1568 transitions. Word has length 152 [2024-10-12 21:42:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:13,108 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1568 transitions. [2024-10-12 21:42:13,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1568 transitions. [2024-10-12 21:42:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:13,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:13,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:13,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:42:13,111 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1833640370, now seen corresponding path program 1 times [2024-10-12 21:42:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220163862] [2024-10-12 21:42:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:13,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220163862] [2024-10-12 21:42:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220163862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282466825] [2024-10-12 21:42:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:13,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:13,341 INFO L87 Difference]: Start difference. First operand 965 states and 1568 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:15,128 INFO L93 Difference]: Finished difference Result 2326 states and 3850 transitions. [2024-10-12 21:42:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:15,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:15,135 INFO L225 Difference]: With dead ends: 2326 [2024-10-12 21:42:15,135 INFO L226 Difference]: Without dead ends: 1379 [2024-10-12 21:42:15,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:15,139 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1011 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:15,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1000 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:42:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-10-12 21:42:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 965. [2024-10-12 21:42:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 877 states have (on average 1.628278221208666) internal successors, (1428), 881 states have internal predecessors, (1428), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-12 21:42:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1565 transitions. [2024-10-12 21:42:15,214 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1565 transitions. Word has length 152 [2024-10-12 21:42:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:15,215 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1565 transitions. [2024-10-12 21:42:15,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1565 transitions. [2024-10-12 21:42:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:15,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:15,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:15,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:42:15,217 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:15,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1248868720, now seen corresponding path program 1 times [2024-10-12 21:42:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997598677] [2024-10-12 21:42:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:15,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:15,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997598677] [2024-10-12 21:42:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997598677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:15,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:15,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238525908] [2024-10-12 21:42:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:15,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:15,454 INFO L87 Difference]: Start difference. First operand 965 states and 1565 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:16,850 INFO L93 Difference]: Finished difference Result 2322 states and 3833 transitions. [2024-10-12 21:42:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:16,862 INFO L225 Difference]: With dead ends: 2322 [2024-10-12 21:42:16,862 INFO L226 Difference]: Without dead ends: 1375 [2024-10-12 21:42:16,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:16,865 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1151 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:16,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 840 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:42:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-10-12 21:42:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 965. [2024-10-12 21:42:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 877 states have (on average 1.6248574686431014) internal successors, (1425), 881 states have internal predecessors, (1425), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-12 21:42:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1562 transitions. [2024-10-12 21:42:16,954 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1562 transitions. Word has length 152 [2024-10-12 21:42:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:16,954 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1562 transitions. [2024-10-12 21:42:16,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1562 transitions. [2024-10-12 21:42:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:16,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:16,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:16,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:42:16,957 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:16,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 814363122, now seen corresponding path program 1 times [2024-10-12 21:42:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546065673] [2024-10-12 21:42:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546065673] [2024-10-12 21:42:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546065673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:17,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289039803] [2024-10-12 21:42:17,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:17,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:17,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:17,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:17,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:17,198 INFO L87 Difference]: Start difference. First operand 965 states and 1562 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:20,205 INFO L93 Difference]: Finished difference Result 3165 states and 5201 transitions. [2024-10-12 21:42:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:20,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:20,215 INFO L225 Difference]: With dead ends: 3165 [2024-10-12 21:42:20,215 INFO L226 Difference]: Without dead ends: 2218 [2024-10-12 21:42:20,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:20,232 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1408 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 3362 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:20,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 1960 Invalid, 3428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3362 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 21:42:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2024-10-12 21:42:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1587. [2024-10-12 21:42:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1445 states have (on average 1.617993079584775) internal successors, (2338), 1451 states have internal predecessors, (2338), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-12 21:42:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2563 transitions. [2024-10-12 21:42:20,357 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2563 transitions. Word has length 152 [2024-10-12 21:42:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:20,357 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2563 transitions. [2024-10-12 21:42:20,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2563 transitions. [2024-10-12 21:42:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:20,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:20,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:20,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:42:20,359 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:20,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash 384704816, now seen corresponding path program 1 times [2024-10-12 21:42:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:20,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869256197] [2024-10-12 21:42:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:20,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869256197] [2024-10-12 21:42:20,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869256197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:20,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:20,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394701335] [2024-10-12 21:42:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:20,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:20,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:20,595 INFO L87 Difference]: Start difference. First operand 1587 states and 2563 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:22,195 INFO L93 Difference]: Finished difference Result 3772 states and 6188 transitions. [2024-10-12 21:42:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:22,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:22,205 INFO L225 Difference]: With dead ends: 3772 [2024-10-12 21:42:22,205 INFO L226 Difference]: Without dead ends: 2203 [2024-10-12 21:42:22,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:22,209 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1008 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:22,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1000 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:42:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2024-10-12 21:42:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1587. [2024-10-12 21:42:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1445 states have (on average 1.6145328719723184) internal successors, (2333), 1451 states have internal predecessors, (2333), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-12 21:42:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2558 transitions. [2024-10-12 21:42:22,340 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2558 transitions. Word has length 152 [2024-10-12 21:42:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:22,340 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2558 transitions. [2024-10-12 21:42:22,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2558 transitions. [2024-10-12 21:42:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:22,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:22,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:22,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:42:22,343 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:22,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash -321891790, now seen corresponding path program 1 times [2024-10-12 21:42:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027276972] [2024-10-12 21:42:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:22,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027276972] [2024-10-12 21:42:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027276972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:22,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655275758] [2024-10-12 21:42:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:22,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:22,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:22,601 INFO L87 Difference]: Start difference. First operand 1587 states and 2558 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:25,589 INFO L93 Difference]: Finished difference Result 5405 states and 8826 transitions. [2024-10-12 21:42:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:25,601 INFO L225 Difference]: With dead ends: 5405 [2024-10-12 21:42:25,602 INFO L226 Difference]: Without dead ends: 3836 [2024-10-12 21:42:25,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:25,606 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1402 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:25,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 1960 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:42:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2024-10-12 21:42:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 2833. [2024-10-12 21:42:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2833 states, 2583 states have (on average 1.607820363917925) internal successors, (4153), 2593 states have internal predecessors, (4153), 187 states have call successors, (187), 55 states have call predecessors, (187), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-12 21:42:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 4560 transitions. [2024-10-12 21:42:25,821 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 4560 transitions. Word has length 152 [2024-10-12 21:42:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:25,821 INFO L471 AbstractCegarLoop]: Abstraction has 2833 states and 4560 transitions. [2024-10-12 21:42:25,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 4560 transitions. [2024-10-12 21:42:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:25,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:25,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:25,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:42:25,825 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:25,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 625146096, now seen corresponding path program 1 times [2024-10-12 21:42:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:25,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050564468] [2024-10-12 21:42:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:26,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:26,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050564468] [2024-10-12 21:42:26,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050564468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:26,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:26,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:26,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335477138] [2024-10-12 21:42:26,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:26,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:26,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:26,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:26,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:26,075 INFO L87 Difference]: Start difference. First operand 2833 states and 4560 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:29,099 INFO L93 Difference]: Finished difference Result 9883 states and 16114 transitions. [2024-10-12 21:42:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:29,130 INFO L225 Difference]: With dead ends: 9883 [2024-10-12 21:42:29,130 INFO L226 Difference]: Without dead ends: 7068 [2024-10-12 21:42:29,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:29,140 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1480 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:29,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1245 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 21:42:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7068 states. [2024-10-12 21:42:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7068 to 5339. [2024-10-12 21:42:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5339 states, 4873 states have (on average 1.6041452903755387) internal successors, (7817), 4891 states have internal predecessors, (7817), 347 states have call successors, (347), 103 states have call predecessors, (347), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-12 21:42:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5339 states to 5339 states and 8606 transitions. [2024-10-12 21:42:29,530 INFO L78 Accepts]: Start accepts. Automaton has 5339 states and 8606 transitions. Word has length 152 [2024-10-12 21:42:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:29,530 INFO L471 AbstractCegarLoop]: Abstraction has 5339 states and 8606 transitions. [2024-10-12 21:42:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 5339 states and 8606 transitions. [2024-10-12 21:42:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:29,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:29,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:29,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:42:29,536 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:29,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1425262802, now seen corresponding path program 1 times [2024-10-12 21:42:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:29,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982570414] [2024-10-12 21:42:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:29,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:29,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:29,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:29,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:29,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:29,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982570414] [2024-10-12 21:42:29,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982570414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:29,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:29,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:29,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091551576] [2024-10-12 21:42:29,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:29,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:29,768 INFO L87 Difference]: Start difference. First operand 5339 states and 8606 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:31,570 INFO L93 Difference]: Finished difference Result 12448 states and 20349 transitions. [2024-10-12 21:42:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:31,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:31,598 INFO L225 Difference]: With dead ends: 12448 [2024-10-12 21:42:31,598 INFO L226 Difference]: Without dead ends: 7127 [2024-10-12 21:42:31,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:31,613 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1012 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:31,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1000 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:42:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7127 states. [2024-10-12 21:42:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7127 to 5339. [2024-10-12 21:42:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5339 states, 4873 states have (on average 1.6006566796634516) internal successors, (7800), 4891 states have internal predecessors, (7800), 347 states have call successors, (347), 103 states have call predecessors, (347), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-12 21:42:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5339 states to 5339 states and 8589 transitions. [2024-10-12 21:42:32,115 INFO L78 Accepts]: Start accepts. Automaton has 5339 states and 8589 transitions. Word has length 152 [2024-10-12 21:42:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:32,116 INFO L471 AbstractCegarLoop]: Abstraction has 5339 states and 8589 transitions. [2024-10-12 21:42:32,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5339 states and 8589 transitions. [2024-10-12 21:42:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:32,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:32,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:32,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:42:32,120 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:32,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:32,121 INFO L85 PathProgramCache]: Analyzing trace with hash -937215696, now seen corresponding path program 1 times [2024-10-12 21:42:32,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:32,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844234380] [2024-10-12 21:42:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844234380] [2024-10-12 21:42:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844234380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:32,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:32,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:32,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703483748] [2024-10-12 21:42:32,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:32,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:32,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:32,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:32,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:32,341 INFO L87 Difference]: Start difference. First operand 5339 states and 8589 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:36,309 INFO L93 Difference]: Finished difference Result 21081 states and 34304 transitions. [2024-10-12 21:42:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:36,358 INFO L225 Difference]: With dead ends: 21081 [2024-10-12 21:42:36,359 INFO L226 Difference]: Without dead ends: 15760 [2024-10-12 21:42:36,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:42:36,376 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1788 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 3245 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:36,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 1953 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3245 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:42:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15760 states. [2024-10-12 21:42:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15760 to 10349. [2024-10-12 21:42:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10349 states, 9467 states have (on average 1.598394422731594) internal successors, (15132), 9501 states have internal predecessors, (15132), 651 states have call successors, (651), 199 states have call predecessors, (651), 230 states have return successors, (924), 680 states have call predecessors, (924), 649 states have call successors, (924) [2024-10-12 21:42:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10349 states to 10349 states and 16707 transitions. [2024-10-12 21:42:37,199 INFO L78 Accepts]: Start accepts. Automaton has 10349 states and 16707 transitions. Word has length 152 [2024-10-12 21:42:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:37,200 INFO L471 AbstractCegarLoop]: Abstraction has 10349 states and 16707 transitions. [2024-10-12 21:42:37,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 10349 states and 16707 transitions. [2024-10-12 21:42:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:37,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:37,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:37,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:42:37,207 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:37,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2029850898, now seen corresponding path program 1 times [2024-10-12 21:42:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81792131] [2024-10-12 21:42:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:37,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:37,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:37,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:37,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:37,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81792131] [2024-10-12 21:42:37,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81792131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:37,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:37,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230809936] [2024-10-12 21:42:37,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:37,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:37,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:37,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:37,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:37,432 INFO L87 Difference]: Start difference. First operand 10349 states and 16707 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:42,839 INFO L93 Difference]: Finished difference Result 40825 states and 66664 transitions. [2024-10-12 21:42:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:42,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:42,941 INFO L225 Difference]: With dead ends: 40825 [2024-10-12 21:42:42,941 INFO L226 Difference]: Without dead ends: 30494 [2024-10-12 21:42:42,976 INFO L431 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-10-12 21:42:42,977 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1479 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 3852 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:42,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1949 Invalid, 3920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3852 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 21:42:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30494 states. [2024-10-12 21:42:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30494 to 20046. [2024-10-12 21:42:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20046 states, 18348 states have (on average 1.5939611946806191) internal successors, (29246), 18414 states have internal predecessors, (29246), 1243 states have call successors, (1243), 391 states have call predecessors, (1243), 454 states have return successors, (2034), 1304 states have call predecessors, (2034), 1241 states have call successors, (2034) [2024-10-12 21:42:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20046 states to 20046 states and 32523 transitions. [2024-10-12 21:42:44,905 INFO L78 Accepts]: Start accepts. Automaton has 20046 states and 32523 transitions. Word has length 152 [2024-10-12 21:42:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:44,905 INFO L471 AbstractCegarLoop]: Abstraction has 20046 states and 32523 transitions. [2024-10-12 21:42:44,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20046 states and 32523 transitions. [2024-10-12 21:42:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:44,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:44,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:44,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 21:42:44,920 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:44,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash 982944112, now seen corresponding path program 1 times [2024-10-12 21:42:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:44,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451978338] [2024-10-12 21:42:44,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:44,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:45,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451978338] [2024-10-12 21:42:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451978338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:45,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:45,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:45,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171341415] [2024-10-12 21:42:45,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:45,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:45,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:45,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:45,172 INFO L87 Difference]: Start difference. First operand 20046 states and 32523 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:52,243 INFO L93 Difference]: Finished difference Result 78904 states and 129470 transitions. [2024-10-12 21:42:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:42:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 152 [2024-10-12 21:42:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:52,495 INFO L225 Difference]: With dead ends: 78904 [2024-10-12 21:42:52,495 INFO L226 Difference]: Without dead ends: 58876 [2024-10-12 21:42:52,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:42:52,844 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1716 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 3219 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:52,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 1953 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3219 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:42:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58876 states. [2024-10-12 21:42:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58876 to 39759. [2024-10-12 21:42:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39759 states, 36461 states have (on average 1.5938125668522531) internal successors, (58112), 36591 states have internal predecessors, (58112), 2395 states have call successors, (2395), 775 states have call predecessors, (2395), 902 states have return successors, (4708), 2520 states have call predecessors, (4708), 2393 states have call successors, (4708) [2024-10-12 21:42:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39759 states to 39759 states and 65215 transitions. [2024-10-12 21:42:56,276 INFO L78 Accepts]: Start accepts. Automaton has 39759 states and 65215 transitions. Word has length 152 [2024-10-12 21:42:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:56,277 INFO L471 AbstractCegarLoop]: Abstraction has 39759 states and 65215 transitions. [2024-10-12 21:42:56,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 39759 states and 65215 transitions. [2024-10-12 21:42:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 21:42:56,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:56,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:42:56,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:42:56,303 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:56,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:56,303 INFO L85 PathProgramCache]: Analyzing trace with hash -859531602, now seen corresponding path program 1 times [2024-10-12 21:42:56,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:56,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047312811] [2024-10-12 21:42:56,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:56,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 21:42:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 21:42:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 21:42:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047312811] [2024-10-12 21:42:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047312811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:56,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412809849] [2024-10-12 21:42:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:56,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:56,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:56,566 INFO L87 Difference]: Start difference. First operand 39759 states and 65215 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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)