./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.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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.07.cil-2.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 a0cf3566e24b445695278143ce06a9bd6b4348c9de696d02fe86c47eb1775574 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:09:31,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:09:31,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:09:31,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:09:31,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:09:31,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:09:31,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:09:31,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:09:31,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:09:31,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:09:31,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:09:31,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:09:31,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:09:31,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:09:31,419 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:09:31,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:09:31,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:09:31,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:09:31,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:09:31,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:09:31,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:09:31,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:09:31,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:09:31,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:09:31,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:09:31,439 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:09:31,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:09:31,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:09:31,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:09:31,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:09:31,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:09:31,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:09:31,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:09:31,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:09:31,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:09:31,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:09:31,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:09:31,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:09:31,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:09:31,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:09:31,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:09:31,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:09:31,444 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 -> a0cf3566e24b445695278143ce06a9bd6b4348c9de696d02fe86c47eb1775574 [2024-10-14 05:09:31,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:09:31,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:09:31,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:09:31,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:09:31,722 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:09:31,723 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.07.cil-2.c [2024-10-14 05:09:33,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:09:33,436 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:09:33,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.07.cil-2.c [2024-10-14 05:09:33,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08d6e84c4/6481697841834876b564cdcff8cc6e3d/FLAG6d1a7b2d9 [2024-10-14 05:09:33,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08d6e84c4/6481697841834876b564cdcff8cc6e3d [2024-10-14 05:09:33,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:09:33,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:09:33,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:09:33,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:09:33,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:09:33,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:09:33" (1/1) ... [2024-10-14 05:09:33,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a800659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:33, skipping insertion in model container [2024-10-14 05:09:33,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:09:33" (1/1) ... [2024-10-14 05:09:33,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:09:33,739 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.07.cil-2.c[913,926] [2024-10-14 05:09:33,811 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.07.cil-2.c[5977,5990] [2024-10-14 05:09:33,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:09:33,917 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:09:33,930 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.07.cil-2.c[913,926] [2024-10-14 05:09:33,960 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.07.cil-2.c[5977,5990] [2024-10-14 05:09:34,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:09:34,051 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:09:34,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34 WrapperNode [2024-10-14 05:09:34,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:09:34,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:09:34,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:09:34,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:09:34,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,135 INFO L138 Inliner]: procedures = 62, calls = 70, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 789 [2024-10-14 05:09:34,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:09:34,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:09:34,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:09:34,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:09:34,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,192 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-14 05:09:34,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:09:34,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:09:34,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:09:34,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:09:34,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (1/1) ... [2024-10-14 05:09:34,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:09:34,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:34,295 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-14 05:09:34,304 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-14 05:09:34,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:09:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:09:34,378 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:09:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-14 05:09:34,378 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-14 05:09:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:09:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:09:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:09:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:09:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:09:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:09:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:09:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:09:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:09:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:09:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:09:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:09:34,380 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:09:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:09:34,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:09:34,380 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:09:34,380 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:09:34,381 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-14 05:09:34,381 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-14 05:09:34,502 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:09:34,504 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:09:35,088 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-10-14 05:09:35,088 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:09:35,128 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:09:35,129 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-14 05:09:35,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:09:35 BoogieIcfgContainer [2024-10-14 05:09:35,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:09:35,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:09:35,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:09:35,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:09:35,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:09:33" (1/3) ... [2024-10-14 05:09:35,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e07548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:09:35, skipping insertion in model container [2024-10-14 05:09:35,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:34" (2/3) ... [2024-10-14 05:09:35,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e07548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:09:35, skipping insertion in model container [2024-10-14 05:09:35,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:09:35" (3/3) ... [2024-10-14 05:09:35,136 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.07.cil-2.c [2024-10-14 05:09:35,149 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:09:35,150 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:09:35,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:09:35,215 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;@6aae25a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:09:35,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:09:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 262 states have (on average 1.7099236641221374) internal successors, (448), 269 states have internal predecessors, (448), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-14 05:09:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 05:09:35,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:35,230 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-14 05:09:35,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:35,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:35,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1627235855, now seen corresponding path program 1 times [2024-10-14 05:09:35,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886505510] [2024-10-14 05:09:35,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:35,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:35,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:35,601 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-14 05:09:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886505510] [2024-10-14 05:09:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886505510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:35,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356695059] [2024-10-14 05:09:35,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:35,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:35,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:35,645 INFO L87 Difference]: Start difference. First operand has 304 states, 262 states have (on average 1.7099236641221374) internal successors, (448), 269 states have internal predecessors, (448), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) 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-14 05:09:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:36,060 INFO L93 Difference]: Finished difference Result 653 states and 1086 transitions. [2024-10-14 05:09:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:36,063 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-14 05:09:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:36,073 INFO L225 Difference]: With dead ends: 653 [2024-10-14 05:09:36,074 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 05:09:36,079 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-14 05:09:36,082 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 614 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:36,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 559 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 05:09:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 05:09:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 355. [2024-10-14 05:09:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 309 states have (on average 1.5631067961165048) internal successors, (483), 314 states have internal predecessors, (483), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2024-10-14 05:09:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 551 transitions. [2024-10-14 05:09:36,155 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 551 transitions. Word has length 37 [2024-10-14 05:09:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:36,155 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 551 transitions. [2024-10-14 05:09:36,156 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-14 05:09:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 551 transitions. [2024-10-14 05:09:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 05:09:36,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:36,159 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-14 05:09:36,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:09:36,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:36,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash -910468857, now seen corresponding path program 1 times [2024-10-14 05:09:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:36,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137938456] [2024-10-14 05:09:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:09:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,303 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-14 05:09:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137938456] [2024-10-14 05:09:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137938456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:36,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:36,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:36,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256757786] [2024-10-14 05:09:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:36,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:36,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:36,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:36,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:36,309 INFO L87 Difference]: Start difference. First operand 355 states and 551 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-14 05:09:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:36,708 INFO L93 Difference]: Finished difference Result 589 states and 895 transitions. [2024-10-14 05:09:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:36,709 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-14 05:09:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:36,715 INFO L225 Difference]: With dead ends: 589 [2024-10-14 05:09:36,716 INFO L226 Difference]: Without dead ends: 478 [2024-10-14 05:09:36,718 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-14 05:09:36,720 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 633 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:36,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 531 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:09:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-14 05:09:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 455. [2024-10-14 05:09:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 396 states have (on average 1.5176767676767677) internal successors, (601), 402 states have internal predecessors, (601), 41 states have call successors, (41), 16 states have call predecessors, (41), 16 states have return successors, (49), 37 states have call predecessors, (49), 37 states have call successors, (49) [2024-10-14 05:09:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 691 transitions. [2024-10-14 05:09:36,789 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 691 transitions. Word has length 38 [2024-10-14 05:09:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:36,789 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 691 transitions. [2024-10-14 05:09:36,790 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-14 05:09:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 691 transitions. [2024-10-14 05:09:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 05:09:36,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:36,794 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-14 05:09:36,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:09:36,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:36,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2094613582, now seen corresponding path program 1 times [2024-10-14 05:09:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:36,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332341750] [2024-10-14 05:09:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,891 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-14 05:09:36,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:36,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332341750] [2024-10-14 05:09:36,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332341750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:36,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:36,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:36,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453145515] [2024-10-14 05:09:36,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:36,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:36,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:36,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:36,894 INFO L87 Difference]: Start difference. First operand 455 states and 691 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-14 05:09:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:37,348 INFO L93 Difference]: Finished difference Result 875 states and 1272 transitions. [2024-10-14 05:09:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:37,350 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-14 05:09:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:37,353 INFO L225 Difference]: With dead ends: 875 [2024-10-14 05:09:37,355 INFO L226 Difference]: Without dead ends: 664 [2024-10-14 05:09:37,356 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-14 05:09:37,357 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 261 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:37,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 739 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:09:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-14 05:09:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 560. [2024-10-14 05:09:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 489 states have (on average 1.492842535787321) internal successors, (730), 497 states have internal predecessors, (730), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (55), 41 states have call predecessors, (55), 43 states have call successors, (55) [2024-10-14 05:09:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 832 transitions. [2024-10-14 05:09:37,388 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 832 transitions. Word has length 39 [2024-10-14 05:09:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:37,389 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 832 transitions. [2024-10-14 05:09:37,389 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-14 05:09:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 832 transitions. [2024-10-14 05:09:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 05:09:37,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:37,393 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-14 05:09:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:09:37,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash 529085284, now seen corresponding path program 1 times [2024-10-14 05:09:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033482228] [2024-10-14 05:09:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 05:09:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,500 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-14 05:09:37,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033482228] [2024-10-14 05:09:37,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033482228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:37,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:37,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549604009] [2024-10-14 05:09:37,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:37,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:37,507 INFO L87 Difference]: Start difference. First operand 560 states and 832 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-14 05:09:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:38,060 INFO L93 Difference]: Finished difference Result 1076 states and 1549 transitions. [2024-10-14 05:09:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:38,061 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-14 05:09:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:38,066 INFO L225 Difference]: With dead ends: 1076 [2024-10-14 05:09:38,066 INFO L226 Difference]: Without dead ends: 760 [2024-10-14 05:09:38,067 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-14 05:09:38,068 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 246 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:38,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 788 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:09:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-14 05:09:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 726. [2024-10-14 05:09:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 631 states have (on average 1.4358161648177497) internal successors, (906), 641 states have internal predecessors, (906), 61 states have call successors, (61), 30 states have call predecessors, (61), 32 states have return successors, (79), 55 states have call predecessors, (79), 57 states have call successors, (79) [2024-10-14 05:09:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1046 transitions. [2024-10-14 05:09:38,109 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1046 transitions. Word has length 54 [2024-10-14 05:09:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:38,109 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1046 transitions. [2024-10-14 05:09:38,110 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-14 05:09:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1046 transitions. [2024-10-14 05:09:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:09:38,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:38,113 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-14 05:09:38,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:09:38,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:38,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -510676343, now seen corresponding path program 1 times [2024-10-14 05:09:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830356232] [2024-10-14 05:09:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:09:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,169 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-14 05:09:38,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:38,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830356232] [2024-10-14 05:09:38,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830356232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:38,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985767405] [2024-10-14 05:09:38,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:38,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:38,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:38,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:38,188 INFO L87 Difference]: Start difference. First operand 726 states and 1046 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-14 05:09:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:38,608 INFO L93 Difference]: Finished difference Result 1305 states and 1825 transitions. [2024-10-14 05:09:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:38,612 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-14 05:09:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:38,620 INFO L225 Difference]: With dead ends: 1305 [2024-10-14 05:09:38,621 INFO L226 Difference]: Without dead ends: 903 [2024-10-14 05:09:38,622 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-14 05:09:38,623 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 622 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:38,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 543 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:09:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-10-14 05:09:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 854. [2024-10-14 05:09:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 743 states have (on average 1.4010767160161508) internal successors, (1041), 755 states have internal predecessors, (1041), 69 states have call successors, (69), 36 states have call predecessors, (69), 40 states have return successors, (93), 63 states have call predecessors, (93), 65 states have call successors, (93) [2024-10-14 05:09:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1203 transitions. [2024-10-14 05:09:38,701 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1203 transitions. Word has length 59 [2024-10-14 05:09:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:38,702 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1203 transitions. [2024-10-14 05:09:38,702 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-14 05:09:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1203 transitions. [2024-10-14 05:09:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:38,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:38,705 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-14 05:09:38,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:09:38,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:38,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1033637536, now seen corresponding path program 1 times [2024-10-14 05:09:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559950527] [2024-10-14 05:09:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 05:09:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559950527] [2024-10-14 05:09:38,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559950527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369927838] [2024-10-14 05:09:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:38,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:38,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:38,873 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-14 05:09:38,874 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-14 05:09:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:38,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:09:38,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:39,025 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-14 05:09:39,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369927838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:39,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:09:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183359537] [2024-10-14 05:09:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:39,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:39,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:39,030 INFO L87 Difference]: Start difference. First operand 854 states and 1203 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-14 05:09:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:39,137 INFO L93 Difference]: Finished difference Result 1335 states and 1864 transitions. [2024-10-14 05:09:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:39,137 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-14 05:09:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:39,143 INFO L225 Difference]: With dead ends: 1335 [2024-10-14 05:09:39,143 INFO L226 Difference]: Without dead ends: 852 [2024-10-14 05:09:39,145 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-14 05:09:39,147 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 66 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:39,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 879 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:09:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-10-14 05:09:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 814. [2024-10-14 05:09:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 709 states have (on average 1.385049365303244) internal successors, (982), 721 states have internal predecessors, (982), 65 states have call successors, (65), 34 states have call predecessors, (65), 38 states have return successors, (87), 59 states have call predecessors, (87), 61 states have call successors, (87) [2024-10-14 05:09:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1134 transitions. [2024-10-14 05:09:39,199 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1134 transitions. Word has length 60 [2024-10-14 05:09:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:39,200 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1134 transitions. [2024-10-14 05:09:39,201 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-14 05:09:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1134 transitions. [2024-10-14 05:09:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:39,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:39,203 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-14 05:09:39,222 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-14 05:09:39,403 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-14 05:09:39,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:39,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash 36786143, now seen corresponding path program 1 times [2024-10-14 05:09:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272500187] [2024-10-14 05:09:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:39,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:39,512 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-14 05:09:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272500187] [2024-10-14 05:09:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272500187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133484959] [2024-10-14 05:09:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:39,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:39,516 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-14 05:09:39,519 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-14 05:09:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:39,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:09:39,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:39,670 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-14 05:09:39,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:39,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133484959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:39,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-14 05:09:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252086769] [2024-10-14 05:09:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:39,672 INFO L87 Difference]: Start difference. First operand 814 states and 1134 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 05:09:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:39,803 INFO L93 Difference]: Finished difference Result 1186 states and 1641 transitions. [2024-10-14 05:09:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:09:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-10-14 05:09:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:39,809 INFO L225 Difference]: With dead ends: 1186 [2024-10-14 05:09:39,810 INFO L226 Difference]: Without dead ends: 830 [2024-10-14 05:09:39,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:39,811 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 0 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:39,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1284 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:09:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-14 05:09:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-10-14 05:09:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 725 states have (on average 1.376551724137931) internal successors, (998), 737 states have internal predecessors, (998), 65 states have call successors, (65), 34 states have call predecessors, (65), 38 states have return successors, (87), 59 states have call predecessors, (87), 61 states have call successors, (87) [2024-10-14 05:09:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1150 transitions. [2024-10-14 05:09:39,841 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1150 transitions. Word has length 60 [2024-10-14 05:09:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:39,842 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1150 transitions. [2024-10-14 05:09:39,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 05:09:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1150 transitions. [2024-10-14 05:09:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:39,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:39,844 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-14 05:09:39,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:40,044 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-14 05:09:40,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:40,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash -221379295, now seen corresponding path program 1 times [2024-10-14 05:09:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745761299] [2024-10-14 05:09:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,114 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-14 05:09:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745761299] [2024-10-14 05:09:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745761299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:40,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433648765] [2024-10-14 05:09:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:40,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:40,116 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-14 05:09:40,117 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-14 05:09:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:09:40,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:40,198 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-14 05:09:40,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433648765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:40,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:40,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:09:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21912700] [2024-10-14 05:09:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:40,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:40,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:40,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:40,200 INFO L87 Difference]: Start difference. First operand 830 states and 1150 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-14 05:09:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:40,275 INFO L93 Difference]: Finished difference Result 1211 states and 1660 transitions. [2024-10-14 05:09:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:09:40,275 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-14 05:09:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:40,278 INFO L225 Difference]: With dead ends: 1211 [2024-10-14 05:09:40,279 INFO L226 Difference]: Without dead ends: 731 [2024-10-14 05:09:40,281 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-14 05:09:40,282 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 0 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:40,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1282 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:09:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-14 05:09:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 717. [2024-10-14 05:09:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 630 states have (on average 1.3857142857142857) internal successors, (873), 640 states have internal predecessors, (873), 55 states have call successors, (55), 28 states have call predecessors, (55), 30 states have return successors, (68), 49 states have call predecessors, (68), 51 states have call successors, (68) [2024-10-14 05:09:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 996 transitions. [2024-10-14 05:09:40,307 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 996 transitions. Word has length 60 [2024-10-14 05:09:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:40,307 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 996 transitions. [2024-10-14 05:09:40,307 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-14 05:09:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 996 transitions. [2024-10-14 05:09:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:40,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:40,308 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-14 05:09:40,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 05:09:40,512 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-14 05:09:40,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:40,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1576260321, now seen corresponding path program 1 times [2024-10-14 05:09:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:40,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686138644] [2024-10-14 05:09:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:40,597 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-14 05:09:40,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:40,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686138644] [2024-10-14 05:09:40,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686138644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:40,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:40,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:09:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500530589] [2024-10-14 05:09:40,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:40,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:09:40,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:09:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:40,599 INFO L87 Difference]: Start difference. First operand 717 states and 996 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-14 05:09:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:41,035 INFO L93 Difference]: Finished difference Result 815 states and 1113 transitions. [2024-10-14 05:09:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:09:41,036 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-14 05:09:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:41,040 INFO L225 Difference]: With dead ends: 815 [2024-10-14 05:09:41,040 INFO L226 Difference]: Without dead ends: 812 [2024-10-14 05:09:41,040 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-14 05:09:41,041 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1027 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:41,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 554 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:09:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-14 05:09:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 716. [2024-10-14 05:09:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 630 states have (on average 1.3825396825396825) internal successors, (871), 639 states have internal predecessors, (871), 54 states have call successors, (54), 28 states have call predecessors, (54), 30 states have return successors, (68), 49 states have call predecessors, (68), 51 states have call successors, (68) [2024-10-14 05:09:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 993 transitions. [2024-10-14 05:09:41,103 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 993 transitions. Word has length 60 [2024-10-14 05:09:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:41,104 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 993 transitions. [2024-10-14 05:09:41,104 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-14 05:09:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 993 transitions. [2024-10-14 05:09:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:09:41,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:41,105 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-14 05:09:41,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:09:41,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:41,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1618367978, now seen corresponding path program 1 times [2024-10-14 05:09:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500506711] [2024-10-14 05:09:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,244 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-14 05:09:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500506711] [2024-10-14 05:09:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500506711] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874361837] [2024-10-14 05:09:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:41,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:41,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:41,246 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-14 05:09:41,247 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-14 05:09:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:09:41,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:41,522 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-14 05:09:41,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:09:41,584 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-14 05:09:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874361837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:09:41,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:09:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-14 05:09:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537440782] [2024-10-14 05:09:41,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:09:41,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:09:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:09:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:09:41,587 INFO L87 Difference]: Start difference. First operand 716 states and 993 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-14 05:09:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:42,281 INFO L93 Difference]: Finished difference Result 1425 states and 1885 transitions. [2024-10-14 05:09:42,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 05:09:42,282 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-14 05:09:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:42,286 INFO L225 Difference]: With dead ends: 1425 [2024-10-14 05:09:42,286 INFO L226 Difference]: Without dead ends: 1422 [2024-10-14 05:09:42,287 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-14 05:09:42,287 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 793 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:42,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1519 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:09:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-10-14 05:09:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1009. [2024-10-14 05:09:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 887 states have (on average 1.3494926719278466) internal successors, (1197), 902 states have internal predecessors, (1197), 73 states have call successors, (73), 41 states have call predecessors, (73), 47 states have return successors, (98), 66 states have call predecessors, (98), 70 states have call successors, (98) [2024-10-14 05:09:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1368 transitions. [2024-10-14 05:09:42,328 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1368 transitions. Word has length 61 [2024-10-14 05:09:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:42,328 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1368 transitions. [2024-10-14 05:09:42,329 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-14 05:09:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1368 transitions. [2024-10-14 05:09:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:09:42,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:42,331 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-14 05:09:42,343 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-14 05:09:42,531 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-14 05:09:42,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:42,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash -603689555, now seen corresponding path program 2 times [2024-10-14 05:09:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:42,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792090327] [2024-10-14 05:09:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 05:09:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,570 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-14 05:09:42,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:42,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792090327] [2024-10-14 05:09:42,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792090327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:42,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:42,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:42,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125283374] [2024-10-14 05:09:42,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:42,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:42,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:42,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:42,571 INFO L87 Difference]: Start difference. First operand 1009 states and 1368 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-14 05:09:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:42,864 INFO L93 Difference]: Finished difference Result 1622 states and 2145 transitions. [2024-10-14 05:09:42,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:42,865 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-14 05:09:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:42,868 INFO L225 Difference]: With dead ends: 1622 [2024-10-14 05:09:42,868 INFO L226 Difference]: Without dead ends: 1025 [2024-10-14 05:09:42,870 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-14 05:09:42,870 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 623 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:42,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 561 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2024-10-14 05:09:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 937. [2024-10-14 05:09:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 822 states have (on average 1.3418491484184916) internal successors, (1103), 837 states have internal predecessors, (1103), 70 states have call successors, (70), 38 states have call predecessors, (70), 43 states have return successors, (93), 62 states have call predecessors, (93), 67 states have call successors, (93) [2024-10-14 05:09:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1266 transitions. [2024-10-14 05:09:42,905 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1266 transitions. Word has length 78 [2024-10-14 05:09:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:42,905 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1266 transitions. [2024-10-14 05:09:42,905 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-14 05:09:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1266 transitions. [2024-10-14 05:09:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 05:09:42,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:42,907 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-14 05:09:42,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:09:42,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:42,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash -71181957, now seen corresponding path program 1 times [2024-10-14 05:09:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:42,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114391435] [2024-10-14 05:09:42,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 05:09:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 05:09:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 05:09:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:42,968 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-14 05:09:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:42,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114391435] [2024-10-14 05:09:42,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114391435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:42,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683420283] [2024-10-14 05:09:42,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:42,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:42,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:42,970 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-14 05:09:42,971 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-14 05:09:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:43,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:43,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:43,087 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-14 05:09:43,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683420283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:43,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:43,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:09:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052634914] [2024-10-14 05:09:43,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:43,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:43,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:43,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:43,089 INFO L87 Difference]: Start difference. First operand 937 states and 1266 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-14 05:09:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:43,175 INFO L93 Difference]: Finished difference Result 1218 states and 1617 transitions. [2024-10-14 05:09:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:43,176 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-14 05:09:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:43,178 INFO L225 Difference]: With dead ends: 1218 [2024-10-14 05:09:43,178 INFO L226 Difference]: Without dead ends: 239 [2024-10-14 05:09:43,179 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-14 05:09:43,180 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 54 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:43,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 870 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:09:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-14 05:09:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-10-14 05:09:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 209 states have (on average 1.6172248803827751) internal successors, (338), 211 states have internal predecessors, (338), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 05:09:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 382 transitions. [2024-10-14 05:09:43,192 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 382 transitions. Word has length 92 [2024-10-14 05:09:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:43,192 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 382 transitions. [2024-10-14 05:09:43,192 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-14 05:09:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 382 transitions. [2024-10-14 05:09:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:43,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:43,194 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] [2024-10-14 05:09:43,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 05:09:43,394 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-14 05:09:43,395 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1460201102, now seen corresponding path program 1 times [2024-10-14 05:09:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423700157] [2024-10-14 05:09:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:43,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:43,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:43,490 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-14 05:09:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423700157] [2024-10-14 05:09:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423700157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:09:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812990013] [2024-10-14 05:09:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:43,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:09:43,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:09:43,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:43,492 INFO L87 Difference]: Start difference. First operand 239 states and 382 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-14 05:09:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:44,324 INFO L93 Difference]: Finished difference Result 548 states and 890 transitions. [2024-10-14 05:09:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:09:44,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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 112 [2024-10-14 05:09:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:44,327 INFO L225 Difference]: With dead ends: 548 [2024-10-14 05:09:44,327 INFO L226 Difference]: Without dead ends: 319 [2024-10-14 05:09:44,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:09:44,328 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 635 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:44,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 446 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:09:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-14 05:09:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2024-10-14 05:09:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 209 states have (on average 1.61244019138756) internal successors, (337), 211 states have internal predecessors, (337), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 05:09:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 381 transitions. [2024-10-14 05:09:44,347 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 381 transitions. Word has length 112 [2024-10-14 05:09:44,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:44,347 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 381 transitions. [2024-10-14 05:09:44,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-14 05:09:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 381 transitions. [2024-10-14 05:09:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:44,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:44,348 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] [2024-10-14 05:09:44,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:09:44,349 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:44,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1527623796, now seen corresponding path program 1 times [2024-10-14 05:09:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157275119] [2024-10-14 05:09:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:44,552 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-14 05:09:44,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157275119] [2024-10-14 05:09:44,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157275119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:44,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:09:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737308864] [2024-10-14 05:09:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:44,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:09:44,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:09:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:44,555 INFO L87 Difference]: Start difference. First operand 239 states and 381 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-14 05:09:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:46,136 INFO L93 Difference]: Finished difference Result 858 states and 1401 transitions. [2024-10-14 05:09:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:09:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 112 [2024-10-14 05:09:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:46,139 INFO L225 Difference]: With dead ends: 858 [2024-10-14 05:09:46,139 INFO L226 Difference]: Without dead ends: 633 [2024-10-14 05:09:46,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:46,140 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 948 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:46,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 750 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:09:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-10-14 05:09:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 472. [2024-10-14 05:09:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 419 states have (on average 1.6229116945107398) internal successors, (680), 422 states have internal predecessors, (680), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-14 05:09:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 759 transitions. [2024-10-14 05:09:46,165 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 759 transitions. Word has length 112 [2024-10-14 05:09:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:46,165 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 759 transitions. [2024-10-14 05:09:46,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-14 05:09:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 759 transitions. [2024-10-14 05:09:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:46,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:46,167 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] [2024-10-14 05:09:46,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:09:46,167 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:46,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1710612298, now seen corresponding path program 1 times [2024-10-14 05:09:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:46,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133789851] [2024-10-14 05:09:46,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:46,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:46,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:46,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:46,355 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-14 05:09:46,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133789851] [2024-10-14 05:09:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133789851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438821401] [2024-10-14 05:09:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:46,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:46,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:46,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:46,357 INFO L87 Difference]: Start difference. First operand 472 states and 759 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:48,444 INFO L93 Difference]: Finished difference Result 1413 states and 2307 transitions. [2024-10-14 05:09:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:09:48,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:09:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:48,449 INFO L225 Difference]: With dead ends: 1413 [2024-10-14 05:09:48,449 INFO L226 Difference]: Without dead ends: 955 [2024-10-14 05:09:48,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:09:48,451 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 961 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:48,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 1426 Invalid, 2443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 05:09:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-10-14 05:09:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 688. [2024-10-14 05:09:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 612 states have (on average 1.6160130718954249) internal successors, (989), 616 states have internal predecessors, (989), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-14 05:09:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1102 transitions. [2024-10-14 05:09:48,536 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1102 transitions. Word has length 112 [2024-10-14 05:09:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:48,536 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1102 transitions. [2024-10-14 05:09:48,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1102 transitions. [2024-10-14 05:09:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:48,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:48,538 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] [2024-10-14 05:09:48,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:09:48,538 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:48,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1232969780, now seen corresponding path program 1 times [2024-10-14 05:09:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:48,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189714096] [2024-10-14 05:09:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:48,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:48,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:09:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189714096] [2024-10-14 05:09:48,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189714096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:48,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:48,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745592494] [2024-10-14 05:09:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:48,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:48,710 INFO L87 Difference]: Start difference. First operand 688 states and 1102 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:50,919 INFO L93 Difference]: Finished difference Result 2226 states and 3628 transitions. [2024-10-14 05:09:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:09:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:09:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:50,928 INFO L225 Difference]: With dead ends: 2226 [2024-10-14 05:09:50,929 INFO L226 Difference]: Without dead ends: 1552 [2024-10-14 05:09:50,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:09:50,931 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 965 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:50,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1424 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 05:09:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-10-14 05:09:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1121. [2024-10-14 05:09:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 999 states have (on average 1.6096096096096095) internal successors, (1608), 1005 states have internal predecessors, (1608), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 05:09:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1793 transitions. [2024-10-14 05:09:51,021 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1793 transitions. Word has length 112 [2024-10-14 05:09:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:51,021 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1793 transitions. [2024-10-14 05:09:51,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1793 transitions. [2024-10-14 05:09:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:51,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:51,023 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] [2024-10-14 05:09:51,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:09:51,023 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1443022602, now seen corresponding path program 1 times [2024-10-14 05:09:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:51,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977834572] [2024-10-14 05:09:51,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:51,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:51,252 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-14 05:09:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977834572] [2024-10-14 05:09:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977834572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:51,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230950439] [2024-10-14 05:09:51,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:51,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:51,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:51,255 INFO L87 Difference]: Start difference. First operand 1121 states and 1793 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:52,634 INFO L93 Difference]: Finished difference Result 2643 states and 4302 transitions. [2024-10-14 05:09:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:09:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:09:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:52,642 INFO L225 Difference]: With dead ends: 2643 [2024-10-14 05:09:52,642 INFO L226 Difference]: Without dead ends: 1536 [2024-10-14 05:09:52,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:52,646 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 706 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:52,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 720 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:09:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-10-14 05:09:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1121. [2024-10-14 05:09:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 999 states have (on average 1.6046046046046045) internal successors, (1603), 1005 states have internal predecessors, (1603), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 05:09:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1788 transitions. [2024-10-14 05:09:52,806 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1788 transitions. Word has length 112 [2024-10-14 05:09:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:52,806 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1788 transitions. [2024-10-14 05:09:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1788 transitions. [2024-10-14 05:09:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:52,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:52,809 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] [2024-10-14 05:09:52,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:09:52,809 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:52,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1414522312, now seen corresponding path program 1 times [2024-10-14 05:09:52,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551163361] [2024-10-14 05:09:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:53,018 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-14 05:09:53,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551163361] [2024-10-14 05:09:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551163361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308564826] [2024-10-14 05:09:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:53,020 INFO L87 Difference]: Start difference. First operand 1121 states and 1788 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:53,975 INFO L93 Difference]: Finished difference Result 2637 states and 4275 transitions. [2024-10-14 05:09:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:09:53,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:09:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:53,985 INFO L225 Difference]: With dead ends: 2637 [2024-10-14 05:09:53,985 INFO L226 Difference]: Without dead ends: 1530 [2024-10-14 05:09:53,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:53,988 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 704 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:53,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 720 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:09:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-10-14 05:09:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1121. [2024-10-14 05:09:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 999 states have (on average 1.5995995995995995) internal successors, (1598), 1005 states have internal predecessors, (1598), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 05:09:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1783 transitions. [2024-10-14 05:09:54,084 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1783 transitions. Word has length 112 [2024-10-14 05:09:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:54,084 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1783 transitions. [2024-10-14 05:09:54,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1783 transitions. [2024-10-14 05:09:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:54,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:54,085 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] [2024-10-14 05:09:54,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:09:54,086 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:54,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash -526059702, now seen corresponding path program 1 times [2024-10-14 05:09:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946241534] [2024-10-14 05:09:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:54,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:54,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:54,245 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-14 05:09:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946241534] [2024-10-14 05:09:54,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946241534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:54,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:54,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:54,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380597632] [2024-10-14 05:09:54,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:54,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:54,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:54,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:54,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:54,247 INFO L87 Difference]: Start difference. First operand 1121 states and 1783 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:56,248 INFO L93 Difference]: Finished difference Result 3772 states and 6079 transitions. [2024-10-14 05:09:56,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:09:56,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:09:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:56,258 INFO L225 Difference]: With dead ends: 3772 [2024-10-14 05:09:56,258 INFO L226 Difference]: Without dead ends: 2665 [2024-10-14 05:09:56,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:09:56,261 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 947 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:56,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1424 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:09:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2024-10-14 05:09:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2003. [2024-10-14 05:09:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2003 states, 1789 states have (on average 1.593068753493572) internal successors, (2850), 1799 states have internal predecessors, (2850), 151 states have call successors, (151), 55 states have call predecessors, (151), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-10-14 05:09:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 3185 transitions. [2024-10-14 05:09:56,445 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 3185 transitions. Word has length 112 [2024-10-14 05:09:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:56,446 INFO L471 AbstractCegarLoop]: Abstraction has 2003 states and 3185 transitions. [2024-10-14 05:09:56,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 3185 transitions. [2024-10-14 05:09:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:56,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:56,447 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] [2024-10-14 05:09:56,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:09:56,448 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1351003528, now seen corresponding path program 1 times [2024-10-14 05:09:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:56,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529731886] [2024-10-14 05:09:56,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:56,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:56,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:56,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:56,569 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-14 05:09:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529731886] [2024-10-14 05:09:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529731886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:56,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816612825] [2024-10-14 05:09:56,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:56,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:56,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:56,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:56,571 INFO L87 Difference]: Start difference. First operand 2003 states and 3185 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:57,614 INFO L93 Difference]: Finished difference Result 4657 states and 7514 transitions. [2024-10-14 05:09:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:09:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:09:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:57,623 INFO L225 Difference]: With dead ends: 4657 [2024-10-14 05:09:57,623 INFO L226 Difference]: Without dead ends: 2668 [2024-10-14 05:09:57,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:57,628 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 703 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:57,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 720 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:09:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2024-10-14 05:09:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2003. [2024-10-14 05:09:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2003 states, 1789 states have (on average 1.5880380100614868) internal successors, (2841), 1799 states have internal predecessors, (2841), 151 states have call successors, (151), 55 states have call predecessors, (151), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-10-14 05:09:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 3176 transitions. [2024-10-14 05:09:57,750 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 3176 transitions. Word has length 112 [2024-10-14 05:09:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:57,750 INFO L471 AbstractCegarLoop]: Abstraction has 2003 states and 3176 transitions. [2024-10-14 05:09:57,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:09:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 3176 transitions. [2024-10-14 05:09:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:09:57,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:57,752 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] [2024-10-14 05:09:57,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:09:57,752 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:57,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash 580269962, now seen corresponding path program 1 times [2024-10-14 05:09:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:57,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113326035] [2024-10-14 05:09:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:57,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:09:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:09:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:57,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:09:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:57,888 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-14 05:09:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:57,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113326035] [2024-10-14 05:09:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113326035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:57,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:57,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:57,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799072651] [2024-10-14 05:09:57,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:57,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:57,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:57,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:57,890 INFO L87 Difference]: Start difference. First operand 2003 states and 3176 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:00,075 INFO L93 Difference]: Finished difference Result 7626 states and 12229 transitions. [2024-10-14 05:10:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:10:00,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:10:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:00,100 INFO L225 Difference]: With dead ends: 7626 [2024-10-14 05:10:00,101 INFO L226 Difference]: Without dead ends: 5637 [2024-10-14 05:10:00,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:10:00,108 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1263 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:00,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 928 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:10:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2024-10-14 05:10:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 3761. [2024-10-14 05:10:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3761 states, 3371 states have (on average 1.5832097300504302) internal successors, (5337), 3389 states have internal predecessors, (5337), 271 states have call successors, (271), 103 states have call predecessors, (271), 118 states have return successors, (366), 284 states have call predecessors, (366), 269 states have call successors, (366) [2024-10-14 05:10:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 5974 transitions. [2024-10-14 05:10:00,353 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 5974 transitions. Word has length 112 [2024-10-14 05:10:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:00,356 INFO L471 AbstractCegarLoop]: Abstraction has 3761 states and 5974 transitions. [2024-10-14 05:10:00,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 5974 transitions. [2024-10-14 05:10:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:10:00,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:00,358 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] [2024-10-14 05:10:00,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:10:00,359 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:00,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash -414423736, now seen corresponding path program 1 times [2024-10-14 05:10:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:00,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153841602] [2024-10-14 05:10:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:00,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:10:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:10:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:00,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:10:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:10:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:00,522 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-14 05:10:00,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:00,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153841602] [2024-10-14 05:10:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153841602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:00,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487819162] [2024-10-14 05:10:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:00,524 INFO L87 Difference]: Start difference. First operand 3761 states and 5974 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:03,090 INFO L93 Difference]: Finished difference Result 14390 states and 23121 transitions. [2024-10-14 05:10:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:10:03,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:10:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:03,133 INFO L225 Difference]: With dead ends: 14390 [2024-10-14 05:10:03,133 INFO L226 Difference]: Without dead ends: 10643 [2024-10-14 05:10:03,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:10:03,147 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 993 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:03,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1413 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 05:10:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10643 states. [2024-10-14 05:10:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10643 to 7114. [2024-10-14 05:10:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7114 states, 6380 states have (on average 1.5753918495297805) internal successors, (10051), 6414 states have internal predecessors, (10051), 503 states have call successors, (503), 199 states have call predecessors, (503), 230 states have return successors, (776), 532 states have call predecessors, (776), 501 states have call successors, (776) [2024-10-14 05:10:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7114 states to 7114 states and 11330 transitions. [2024-10-14 05:10:03,673 INFO L78 Accepts]: Start accepts. Automaton has 7114 states and 11330 transitions. Word has length 112 [2024-10-14 05:10:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:03,676 INFO L471 AbstractCegarLoop]: Abstraction has 7114 states and 11330 transitions. [2024-10-14 05:10:03,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7114 states and 11330 transitions. [2024-10-14 05:10:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:10:03,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:03,681 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] [2024-10-14 05:10:03,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:10:03,681 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:03,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1000699958, now seen corresponding path program 1 times [2024-10-14 05:10:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692370578] [2024-10-14 05:10:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:03,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:10:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:03,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:10:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:10:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:10:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:03,864 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-14 05:10:03,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:03,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692370578] [2024-10-14 05:10:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692370578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:03,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:03,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750818324] [2024-10-14 05:10:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:03,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:03,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:03,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:03,866 INFO L87 Difference]: Start difference. First operand 7114 states and 11330 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:05,598 INFO L93 Difference]: Finished difference Result 16321 states and 26383 transitions. [2024-10-14 05:10:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:05,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:10:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:05,625 INFO L225 Difference]: With dead ends: 16321 [2024-10-14 05:10:05,626 INFO L226 Difference]: Without dead ends: 9221 [2024-10-14 05:10:05,649 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-14 05:10:05,650 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 805 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:05,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 602 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:10:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2024-10-14 05:10:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 7114. [2024-10-14 05:10:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7114 states, 6380 states have (on average 1.5702194357366772) internal successors, (10018), 6414 states have internal predecessors, (10018), 503 states have call successors, (503), 199 states have call predecessors, (503), 230 states have return successors, (776), 532 states have call predecessors, (776), 501 states have call successors, (776) [2024-10-14 05:10:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7114 states to 7114 states and 11297 transitions. [2024-10-14 05:10:06,404 INFO L78 Accepts]: Start accepts. Automaton has 7114 states and 11297 transitions. Word has length 112 [2024-10-14 05:10:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:06,405 INFO L471 AbstractCegarLoop]: Abstraction has 7114 states and 11297 transitions. [2024-10-14 05:10:06,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7114 states and 11297 transitions. [2024-10-14 05:10:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:10:06,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:06,409 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] [2024-10-14 05:10:06,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:10:06,410 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1335692552, now seen corresponding path program 1 times [2024-10-14 05:10:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750736700] [2024-10-14 05:10:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:10:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:10:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:10:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:06,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:10:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:06,548 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-14 05:10:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:06,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750736700] [2024-10-14 05:10:06,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750736700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:06,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:06,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207620589] [2024-10-14 05:10:06,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:06,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:06,550 INFO L87 Difference]: Start difference. First operand 7114 states and 11297 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:09,718 INFO L93 Difference]: Finished difference Result 26377 states and 42387 transitions. [2024-10-14 05:10:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:10:09,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:10:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:09,768 INFO L225 Difference]: With dead ends: 26377 [2024-10-14 05:10:09,768 INFO L226 Difference]: Without dead ends: 19277 [2024-10-14 05:10:09,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:10:09,790 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 1051 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:09,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1417 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:10:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19277 states. [2024-10-14 05:10:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19277 to 14045. [2024-10-14 05:10:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14045 states, 12639 states have (on average 1.5691114803386343) internal successors, (19832), 12705 states have internal predecessors, (19832), 951 states have call successors, (951), 391 states have call predecessors, (951), 454 states have return successors, (1742), 1012 states have call predecessors, (1742), 949 states have call successors, (1742) [2024-10-14 05:10:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14045 states to 14045 states and 22525 transitions. [2024-10-14 05:10:10,901 INFO L78 Accepts]: Start accepts. Automaton has 14045 states and 22525 transitions. Word has length 112 [2024-10-14 05:10:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:10,902 INFO L471 AbstractCegarLoop]: Abstraction has 14045 states and 22525 transitions. [2024-10-14 05:10:10,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 14045 states and 22525 transitions. [2024-10-14 05:10:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:10:10,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:10,915 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] [2024-10-14 05:10:10,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:10:10,915 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:10,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash -543438394, now seen corresponding path program 1 times [2024-10-14 05:10:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:10,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628681523] [2024-10-14 05:10:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:10,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:11,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:10:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:10:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:10:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:11,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:10:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:11,174 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-14 05:10:11,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:11,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628681523] [2024-10-14 05:10:11,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628681523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:11,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:11,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:11,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281755605] [2024-10-14 05:10:11,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:11,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:11,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:11,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:11,177 INFO L87 Difference]: Start difference. First operand 14045 states and 22525 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:13,534 INFO L93 Difference]: Finished difference Result 31841 states and 51838 transitions. [2024-10-14 05:10:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:13,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:10:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:13,689 INFO L225 Difference]: With dead ends: 31841 [2024-10-14 05:10:13,689 INFO L226 Difference]: Without dead ends: 17810 [2024-10-14 05:10:13,760 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-14 05:10:13,764 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 802 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:13,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 602 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:10:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17810 states. [2024-10-14 05:10:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17810 to 14045. [2024-10-14 05:10:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14045 states, 12639 states have (on average 1.5639686684073106) internal successors, (19767), 12705 states have internal predecessors, (19767), 951 states have call successors, (951), 391 states have call predecessors, (951), 454 states have return successors, (1742), 1012 states have call predecessors, (1742), 949 states have call successors, (1742) [2024-10-14 05:10:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14045 states to 14045 states and 22460 transitions. [2024-10-14 05:10:15,133 INFO L78 Accepts]: Start accepts. Automaton has 14045 states and 22460 transitions. Word has length 112 [2024-10-14 05:10:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 14045 states and 22460 transitions. [2024-10-14 05:10:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 14045 states and 22460 transitions. [2024-10-14 05:10:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:10:15,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:15,145 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] [2024-10-14 05:10:15,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:10:15,145 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:15,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 781417800, now seen corresponding path program 1 times [2024-10-14 05:10:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077168751] [2024-10-14 05:10:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:10:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:10:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:10:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:10:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:15,388 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-14 05:10:15,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:15,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077168751] [2024-10-14 05:10:15,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077168751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:15,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:15,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:15,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515983836] [2024-10-14 05:10:15,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:15,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:15,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:15,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:15,391 INFO L87 Difference]: Start difference. First operand 14045 states and 22460 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:21,259 INFO L93 Difference]: Finished difference Result 50392 states and 81525 transitions. [2024-10-14 05:10:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:10:21,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:10:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:21,527 INFO L225 Difference]: With dead ends: 50392 [2024-10-14 05:10:21,527 INFO L226 Difference]: Without dead ends: 36361 [2024-10-14 05:10:21,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:10:21,601 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 935 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:21,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1417 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 05:10:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36361 states. [2024-10-14 05:10:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36361 to 27967. [2024-10-14 05:10:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27967 states, 25249 states have (on average 1.562477721889976) internal successors, (39451), 25379 states have internal predecessors, (39451), 1815 states have call successors, (1815), 775 states have call predecessors, (1815), 902 states have return successors, (4128), 1940 states have call predecessors, (4128), 1813 states have call successors, (4128) [2024-10-14 05:10:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27967 states to 27967 states and 45394 transitions. [2024-10-14 05:10:25,445 INFO L78 Accepts]: Start accepts. Automaton has 27967 states and 45394 transitions. Word has length 112 [2024-10-14 05:10:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:25,446 INFO L471 AbstractCegarLoop]: Abstraction has 27967 states and 45394 transitions. [2024-10-14 05:10:25,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27967 states and 45394 transitions. [2024-10-14 05:10:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:10:25,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:25,462 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] [2024-10-14 05:10:25,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:10:25,462 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:25,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1946791546, now seen corresponding path program 1 times [2024-10-14 05:10:25,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:25,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308802829] [2024-10-14 05:10:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:10:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:10:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:10:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:10:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,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-14 05:10:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308802829] [2024-10-14 05:10:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308802829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:25,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:25,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:25,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131480116] [2024-10-14 05:10:25,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:25,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:25,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:25,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:25,595 INFO L87 Difference]: Start difference. First operand 27967 states and 45394 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:34,176 INFO L93 Difference]: Finished difference Result 98360 states and 161757 transitions. [2024-10-14 05:10:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:10:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-14 05:10:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:34,415 INFO L225 Difference]: With dead ends: 98360 [2024-10-14 05:10:34,416 INFO L226 Difference]: Without dead ends: 70407 [2024-10-14 05:10:34,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:10:34,495 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 934 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:34,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1417 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:10:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70407 states. [2024-10-14 05:10:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70407 to 55808. [2024-10-14 05:10:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55808 states, 50530 states have (on average 1.562260043538492) internal successors, (78941), 50788 states have internal predecessors, (78941), 3479 states have call successors, (3479), 1543 states have call predecessors, (3479), 1798 states have return successors, (10294), 3732 states have call predecessors, (10294), 3477 states have call successors, (10294) [2024-10-14 05:10:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55808 states to 55808 states and 92714 transitions. [2024-10-14 05:10:39,272 INFO L78 Accepts]: Start accepts. Automaton has 55808 states and 92714 transitions. Word has length 112 [2024-10-14 05:10:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:39,272 INFO L471 AbstractCegarLoop]: Abstraction has 55808 states and 92714 transitions. [2024-10-14 05:10:39,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 05:10:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 55808 states and 92714 transitions. [2024-10-14 05:10:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:10:39,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:39,500 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] [2024-10-14 05:10:39,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 05:10:39,500 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:39,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1290337672, now seen corresponding path program 1 times [2024-10-14 05:10:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:39,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210920295] [2024-10-14 05:10:39,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:39,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:39,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:10:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:39,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:10:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:39,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:10:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:10:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:39,712 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-14 05:10:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210920295] [2024-10-14 05:10:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210920295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:10:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032643056] [2024-10-14 05:10:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:39,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:10:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:10:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:39,718 INFO L87 Difference]: Start difference. First operand 55808 states and 92714 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-14 05:10:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:50,873 INFO L93 Difference]: Finished difference Result 158318 states and 261646 transitions. [2024-10-14 05:10:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:10:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 112 [2024-10-14 05:10:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:51,261 INFO L225 Difference]: With dead ends: 158318 [2024-10-14 05:10:51,261 INFO L226 Difference]: Without dead ends: 102525 [2024-10-14 05:10:51,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:10:51,436 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 1200 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:51,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 1056 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:10:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102525 states.