./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-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.11.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 67b249d19bfb29e53a3ada528cfb44b497320fbfc38e7386ce56807633f41524 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:10:16,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:10:16,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:10:16,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:10:16,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:10:16,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:10:16,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:10:16,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:10:16,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:10:16,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:10:16,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:10:16,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:10:16,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:10:16,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:10:16,704 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:10:16,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:10:16,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:10:16,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:10:16,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:10:16,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:10:16,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:10:16,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:10:16,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:10:16,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:10:16,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:10:16,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:10:16,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:10:16,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:10:16,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:10:16,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:10:16,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:10:16,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:10:16,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:10:16,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:10:16,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:10:16,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:10:16,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:10:16,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:10:16,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:10:16,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:10:16,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:10:16,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:10:16,715 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 -> 67b249d19bfb29e53a3ada528cfb44b497320fbfc38e7386ce56807633f41524 [2024-10-14 05:10:16,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:10:17,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:10:17,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:10:17,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:10:17,025 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:10:17,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2024-10-14 05:10:18,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:10:18,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:10:18,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2024-10-14 05:10:18,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7a01db6/eb216ab3ccad41d09779dfd9092c3194/FLAG957f66b8b [2024-10-14 05:10:18,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7a01db6/eb216ab3ccad41d09779dfd9092c3194 [2024-10-14 05:10:18,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:10:18,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:10:18,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:10:18,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:10:18,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:10:18,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:10:18" (1/1) ... [2024-10-14 05:10:18,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c97a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:18, skipping insertion in model container [2024-10-14 05:10:18,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:10:18" (1/1) ... [2024-10-14 05:10:18,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:10:19,023 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c[913,926] [2024-10-14 05:10:19,087 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c[5977,5990] [2024-10-14 05:10:19,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:10:19,236 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:10:19,248 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c[913,926] [2024-10-14 05:10:19,279 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c[5977,5990] [2024-10-14 05:10:19,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:10:19,403 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:10:19,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19 WrapperNode [2024-10-14 05:10:19,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:10:19,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:10:19,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:10:19,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:10:19,413 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:10:19" (1/1) ... [2024-10-14 05:10:19,427 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:10:19" (1/1) ... [2024-10-14 05:10:19,470 INFO L138 Inliner]: procedures = 70, calls = 81, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1023 [2024-10-14 05:10:19,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:10:19,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:10:19,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:10:19,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:10:19,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,507 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:10:19,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:10:19,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:10:19,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:10:19,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:10:19,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (1/1) ... [2024-10-14 05:10:19,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:10:19,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:19,615 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:10:19,621 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:10:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:10:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:10:19,669 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:10:19,669 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-14 05:10:19,671 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-14 05:10:19,671 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:10:19,672 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:10:19,672 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:10:19,672 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:10:19,672 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:10:19,672 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:10:19,672 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:10:19,672 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:10:19,673 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:10:19,673 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:10:19,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:10:19,673 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:10:19,673 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:10:19,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:10:19,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:10:19,674 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:10:19,674 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:10:19,880 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:10:19,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:10:20,861 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-14 05:10:20,861 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:10:20,972 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:10:20,974 INFO L314 CfgBuilder]: Removed 18 assume(true) statements. [2024-10-14 05:10:20,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:10:20 BoogieIcfgContainer [2024-10-14 05:10:20,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:10:20,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:10:20,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:10:20,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:10:20,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:10:18" (1/3) ... [2024-10-14 05:10:20,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b889e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:10:20, skipping insertion in model container [2024-10-14 05:10:20,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:19" (2/3) ... [2024-10-14 05:10:20,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b889e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:10:20, skipping insertion in model container [2024-10-14 05:10:20,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:10:20" (3/3) ... [2024-10-14 05:10:20,985 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2024-10-14 05:10:21,001 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:10:21,002 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:10:21,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:10:21,112 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;@4ee94e69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:10:21,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:10:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 345 states have (on average 1.7217391304347827) internal successors, (594), 350 states have internal predecessors, (594), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 05:10:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 05:10:21,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:21,131 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:10:21,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:21,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2103410286, now seen corresponding path program 1 times [2024-10-14 05:10:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866585809] [2024-10-14 05:10:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:21,515 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:21,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:21,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866585809] [2024-10-14 05:10:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866585809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:21,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:21,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647058889] [2024-10-14 05:10:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:21,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:21,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:21,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:21,553 INFO L87 Difference]: Start difference. First operand has 388 states, 345 states have (on average 1.7217391304347827) internal successors, (594), 350 states have internal predecessors, (594), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) 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:10:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:22,292 INFO L93 Difference]: Finished difference Result 818 states and 1378 transitions. [2024-10-14 05:10:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:22,296 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:10:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:22,313 INFO L225 Difference]: With dead ends: 818 [2024-10-14 05:10:22,314 INFO L226 Difference]: Without dead ends: 446 [2024-10-14 05:10:22,325 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:10:22,330 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 829 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:22,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 664 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:10:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-14 05:10:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2024-10-14 05:10:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 392 states have (on average 1.5841836734693877) internal successors, (621), 396 states have internal predecessors, (621), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (39), 33 states have call predecessors, (39), 33 states have call successors, (39) [2024-10-14 05:10:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 695 transitions. [2024-10-14 05:10:22,424 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 695 transitions. Word has length 37 [2024-10-14 05:10:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:22,425 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 695 transitions. [2024-10-14 05:10:22,425 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:10:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 695 transitions. [2024-10-14 05:10:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 05:10:22,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:22,430 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:10:22,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:10:22,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:22,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1043030482, now seen corresponding path program 1 times [2024-10-14 05:10:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:22,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387511050] [2024-10-14 05:10:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:10:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:22,538 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:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387511050] [2024-10-14 05:10:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387511050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:22,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080861845] [2024-10-14 05:10:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:22,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:22,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:22,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:22,542 INFO L87 Difference]: Start difference. First operand 440 states and 695 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:10:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:23,173 INFO L93 Difference]: Finished difference Result 674 states and 1039 transitions. [2024-10-14 05:10:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:23,174 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:10:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:23,181 INFO L225 Difference]: With dead ends: 674 [2024-10-14 05:10:23,181 INFO L226 Difference]: Without dead ends: 563 [2024-10-14 05:10:23,182 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:10:23,184 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 842 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:23,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 663 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:10:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-10-14 05:10:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 540. [2024-10-14 05:10:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 479 states have (on average 1.5427974947807934) internal successors, (739), 484 states have internal predecessors, (739), 43 states have call successors, (43), 15 states have call predecessors, (43), 16 states have return successors, (53), 41 states have call predecessors, (53), 41 states have call successors, (53) [2024-10-14 05:10:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 835 transitions. [2024-10-14 05:10:23,244 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 835 transitions. Word has length 38 [2024-10-14 05:10:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:23,245 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 835 transitions. [2024-10-14 05:10:23,245 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:10:23,245 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 835 transitions. [2024-10-14 05:10:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 05:10:23,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:23,247 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:10:23,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:10:23,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:23,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash 146035582, now seen corresponding path program 1 times [2024-10-14 05:10:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:23,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094828587] [2024-10-14 05:10:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:23,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:23,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:10:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:23,338 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:23,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:23,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094828587] [2024-10-14 05:10:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094828587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:23,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:23,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:23,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593732177] [2024-10-14 05:10:23,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:23,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:23,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:23,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:23,344 INFO L87 Difference]: Start difference. First operand 540 states and 835 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:10:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:24,028 INFO L93 Difference]: Finished difference Result 960 states and 1416 transitions. [2024-10-14 05:10:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:24,029 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:10:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:24,036 INFO L225 Difference]: With dead ends: 960 [2024-10-14 05:10:24,036 INFO L226 Difference]: Without dead ends: 749 [2024-10-14 05:10:24,037 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:10:24,038 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 327 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:24,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 936 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:10:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-10-14 05:10:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 645. [2024-10-14 05:10:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 572 states have (on average 1.5174825174825175) internal successors, (868), 579 states have internal predecessors, (868), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (59), 45 states have call predecessors, (59), 47 states have call successors, (59) [2024-10-14 05:10:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 976 transitions. [2024-10-14 05:10:24,093 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 976 transitions. Word has length 39 [2024-10-14 05:10:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:24,094 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 976 transitions. [2024-10-14 05:10:24,095 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:10:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 976 transitions. [2024-10-14 05:10:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 05:10:24,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:24,100 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:10:24,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:10:24,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:24,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -701033479, now seen corresponding path program 1 times [2024-10-14 05:10:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:24,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258779128] [2024-10-14 05:10:24,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 05:10:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:10:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,224 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:10:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:24,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258779128] [2024-10-14 05:10:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258779128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:24,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:24,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663961840] [2024-10-14 05:10:24,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:24,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:24,226 INFO L87 Difference]: Start difference. First operand 645 states and 976 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:10:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:24,839 INFO L93 Difference]: Finished difference Result 1161 states and 1693 transitions. [2024-10-14 05:10:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:24,839 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:10:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:24,845 INFO L225 Difference]: With dead ends: 1161 [2024-10-14 05:10:24,845 INFO L226 Difference]: Without dead ends: 845 [2024-10-14 05:10:24,846 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:10:24,847 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 312 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:24,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 983 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-14 05:10:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 811. [2024-10-14 05:10:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 714 states have (on average 1.4621848739495797) internal successors, (1044), 723 states have internal predecessors, (1044), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (83), 59 states have call predecessors, (83), 61 states have call successors, (83) [2024-10-14 05:10:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1190 transitions. [2024-10-14 05:10:24,896 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1190 transitions. Word has length 54 [2024-10-14 05:10:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:24,897 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1190 transitions. [2024-10-14 05:10:24,898 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:10:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1190 transitions. [2024-10-14 05:10:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:10:24,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:24,901 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:10:24,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:10:24,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:24,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1508684440, now seen corresponding path program 1 times [2024-10-14 05:10:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756922511] [2024-10-14 05:10:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:24,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:10:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,005 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:10:25,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:25,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756922511] [2024-10-14 05:10:25,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756922511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:25,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:25,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985148899] [2024-10-14 05:10:25,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:25,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:25,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:25,008 INFO L87 Difference]: Start difference. First operand 811 states and 1190 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:10:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:25,517 INFO L93 Difference]: Finished difference Result 1390 states and 1969 transitions. [2024-10-14 05:10:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:25,518 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:10:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:25,526 INFO L225 Difference]: With dead ends: 1390 [2024-10-14 05:10:25,527 INFO L226 Difference]: Without dead ends: 988 [2024-10-14 05:10:25,532 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:10:25,533 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 828 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:25,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 675 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:10:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-10-14 05:10:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 939. [2024-10-14 05:10:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 826 states have (on average 1.4273607748184018) internal successors, (1179), 837 states have internal predecessors, (1179), 71 states have call successors, (71), 35 states have call predecessors, (71), 40 states have return successors, (97), 67 states have call predecessors, (97), 69 states have call successors, (97) [2024-10-14 05:10:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1347 transitions. [2024-10-14 05:10:25,595 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1347 transitions. Word has length 59 [2024-10-14 05:10:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:25,595 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1347 transitions. [2024-10-14 05:10:25,595 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:10:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1347 transitions. [2024-10-14 05:10:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:25,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:25,597 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:10:25,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:10:25,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:25,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1389820358, now seen corresponding path program 1 times [2024-10-14 05:10:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:25,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176642987] [2024-10-14 05:10:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:10:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176642987] [2024-10-14 05:10:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176642987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19032919] [2024-10-14 05:10:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:25,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:25,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:25,730 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:10:25,731 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:10:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:25,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:10:25,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:10:25,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19032919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:25,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:10:25,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060889150] [2024-10-14 05:10:25,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:25,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:25,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:25,896 INFO L87 Difference]: Start difference. First operand 939 states and 1347 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:26,053 INFO L93 Difference]: Finished difference Result 1427 states and 2021 transitions. [2024-10-14 05:10:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:10:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:10:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:26,059 INFO L225 Difference]: With dead ends: 1427 [2024-10-14 05:10:26,060 INFO L226 Difference]: Without dead ends: 944 [2024-10-14 05:10:26,061 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:10:26,062 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 0 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:26,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1681 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-10-14 05:10:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2024-10-14 05:10:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 831 states have (on average 1.4151624548736461) internal successors, (1176), 842 states have internal predecessors, (1176), 71 states have call successors, (71), 35 states have call predecessors, (71), 40 states have return successors, (97), 67 states have call predecessors, (97), 69 states have call successors, (97) [2024-10-14 05:10:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1344 transitions. [2024-10-14 05:10:26,106 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1344 transitions. Word has length 60 [2024-10-14 05:10:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:26,106 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1344 transitions. [2024-10-14 05:10:26,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1344 transitions. [2024-10-14 05:10:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:26,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:26,108 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:10:26,126 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:10:26,309 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:10:26,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:26,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:26,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2061141436, now seen corresponding path program 1 times [2024-10-14 05:10:26,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:26,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699599952] [2024-10-14 05:10:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:26,414 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:10:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699599952] [2024-10-14 05:10:26,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699599952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246200622] [2024-10-14 05:10:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:26,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:26,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:26,416 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:10:26,418 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:10:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:26,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:10:26,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:26,533 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:10:26,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246200622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:26,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:10:26,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896845000] [2024-10-14 05:10:26,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:26,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:26,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:26,536 INFO L87 Difference]: Start difference. First operand 944 states and 1344 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:10:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:26,666 INFO L93 Difference]: Finished difference Result 1370 states and 1923 transitions. [2024-10-14 05:10:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:10:26,667 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:10:26,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:26,671 INFO L225 Difference]: With dead ends: 1370 [2024-10-14 05:10:26,672 INFO L226 Difference]: Without dead ends: 841 [2024-10-14 05:10:26,673 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:10:26,676 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 0 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:26,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1681 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-10-14 05:10:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 834. [2024-10-14 05:10:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 739 states have (on average 1.4248985115020298) internal successors, (1053), 748 states have internal predecessors, (1053), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (78), 57 states have call predecessors, (78), 59 states have call successors, (78) [2024-10-14 05:10:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1192 transitions. [2024-10-14 05:10:26,717 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1192 transitions. Word has length 60 [2024-10-14 05:10:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:26,717 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1192 transitions. [2024-10-14 05:10:26,718 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:10:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1192 transitions. [2024-10-14 05:10:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:26,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:26,723 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:10:26,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 05:10:26,923 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:10:26,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:26,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:26,924 INFO L85 PathProgramCache]: Analyzing trace with hash -436186244, now seen corresponding path program 1 times [2024-10-14 05:10:26,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:26,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955481946] [2024-10-14 05:10:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,005 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:10:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955481946] [2024-10-14 05:10:27,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955481946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:27,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:27,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:10:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337784915] [2024-10-14 05:10:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:27,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:10:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:27,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:10:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:27,011 INFO L87 Difference]: Start difference. First operand 834 states and 1192 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:10:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:27,562 INFO L93 Difference]: Finished difference Result 919 states and 1295 transitions. [2024-10-14 05:10:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:10:27,562 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:10:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:27,567 INFO L225 Difference]: With dead ends: 919 [2024-10-14 05:10:27,567 INFO L226 Difference]: Without dead ends: 916 [2024-10-14 05:10:27,568 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:10:27,568 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 1388 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:27,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 672 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2024-10-14 05:10:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 833. [2024-10-14 05:10:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 739 states have (on average 1.4221921515561569) internal successors, (1051), 747 states have internal predecessors, (1051), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (78), 57 states have call predecessors, (78), 59 states have call successors, (78) [2024-10-14 05:10:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1189 transitions. [2024-10-14 05:10:27,610 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1189 transitions. Word has length 60 [2024-10-14 05:10:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:27,613 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1189 transitions. [2024-10-14 05:10:27,613 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:10:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1189 transitions. [2024-10-14 05:10:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:10:27,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:27,614 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:10:27,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:10:27,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -638202983, now seen corresponding path program 1 times [2024-10-14 05:10:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:27,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667325572] [2024-10-14 05:10:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,808 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:10:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667325572] [2024-10-14 05:10:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667325572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355508339] [2024-10-14 05:10:27,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:27,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:27,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:27,811 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:10:27,813 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:10:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:27,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:10:27,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:28,157 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:10:28,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:10:28,243 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:10:28,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355508339] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:10:28,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:10:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-14 05:10:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734302893] [2024-10-14 05:10:28,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:10:28,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:10:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:28,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:10:28,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:28,247 INFO L87 Difference]: Start difference. First operand 833 states and 1189 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:10:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:29,272 INFO L93 Difference]: Finished difference Result 1636 states and 2224 transitions. [2024-10-14 05:10:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 05:10:29,273 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:10:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:29,281 INFO L225 Difference]: With dead ends: 1636 [2024-10-14 05:10:29,281 INFO L226 Difference]: Without dead ends: 1633 [2024-10-14 05:10:29,282 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:10:29,283 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 1017 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:29,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1841 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:10:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-10-14 05:10:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1136. [2024-10-14 05:10:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1006 states have (on average 1.3886679920477136) internal successors, (1397), 1020 states have internal predecessors, (1397), 79 states have call successors, (79), 42 states have call predecessors, (79), 49 states have return successors, (108), 74 states have call predecessors, (108), 78 states have call successors, (108) [2024-10-14 05:10:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1584 transitions. [2024-10-14 05:10:29,375 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1584 transitions. Word has length 61 [2024-10-14 05:10:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1584 transitions. [2024-10-14 05:10:29,376 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:10:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1584 transitions. [2024-10-14 05:10:29,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:10:29,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:29,379 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:10:29,397 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:10:29,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:29,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:29,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash 736731372, now seen corresponding path program 2 times [2024-10-14 05:10:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:29,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580405869] [2024-10-14 05:10:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:10:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 05:10:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:29,651 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:10:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:29,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580405869] [2024-10-14 05:10:29,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580405869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:29,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:29,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:29,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447957144] [2024-10-14 05:10:29,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:29,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:29,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:29,655 INFO L87 Difference]: Start difference. First operand 1136 states and 1584 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:10:30,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:30,150 INFO L93 Difference]: Finished difference Result 1764 states and 2401 transitions. [2024-10-14 05:10:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:30,151 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:10:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:30,156 INFO L225 Difference]: With dead ends: 1764 [2024-10-14 05:10:30,156 INFO L226 Difference]: Without dead ends: 1105 [2024-10-14 05:10:30,158 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:10:30,158 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 841 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:30,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 691 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:10:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-10-14 05:10:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1028. [2024-10-14 05:10:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 911 states have (on average 1.392974753018661) internal successors, (1269), 925 states have internal predecessors, (1269), 72 states have call successors, (72), 37 states have call predecessors, (72), 43 states have return successors, (97), 66 states have call predecessors, (97), 71 states have call successors, (97) [2024-10-14 05:10:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1438 transitions. [2024-10-14 05:10:30,210 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1438 transitions. Word has length 78 [2024-10-14 05:10:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:30,211 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1438 transitions. [2024-10-14 05:10:30,211 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:10:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1438 transitions. [2024-10-14 05:10:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 05:10:30,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:30,213 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:10:30,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:10:30,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:30,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash -853344380, now seen corresponding path program 1 times [2024-10-14 05:10:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:30,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122358261] [2024-10-14 05:10:30,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 05:10:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 05:10:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 05:10:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,298 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:10:30,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122358261] [2024-10-14 05:10:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122358261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:30,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260235028] [2024-10-14 05:10:30,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:30,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:30,301 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:10:30,302 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:10:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:10:30,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:30,459 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:10:30,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:30,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260235028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:30,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:10:30,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423384854] [2024-10-14 05:10:30,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:30,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:10:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:10:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:30,462 INFO L87 Difference]: Start difference. First operand 1028 states and 1438 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:10:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:30,574 INFO L93 Difference]: Finished difference Result 1311 states and 1794 transitions. [2024-10-14 05:10:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:10:30,575 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:10:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:30,578 INFO L225 Difference]: With dead ends: 1311 [2024-10-14 05:10:30,578 INFO L226 Difference]: Without dead ends: 324 [2024-10-14 05:10:30,580 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:10:30,580 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 55 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:30,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1136 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-14 05:10:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-10-14 05:10:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 292 states have (on average 1.63013698630137) internal successors, (476), 293 states have internal predecessors, (476), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 05:10:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 526 transitions. [2024-10-14 05:10:30,596 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 526 transitions. Word has length 92 [2024-10-14 05:10:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:30,596 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 526 transitions. [2024-10-14 05:10:30,597 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:10:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 526 transitions. [2024-10-14 05:10:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:30,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:30,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:30,616 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:10:30,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:30,799 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:30,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1592151108, now seen corresponding path program 1 times [2024-10-14 05:10:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:30,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005827791] [2024-10-14 05:10:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:30,973 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:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005827791] [2024-10-14 05:10:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005827791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:10:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886240179] [2024-10-14 05:10:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:30,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:10:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:10:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:30,977 INFO L87 Difference]: Start difference. First operand 324 states and 526 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:32,581 INFO L93 Difference]: Finished difference Result 760 states and 1254 transitions. [2024-10-14 05:10:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:10:32,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:32,585 INFO L225 Difference]: With dead ends: 760 [2024-10-14 05:10:32,585 INFO L226 Difference]: Without dead ends: 444 [2024-10-14 05:10:32,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:32,588 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 903 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:32,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 581 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:10:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-14 05:10:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 324. [2024-10-14 05:10:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 292 states have (on average 1.6267123287671232) internal successors, (475), 293 states have internal predecessors, (475), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 05:10:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 525 transitions. [2024-10-14 05:10:32,613 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 525 transitions. Word has length 151 [2024-10-14 05:10:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:32,613 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 525 transitions. [2024-10-14 05:10:32,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 525 transitions. [2024-10-14 05:10:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:32,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:32,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:32,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:10:32,631 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:32,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1051721602, now seen corresponding path program 1 times [2024-10-14 05:10:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224048916] [2024-10-14 05:10:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:32,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:32,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224048916] [2024-10-14 05:10:32,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224048916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:32,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:32,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:10:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264691908] [2024-10-14 05:10:32,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:32,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:10:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:32,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:10:32,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:32,840 INFO L87 Difference]: Start difference. First operand 324 states and 525 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:34,321 INFO L93 Difference]: Finished difference Result 752 states and 1237 transitions. [2024-10-14 05:10:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:10:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:34,325 INFO L225 Difference]: With dead ends: 752 [2024-10-14 05:10:34,325 INFO L226 Difference]: Without dead ends: 444 [2024-10-14 05:10:34,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:34,327 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 894 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:34,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 579 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:10:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-14 05:10:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 324. [2024-10-14 05:10:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 292 states have (on average 1.6232876712328768) internal successors, (474), 293 states have internal predecessors, (474), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 05:10:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 524 transitions. [2024-10-14 05:10:34,352 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 524 transitions. Word has length 151 [2024-10-14 05:10:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:34,352 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 524 transitions. [2024-10-14 05:10:34,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 524 transitions. [2024-10-14 05:10:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:34,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:34,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:34,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:10:34,355 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:34,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash 565718848, now seen corresponding path program 1 times [2024-10-14 05:10:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918201010] [2024-10-14 05:10:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:34,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:34,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:34,648 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:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918201010] [2024-10-14 05:10:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918201010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:34,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:10:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683299965] [2024-10-14 05:10:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:34,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:10:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:10:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:34,651 INFO L87 Difference]: Start difference. First operand 324 states and 524 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:37,180 INFO L93 Difference]: Finished difference Result 1193 states and 1976 transitions. [2024-10-14 05:10:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:10:37,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:37,185 INFO L225 Difference]: With dead ends: 1193 [2024-10-14 05:10:37,186 INFO L226 Difference]: Without dead ends: 887 [2024-10-14 05:10:37,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:37,187 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 1373 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:37,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 978 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 05:10:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-10-14 05:10:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 648. [2024-10-14 05:10:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 589 states have (on average 1.634974533106961) internal successors, (963), 591 states have internal predecessors, (963), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-14 05:10:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1056 transitions. [2024-10-14 05:10:37,239 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1056 transitions. Word has length 151 [2024-10-14 05:10:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:37,239 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 1056 transitions. [2024-10-14 05:10:37,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1056 transitions. [2024-10-14 05:10:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:37,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:37,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:37,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:10:37,241 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:37,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 444492996, now seen corresponding path program 1 times [2024-10-14 05:10:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590109786] [2024-10-14 05:10:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:37,589 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:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:37,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590109786] [2024-10-14 05:10:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590109786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258018723] [2024-10-14 05:10:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:37,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:37,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:37,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:37,593 INFO L87 Difference]: Start difference. First operand 648 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:40,762 INFO L93 Difference]: Finished difference Result 1978 states and 3278 transitions. [2024-10-14 05:10:40,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:10:40,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:40,770 INFO L225 Difference]: With dead ends: 1978 [2024-10-14 05:10:40,770 INFO L226 Difference]: Without dead ends: 1348 [2024-10-14 05:10:40,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:10:40,775 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1505 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 2997 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:40,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1296 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2997 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 05:10:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-10-14 05:10:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 947. [2024-10-14 05:10:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 861 states have (on average 1.6283391405342624) internal successors, (1402), 864 states have internal predecessors, (1402), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-14 05:10:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1537 transitions. [2024-10-14 05:10:40,867 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1537 transitions. Word has length 151 [2024-10-14 05:10:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:40,867 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1537 transitions. [2024-10-14 05:10:40,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1537 transitions. [2024-10-14 05:10:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:40,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:40,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:40,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:10:40,870 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1119653122, now seen corresponding path program 1 times [2024-10-14 05:10:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623618329] [2024-10-14 05:10:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:40,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:41,147 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:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623618329] [2024-10-14 05:10:41,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623618329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:41,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:41,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437978520] [2024-10-14 05:10:41,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:41,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:41,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:41,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:41,149 INFO L87 Difference]: Start difference. First operand 947 states and 1537 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:43,022 INFO L93 Difference]: Finished difference Result 2293 states and 3797 transitions. [2024-10-14 05:10:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:43,041 INFO L225 Difference]: With dead ends: 2293 [2024-10-14 05:10:43,042 INFO L226 Difference]: Without dead ends: 1364 [2024-10-14 05:10:43,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:43,045 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1007 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:43,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 953 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:10:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-10-14 05:10:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 947. [2024-10-14 05:10:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 861 states have (on average 1.6248548199767712) internal successors, (1399), 864 states have internal predecessors, (1399), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-14 05:10:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1534 transitions. [2024-10-14 05:10:43,156 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1534 transitions. Word has length 151 [2024-10-14 05:10:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:43,157 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1534 transitions. [2024-10-14 05:10:43,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1534 transitions. [2024-10-14 05:10:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:43,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:10:43,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:43,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash 534881472, now seen corresponding path program 1 times [2024-10-14 05:10:43,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595562093] [2024-10-14 05:10:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,419 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:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:43,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595562093] [2024-10-14 05:10:43,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595562093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:43,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:43,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292493038] [2024-10-14 05:10:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:43,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:43,421 INFO L87 Difference]: Start difference. First operand 947 states and 1534 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:45,190 INFO L93 Difference]: Finished difference Result 2289 states and 3780 transitions. [2024-10-14 05:10:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:45,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:45,197 INFO L225 Difference]: With dead ends: 2289 [2024-10-14 05:10:45,198 INFO L226 Difference]: Without dead ends: 1360 [2024-10-14 05:10:45,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:45,201 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1005 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:45,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 953 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:10:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-10-14 05:10:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 947. [2024-10-14 05:10:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 861 states have (on average 1.62137049941928) internal successors, (1396), 864 states have internal predecessors, (1396), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-14 05:10:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1531 transitions. [2024-10-14 05:10:45,298 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1531 transitions. Word has length 151 [2024-10-14 05:10:45,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:45,299 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1531 transitions. [2024-10-14 05:10:45,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1531 transitions. [2024-10-14 05:10:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:45,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:45,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:45,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:10:45,301 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:45,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash 100375874, now seen corresponding path program 1 times [2024-10-14 05:10:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:45,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878710490] [2024-10-14 05:10:45,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:45,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,541 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:45,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878710490] [2024-10-14 05:10:45,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878710490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:45,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:45,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:45,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771443594] [2024-10-14 05:10:45,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:45,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:45,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:45,544 INFO L87 Difference]: Start difference. First operand 947 states and 1531 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:46,983 INFO L93 Difference]: Finished difference Result 2285 states and 3763 transitions. [2024-10-14 05:10:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:46,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:46,991 INFO L225 Difference]: With dead ends: 2285 [2024-10-14 05:10:46,991 INFO L226 Difference]: Without dead ends: 1356 [2024-10-14 05:10:46,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:46,995 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1145 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:46,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 802 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:10:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-10-14 05:10:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 947. [2024-10-14 05:10:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 861 states have (on average 1.6178861788617886) internal successors, (1393), 864 states have internal predecessors, (1393), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-14 05:10:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1528 transitions. [2024-10-14 05:10:47,066 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1528 transitions. Word has length 151 [2024-10-14 05:10:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:47,067 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1528 transitions. [2024-10-14 05:10:47,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1528 transitions. [2024-10-14 05:10:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:47,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:47,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:47,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:10:47,069 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:47,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash -329282432, now seen corresponding path program 1 times [2024-10-14 05:10:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:47,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552824902] [2024-10-14 05:10:47,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,330 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:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552824902] [2024-10-14 05:10:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552824902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232693576] [2024-10-14 05:10:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:47,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:47,333 INFO L87 Difference]: Start difference. First operand 947 states and 1528 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:50,680 INFO L93 Difference]: Finished difference Result 3115 states and 5107 transitions. [2024-10-14 05:10:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:10:50,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:50,691 INFO L225 Difference]: With dead ends: 3115 [2024-10-14 05:10:50,691 INFO L226 Difference]: Without dead ends: 2186 [2024-10-14 05:10:50,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:10:50,696 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1400 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3340 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:50,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 1855 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3340 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 05:10:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2024-10-14 05:10:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 1558. [2024-10-14 05:10:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1418 states have (on average 1.6107193229901269) internal successors, (2284), 1423 states have internal predecessors, (2284), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-14 05:10:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2507 transitions. [2024-10-14 05:10:50,834 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2507 transitions. Word has length 151 [2024-10-14 05:10:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:50,834 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2507 transitions. [2024-10-14 05:10:50,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2507 transitions. [2024-10-14 05:10:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:50,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:50,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:50,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:10:50,837 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:50,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1035879038, now seen corresponding path program 1 times [2024-10-14 05:10:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035148085] [2024-10-14 05:10:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,111 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:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035148085] [2024-10-14 05:10:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035148085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731131314] [2024-10-14 05:10:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:51,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:51,116 INFO L87 Difference]: Start difference. First operand 1558 states and 2507 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:52,761 INFO L93 Difference]: Finished difference Result 3713 states and 6074 transitions. [2024-10-14 05:10:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:10:52,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:52,771 INFO L225 Difference]: With dead ends: 3713 [2024-10-14 05:10:52,771 INFO L226 Difference]: Without dead ends: 2173 [2024-10-14 05:10:52,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:52,777 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1144 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:52,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 802 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:10:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2024-10-14 05:10:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1558. [2024-10-14 05:10:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1418 states have (on average 1.6071932299012694) internal successors, (2279), 1423 states have internal predecessors, (2279), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-14 05:10:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2502 transitions. [2024-10-14 05:10:52,919 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2502 transitions. Word has length 151 [2024-10-14 05:10:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:52,919 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2502 transitions. [2024-10-14 05:10:52,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2502 transitions. [2024-10-14 05:10:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:52,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:52,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:52,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:10:52,922 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash -88841152, now seen corresponding path program 1 times [2024-10-14 05:10:52,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:52,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193246469] [2024-10-14 05:10:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,158 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:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193246469] [2024-10-14 05:10:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193246469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:53,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:53,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529820693] [2024-10-14 05:10:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:53,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:53,160 INFO L87 Difference]: Start difference. First operand 1558 states and 2502 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:56,483 INFO L93 Difference]: Finished difference Result 5320 states and 8662 transitions. [2024-10-14 05:10:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:10:56,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:56,499 INFO L225 Difference]: With dead ends: 5320 [2024-10-14 05:10:56,499 INFO L226 Difference]: Without dead ends: 3780 [2024-10-14 05:10:56,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:10:56,504 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 1388 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 3298 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:56,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 1855 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3298 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 05:10:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2024-10-14 05:10:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2780. [2024-10-14 05:10:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2532 states have (on average 1.5999210110584519) internal successors, (4051), 2541 states have internal predecessors, (4051), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-14 05:10:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 4456 transitions. [2024-10-14 05:10:56,730 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 4456 transitions. Word has length 151 [2024-10-14 05:10:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:56,730 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 4456 transitions. [2024-10-14 05:10:56,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 4456 transitions. [2024-10-14 05:10:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:10:56,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:56,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:56,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:10:56,734 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:56,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 772992450, now seen corresponding path program 1 times [2024-10-14 05:10:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774455076] [2024-10-14 05:10:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:10:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:10:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:10:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:57,002 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:57,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774455076] [2024-10-14 05:10:57,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774455076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:57,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:57,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053789931] [2024-10-14 05:10:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:57,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:57,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:57,004 INFO L87 Difference]: Start difference. First operand 2780 states and 4456 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:59,982 INFO L93 Difference]: Finished difference Result 9736 states and 15826 transitions. [2024-10-14 05:10:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:10:59,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:10:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:00,019 INFO L225 Difference]: With dead ends: 9736 [2024-10-14 05:11:00,019 INFO L226 Difference]: Without dead ends: 6974 [2024-10-14 05:11:00,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:00,032 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1481 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:00,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1187 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 05:11:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2024-10-14 05:11:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 5229. [2024-10-14 05:11:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5229 states, 4765 states have (on average 1.5951731374606506) internal successors, (7601), 4782 states have internal predecessors, (7601), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-14 05:11:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 8388 transitions. [2024-10-14 05:11:00,475 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 8388 transitions. Word has length 151 [2024-10-14 05:11:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:00,475 INFO L471 AbstractCegarLoop]: Abstraction has 5229 states and 8388 transitions. [2024-10-14 05:11:00,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 8388 transitions. [2024-10-14 05:11:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:11:00,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:00,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:00,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:11:00,483 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:00,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:00,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1277416448, now seen corresponding path program 1 times [2024-10-14 05:11:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:00,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340187625] [2024-10-14 05:11:00,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:11:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:00,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:11:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:00,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:11:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:00,753 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:11:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340187625] [2024-10-14 05:11:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340187625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:00,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403993163] [2024-10-14 05:11:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:00,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:00,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:00,756 INFO L87 Difference]: Start difference. First operand 5229 states and 8388 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:02,697 INFO L93 Difference]: Finished difference Result 12235 states and 19927 transitions. [2024-10-14 05:11:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:02,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:11:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:02,727 INFO L225 Difference]: With dead ends: 12235 [2024-10-14 05:11:02,727 INFO L226 Difference]: Without dead ends: 7024 [2024-10-14 05:11:02,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:02,745 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1006 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:02,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 953 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:11:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7024 states. [2024-10-14 05:11:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7024 to 5229. [2024-10-14 05:11:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5229 states, 4765 states have (on average 1.5916054564533053) internal successors, (7584), 4782 states have internal predecessors, (7584), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-14 05:11:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 8371 transitions. [2024-10-14 05:11:03,223 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 8371 transitions. Word has length 151 [2024-10-14 05:11:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:03,224 INFO L471 AbstractCegarLoop]: Abstraction has 5229 states and 8371 transitions. [2024-10-14 05:11:03,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 8371 transitions. [2024-10-14 05:11:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:11:03,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:03,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:03,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:11:03,229 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1924915646, now seen corresponding path program 1 times [2024-10-14 05:11:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103619920] [2024-10-14 05:11:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:11:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:11:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:11:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,482 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:11:03,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103619920] [2024-10-14 05:11:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103619920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:03,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:03,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:03,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119401371] [2024-10-14 05:11:03,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:03,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:03,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:03,484 INFO L87 Difference]: Start difference. First operand 5229 states and 8371 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:07,423 INFO L93 Difference]: Finished difference Result 20771 states and 33690 transitions. [2024-10-14 05:11:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:07,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:11:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:07,473 INFO L225 Difference]: With dead ends: 20771 [2024-10-14 05:11:07,473 INFO L226 Difference]: Without dead ends: 15560 [2024-10-14 05:11:07,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:07,494 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1780 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:07,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 1848 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 05:11:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15560 states. [2024-10-14 05:11:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15560 to 10144. [2024-10-14 05:11:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10144 states, 9264 states have (on average 1.589594127806563) internal successors, (14726), 9297 states have internal predecessors, (14726), 649 states have call successors, (649), 198 states have call predecessors, (649), 230 states have return successors, (924), 680 states have call predecessors, (924), 649 states have call successors, (924) [2024-10-14 05:11:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10144 states to 10144 states and 16299 transitions. [2024-10-14 05:11:08,524 INFO L78 Accepts]: Start accepts. Automaton has 10144 states and 16299 transitions. Word has length 151 [2024-10-14 05:11:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:08,525 INFO L471 AbstractCegarLoop]: Abstraction has 10144 states and 16299 transitions. [2024-10-14 05:11:08,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 10144 states and 16299 transitions. [2024-10-14 05:11:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:11:08,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:08,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:08,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:11:08,532 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:08,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 642743360, now seen corresponding path program 1 times [2024-10-14 05:11:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:08,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760256142] [2024-10-14 05:11:08,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:08,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:11:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:11:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:11:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:08,763 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:11:08,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:08,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760256142] [2024-10-14 05:11:08,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760256142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:08,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:08,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641593519] [2024-10-14 05:11:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:08,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:08,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:08,766 INFO L87 Difference]: Start difference. First operand 10144 states and 16299 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:14,229 INFO L93 Difference]: Finished difference Result 40228 states and 65476 transitions. [2024-10-14 05:11:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:14,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:11:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:14,351 INFO L225 Difference]: With dead ends: 40228 [2024-10-14 05:11:14,351 INFO L226 Difference]: Without dead ends: 30102 [2024-10-14 05:11:14,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:14,386 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1471 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 3825 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:14,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1844 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3825 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 05:11:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30102 states. [2024-10-14 05:11:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30102 to 19809. [2024-10-14 05:11:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19809 states, 18113 states have (on average 1.5886932037762933) internal successors, (28776), 18178 states have internal predecessors, (28776), 1241 states have call successors, (1241), 390 states have call predecessors, (1241), 454 states have return successors, (2034), 1304 states have call predecessors, (2034), 1241 states have call successors, (2034) [2024-10-14 05:11:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19809 states to 19809 states and 32051 transitions. [2024-10-14 05:11:16,514 INFO L78 Accepts]: Start accepts. Automaton has 19809 states and 32051 transitions. Word has length 151 [2024-10-14 05:11:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:16,515 INFO L471 AbstractCegarLoop]: Abstraction has 19809 states and 32051 transitions. [2024-10-14 05:11:16,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 19809 states and 32051 transitions. [2024-10-14 05:11:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:11:16,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:16,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:16,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:11:16,532 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:16,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1199732354, now seen corresponding path program 1 times [2024-10-14 05:11:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:16,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877035037] [2024-10-14 05:11:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:11:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:11:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:11:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877035037] [2024-10-14 05:11:16,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877035037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:16,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884274535] [2024-10-14 05:11:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:16,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:16,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:16,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:16,822 INFO L87 Difference]: Start difference. First operand 19809 states and 32051 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:23,659 INFO L93 Difference]: Finished difference Result 78211 states and 128090 transitions. [2024-10-14 05:11:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:23,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-14 05:11:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:23,916 INFO L225 Difference]: With dead ends: 78211 [2024-10-14 05:11:23,916 INFO L226 Difference]: Without dead ends: 58420 [2024-10-14 05:11:24,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:24,002 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1708 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:24,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 1848 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3192 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 05:11:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58420 states. [2024-10-14 05:11:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58420 to 39298. [2024-10-14 05:11:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39298 states, 36002 states have (on average 1.5886339647797345) internal successors, (57194), 36131 states have internal predecessors, (57194), 2393 states have call successors, (2393), 774 states have call predecessors, (2393), 902 states have return successors, (4708), 2520 states have call predecessors, (4708), 2393 states have call successors, (4708) [2024-10-14 05:11:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39298 states to 39298 states and 64295 transitions. [2024-10-14 05:11:28,004 INFO L78 Accepts]: Start accepts. Automaton has 39298 states and 64295 transitions. Word has length 151 [2024-10-14 05:11:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:28,005 INFO L471 AbstractCegarLoop]: Abstraction has 39298 states and 64295 transitions. [2024-10-14 05:11:28,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 39298 states and 64295 transitions. [2024-10-14 05:11:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 05:11:28,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:28,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:28,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:11:28,036 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1373232256, now seen corresponding path program 1 times [2024-10-14 05:11:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902601911] [2024-10-14 05:11:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:28,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:11:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:11:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:11:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:11:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:28,253 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:11:28,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:28,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902601911] [2024-10-14 05:11:28,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902601911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:28,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:28,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689161088] [2024-10-14 05:11:28,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:28,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:28,255 INFO L87 Difference]: Start difference. First operand 39298 states and 64295 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)