./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.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 a9fe331e5302255756e033832e890b54b7bae1c0bb354f9ba1bbe18985f952e5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:55:02,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:55:02,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:55:02,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:55:02,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:55:02,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:55:02,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:55:02,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:55:02,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:55:02,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:55:02,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:55:02,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:55:02,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:55:02,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:55:02,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:55:02,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:55:02,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:55:02,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:55:02,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:55:02,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:55:02,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:55:02,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:55:02,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:55:02,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:55:02,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:55:02,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:55:02,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:55:02,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:55:02,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:55:02,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:55:02,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:55:02,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:55:02,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:55:02,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:55:02,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:55:02,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:55:02,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:55:02,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:55:02,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:55:02,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:55:02,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:55:02,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:55:02,957 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 -> a9fe331e5302255756e033832e890b54b7bae1c0bb354f9ba1bbe18985f952e5 [2024-11-11 22:55:03,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:55:03,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:55:03,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:55:03,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:55:03,254 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:55:03,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c [2024-11-11 22:55:04,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:55:04,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:55:04,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c [2024-11-11 22:55:04,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a66ed19/4be1f2584dd64dfebd44b5eae0d9c36c/FLAG8876163e8 [2024-11-11 22:55:04,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a66ed19/4be1f2584dd64dfebd44b5eae0d9c36c [2024-11-11 22:55:04,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:55:04,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:55:04,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:55:04,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:55:04,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:55:04,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:55:04" (1/1) ... [2024-11-11 22:55:04,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20324203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:04, skipping insertion in model container [2024-11-11 22:55:04,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:55:04" (1/1) ... [2024-11-11 22:55:04,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:55:05,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c[913,926] [2024-11-11 22:55:05,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c[5977,5990] [2024-11-11 22:55:05,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:55:05,364 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:55:05,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c[913,926] [2024-11-11 22:55:05,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.15.cil.c[5977,5990] [2024-11-11 22:55:05,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:55:05,492 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:55:05,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05 WrapperNode [2024-11-11 22:55:05,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:55:05,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:55:05,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:55:05,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:55:05,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,578 INFO L138 Inliner]: procedures = 74, calls = 88, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1147 [2024-11-11 22:55:05,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:55:05,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:55:05,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:55:05,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:55:05,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,644 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:55:05,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:55:05,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:55:05,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:55:05,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:55:05,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (1/1) ... [2024-11-11 22:55:05,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:55:05,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:55:05,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:55:05,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:55:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:55:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:55:05,867 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:55:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-11 22:55:05,868 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-11 22:55:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:55:05,868 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:55:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:55:05,869 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:55:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:55:05,869 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:55:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:55:05,870 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:55:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:55:05,870 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:55:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:55:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:55:05,870 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:55:05,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:55:05,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:55:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:55:05,871 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:55:05,871 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-11 22:55:05,871 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-11 22:55:06,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:55:06,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:55:07,076 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-11 22:55:07,077 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:55:07,117 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:55:07,120 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-11 22:55:07,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:55:07 BoogieIcfgContainer [2024-11-11 22:55:07,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:55:07,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:55:07,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:55:07,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:55:07,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:55:04" (1/3) ... [2024-11-11 22:55:07,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c86a2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:55:07, skipping insertion in model container [2024-11-11 22:55:07,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:55:05" (2/3) ... [2024-11-11 22:55:07,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c86a2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:55:07, skipping insertion in model container [2024-11-11 22:55:07,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:55:07" (3/3) ... [2024-11-11 22:55:07,130 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.15.cil.c [2024-11-11 22:55:07,143 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:55:07,144 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:55:07,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:55:07,227 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;@30f045c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:55:07,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:55:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 499 states, 451 states have (on average 1.6341463414634145) internal successors, (737), 458 states have internal predecessors, (737), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-11 22:55:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 22:55:07,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:07,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:07,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:07,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash -960930593, now seen corresponding path program 1 times [2024-11-11 22:55:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:07,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029252636] [2024-11-11 22:55:07,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 22:55:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:07,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029252636] [2024-11-11 22:55:07,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029252636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:07,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:07,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:55:07,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397791749] [2024-11-11 22:55:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:07,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:55:07,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:07,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:55:07,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:55:07,711 INFO L87 Difference]: Start difference. First operand has 499 states, 451 states have (on average 1.6341463414634145) internal successors, (737), 458 states have internal predecessors, (737), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 22:55:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:08,536 INFO L93 Difference]: Finished difference Result 979 states and 1579 transitions. [2024-11-11 22:55:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:55:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-11 22:55:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:08,557 INFO L225 Difference]: With dead ends: 979 [2024-11-11 22:55:08,558 INFO L226 Difference]: Without dead ends: 497 [2024-11-11 22:55:08,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:55:08,571 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 408 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:08,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1191 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:55:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-11 22:55:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 488. [2024-11-11 22:55:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 443 states have (on average 1.5440180586907448) internal successors, (684), 447 states have internal predecessors, (684), 35 states have call successors, (35), 10 states have call predecessors, (35), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-11 22:55:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 750 transitions. [2024-11-11 22:55:08,659 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 750 transitions. Word has length 44 [2024-11-11 22:55:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:08,660 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 750 transitions. [2024-11-11 22:55:08,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 22:55:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 750 transitions. [2024-11-11 22:55:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 22:55:08,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:08,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:08,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:55:08,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:08,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash 884436573, now seen corresponding path program 1 times [2024-11-11 22:55:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:08,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865223242] [2024-11-11 22:55:08,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:08,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:08,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 22:55:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865223242] [2024-11-11 22:55:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865223242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:08,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:08,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:55:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843972658] [2024-11-11 22:55:08,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:08,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:55:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:08,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:55:08,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:55:08,813 INFO L87 Difference]: Start difference. First operand 488 states and 750 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:55:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:09,365 INFO L93 Difference]: Finished difference Result 620 states and 935 transitions. [2024-11-11 22:55:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:55:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-11 22:55:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:09,388 INFO L225 Difference]: With dead ends: 620 [2024-11-11 22:55:09,388 INFO L226 Difference]: Without dead ends: 558 [2024-11-11 22:55:09,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:55:09,390 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1017 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:09,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 899 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:55:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-11 22:55:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 552. [2024-11-11 22:55:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 500 states have (on average 1.52) internal successors, (760), 505 states have internal predecessors, (760), 39 states have call successors, (39), 12 states have call predecessors, (39), 11 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2024-11-11 22:55:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 840 transitions. [2024-11-11 22:55:09,428 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 840 transitions. Word has length 44 [2024-11-11 22:55:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:09,429 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 840 transitions. [2024-11-11 22:55:09,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:55:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 840 transitions. [2024-11-11 22:55:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:55:09,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:09,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:09,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:55:09,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:09,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1727302649, now seen corresponding path program 1 times [2024-11-11 22:55:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639373971] [2024-11-11 22:55:09,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:55:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:09,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639373971] [2024-11-11 22:55:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639373971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:55:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162880961] [2024-11-11 22:55:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:09,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:55:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:55:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:55:09,516 INFO L87 Difference]: Start difference. First operand 552 states and 840 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:55:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:10,136 INFO L93 Difference]: Finished difference Result 800 states and 1180 transitions. [2024-11-11 22:55:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:55:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 22:55:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:10,141 INFO L225 Difference]: With dead ends: 800 [2024-11-11 22:55:10,142 INFO L226 Difference]: Without dead ends: 676 [2024-11-11 22:55:10,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:55:10,144 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 389 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:10,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1294 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:55:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-11 22:55:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 619. [2024-11-11 22:55:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 561 states have (on average 1.5044563279857397) internal successors, (844), 566 states have internal predecessors, (844), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (44), 38 states have call predecessors, (44), 38 states have call successors, (44) [2024-11-11 22:55:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 930 transitions. [2024-11-11 22:55:10,184 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 930 transitions. Word has length 45 [2024-11-11 22:55:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:10,186 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 930 transitions. [2024-11-11 22:55:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:55:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 930 transitions. [2024-11-11 22:55:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:55:10,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:10,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:10,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:55:10,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:10,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 442945188, now seen corresponding path program 1 times [2024-11-11 22:55:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211923202] [2024-11-11 22:55:10,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:55:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211923202] [2024-11-11 22:55:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211923202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:55:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286731517] [2024-11-11 22:55:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:10,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:55:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:10,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:55:10,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:55:10,276 INFO L87 Difference]: Start difference. First operand 619 states and 930 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:55:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:10,789 INFO L93 Difference]: Finished difference Result 1027 states and 1489 transitions. [2024-11-11 22:55:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:55:10,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 22:55:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:10,796 INFO L225 Difference]: With dead ends: 1027 [2024-11-11 22:55:10,796 INFO L226 Difference]: Without dead ends: 836 [2024-11-11 22:55:10,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:55:10,799 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 1035 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:10,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 922 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:55:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-11 22:55:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 784. [2024-11-11 22:55:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 707 states have (on average 1.4625176803394626) internal successors, (1034), 715 states have internal predecessors, (1034), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (61), 47 states have call predecessors, (61), 49 states have call successors, (61) [2024-11-11 22:55:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1148 transitions. [2024-11-11 22:55:10,867 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1148 transitions. Word has length 45 [2024-11-11 22:55:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:10,867 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1148 transitions. [2024-11-11 22:55:10,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:55:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1148 transitions. [2024-11-11 22:55:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:55:10,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:10,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:10,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:55:10,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:10,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash -369711155, now seen corresponding path program 1 times [2024-11-11 22:55:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889656016] [2024-11-11 22:55:10,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 22:55:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:55:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:55:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889656016] [2024-11-11 22:55:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889656016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:55:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842369967] [2024-11-11 22:55:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:10,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:55:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:10,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:55:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:55:10,999 INFO L87 Difference]: Start difference. First operand 784 states and 1148 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:55:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:11,619 INFO L93 Difference]: Finished difference Result 1128 states and 1609 transitions. [2024-11-11 22:55:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:55:11,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-11 22:55:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:11,624 INFO L225 Difference]: With dead ends: 1128 [2024-11-11 22:55:11,624 INFO L226 Difference]: Without dead ends: 891 [2024-11-11 22:55:11,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:55:11,626 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 373 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:11,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1345 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:55:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-11 22:55:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 853. [2024-11-11 22:55:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 767 states have (on average 1.439374185136897) internal successors, (1104), 776 states have internal predecessors, (1104), 58 states have call successors, (58), 25 states have call predecessors, (58), 26 states have return successors, (70), 52 states have call predecessors, (70), 54 states have call successors, (70) [2024-11-11 22:55:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1232 transitions. [2024-11-11 22:55:11,672 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1232 transitions. Word has length 62 [2024-11-11 22:55:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:11,676 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1232 transitions. [2024-11-11 22:55:11,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:55:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1232 transitions. [2024-11-11 22:55:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:55:11,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:11,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:11,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:55:11,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:11,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1273953958, now seen corresponding path program 1 times [2024-11-11 22:55:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:11,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001175337] [2024-11-11 22:55:11,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:11,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:55:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:55:11,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001175337] [2024-11-11 22:55:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001175337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:11,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:55:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902256512] [2024-11-11 22:55:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:11,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:55:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:55:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:55:11,766 INFO L87 Difference]: Start difference. First operand 853 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:55:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:12,323 INFO L93 Difference]: Finished difference Result 1404 states and 1954 transitions. [2024-11-11 22:55:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:55:12,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-11 22:55:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:12,330 INFO L225 Difference]: With dead ends: 1404 [2024-11-11 22:55:12,330 INFO L226 Difference]: Without dead ends: 1026 [2024-11-11 22:55:12,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:55:12,332 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 1022 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:12,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 921 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:55:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-11 22:55:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 971. [2024-11-11 22:55:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 872 states have (on average 1.4105504587155964) internal successors, (1230), 882 states have internal predecessors, (1230), 65 states have call successors, (65), 30 states have call predecessors, (65), 32 states have return successors, (81), 59 states have call predecessors, (81), 61 states have call successors, (81) [2024-11-11 22:55:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1376 transitions. [2024-11-11 22:55:12,398 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1376 transitions. Word has length 67 [2024-11-11 22:55:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:12,398 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1376 transitions. [2024-11-11 22:55:12,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:55:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1376 transitions. [2024-11-11 22:55:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:55:12,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:12,401 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:12,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:55:12,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:12,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash -991698967, now seen corresponding path program 1 times [2024-11-11 22:55:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:12,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235736062] [2024-11-11 22:55:12,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:55:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:55:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 22:55:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235736062] [2024-11-11 22:55:12,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235736062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:55:12,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314658140] [2024-11-11 22:55:12,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:12,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:55:12,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:55:12,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:55:12,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:55:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:12,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:55:12,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:55:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:55:12,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:55:12,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314658140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:12,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:55:12,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:55:12,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777878604] [2024-11-11 22:55:12,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:12,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:55:12,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:12,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:55:12,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:12,719 INFO L87 Difference]: Start difference. First operand 971 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:55:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:12,766 INFO L93 Difference]: Finished difference Result 1414 states and 1971 transitions. [2024-11-11 22:55:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:55:12,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2024-11-11 22:55:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:12,771 INFO L225 Difference]: With dead ends: 1414 [2024-11-11 22:55:12,771 INFO L226 Difference]: Without dead ends: 969 [2024-11-11 22:55:12,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:12,773 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 72 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:12,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1521 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:55:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-11 22:55:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 925. [2024-11-11 22:55:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 832 states have (on average 1.4038461538461537) internal successors, (1168), 842 states have internal predecessors, (1168), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (75), 55 states have call predecessors, (75), 57 states have call successors, (75) [2024-11-11 22:55:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1304 transitions. [2024-11-11 22:55:12,817 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1304 transitions. Word has length 68 [2024-11-11 22:55:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:12,818 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1304 transitions. [2024-11-11 22:55:12,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:55:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1304 transitions. [2024-11-11 22:55:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:55:12,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:12,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:12,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:55:13,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:55:13,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:13,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1188272808, now seen corresponding path program 1 times [2024-11-11 22:55:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:13,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013035381] [2024-11-11 22:55:13,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:55:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:55:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:55:13,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:13,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013035381] [2024-11-11 22:55:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013035381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:55:13,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405061319] [2024-11-11 22:55:13,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:13,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:55:13,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:55:13,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:55:13,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:55:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 22:55:13,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:55:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:13,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:55:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:55:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405061319] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 22:55:13,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 22:55:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-11 22:55:13,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331310770] [2024-11-11 22:55:13,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:13,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:55:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:55:13,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:55:13,415 INFO L87 Difference]: Start difference. First operand 925 states and 1304 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:55:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:13,617 INFO L93 Difference]: Finished difference Result 976 states and 1365 transitions. [2024-11-11 22:55:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:55:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-11 22:55:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:13,622 INFO L225 Difference]: With dead ends: 976 [2024-11-11 22:55:13,622 INFO L226 Difference]: Without dead ends: 973 [2024-11-11 22:55:13,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:55:13,624 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1371 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:13,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 836 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:55:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-11-11 22:55:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 924. [2024-11-11 22:55:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 832 states have (on average 1.4014423076923077) internal successors, (1166), 841 states have internal predecessors, (1166), 60 states have call successors, (60), 28 states have call predecessors, (60), 30 states have return successors, (75), 55 states have call predecessors, (75), 57 states have call successors, (75) [2024-11-11 22:55:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1301 transitions. [2024-11-11 22:55:13,671 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1301 transitions. Word has length 68 [2024-11-11 22:55:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:13,671 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1301 transitions. [2024-11-11 22:55:13,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:55:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1301 transitions. [2024-11-11 22:55:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 22:55:13,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:13,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:13,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 22:55:13,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-11 22:55:13,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:13,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1819744823, now seen corresponding path program 1 times [2024-11-11 22:55:13,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:13,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689900508] [2024-11-11 22:55:13,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:55:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:14,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:55:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:55:14,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:14,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689900508] [2024-11-11 22:55:14,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689900508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:55:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39023447] [2024-11-11 22:55:14,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:55:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:55:14,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:55:14,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:55:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:14,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:55:14,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:55:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:14,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:55:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:55:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39023447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:55:14,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:55:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-11 22:55:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205758400] [2024-11-11 22:55:14,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:55:14,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 22:55:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:14,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 22:55:14,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:14,487 INFO L87 Difference]: Start difference. First operand 924 states and 1301 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:55:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:16,191 INFO L93 Difference]: Finished difference Result 2080 states and 2803 transitions. [2024-11-11 22:55:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:55:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-11 22:55:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:16,199 INFO L225 Difference]: With dead ends: 2080 [2024-11-11 22:55:16,199 INFO L226 Difference]: Without dead ends: 1684 [2024-11-11 22:55:16,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-11 22:55:16,201 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 1192 mSDsluCounter, 3468 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 4002 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:16,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 4002 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:55:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-11-11 22:55:16,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1262. [2024-11-11 22:55:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1134 states have (on average 1.3518518518518519) internal successors, (1533), 1149 states have internal predecessors, (1533), 79 states have call successors, (79), 41 states have call predecessors, (79), 47 states have return successors, (106), 72 states have call predecessors, (106), 76 states have call successors, (106) [2024-11-11 22:55:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1718 transitions. [2024-11-11 22:55:16,265 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1718 transitions. Word has length 69 [2024-11-11 22:55:16,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:16,265 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1718 transitions. [2024-11-11 22:55:16,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:55:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1718 transitions. [2024-11-11 22:55:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 22:55:16,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:16,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:16,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 22:55:16,472 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-11-11 22:55:16,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:16,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1621511759, now seen corresponding path program 1 times [2024-11-11 22:55:16,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:16,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788401263] [2024-11-11 22:55:16,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:16,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:55:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:55:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 22:55:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 22:55:16,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788401263] [2024-11-11 22:55:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788401263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:55:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869378926] [2024-11-11 22:55:16,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:16,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:55:16,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:55:16,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:55:16,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:55:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:16,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:55:16,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:55:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:55:16,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:55:16,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869378926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:16,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:55:16,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:55:16,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181291392] [2024-11-11 22:55:16,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:16,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:55:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:16,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:55:16,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:16,752 INFO L87 Difference]: Start difference. First operand 1262 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:55:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:16,808 INFO L93 Difference]: Finished difference Result 1848 states and 2462 transitions. [2024-11-11 22:55:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:55:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-11 22:55:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:16,814 INFO L225 Difference]: With dead ends: 1848 [2024-11-11 22:55:16,814 INFO L226 Difference]: Without dead ends: 1202 [2024-11-11 22:55:16,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:16,817 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 709 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:16,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 850 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:55:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-11-11 22:55:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1196. [2024-11-11 22:55:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1075 states have (on average 1.3488372093023255) internal successors, (1450), 1090 states have internal predecessors, (1450), 76 states have call successors, (76), 38 states have call predecessors, (76), 43 states have return successors, (101), 68 states have call predecessors, (101), 73 states have call successors, (101) [2024-11-11 22:55:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1627 transitions. [2024-11-11 22:55:16,877 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1627 transitions. Word has length 88 [2024-11-11 22:55:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:16,878 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1627 transitions. [2024-11-11 22:55:16,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:55:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1627 transitions. [2024-11-11 22:55:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 22:55:16,881 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:16,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:16,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 22:55:17,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:55:17,082 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:17,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash 671467825, now seen corresponding path program 1 times [2024-11-11 22:55:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869909060] [2024-11-11 22:55:17,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:55:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:55:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:55:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 22:55:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 22:55:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 22:55:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869909060] [2024-11-11 22:55:17,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869909060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:55:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580190911] [2024-11-11 22:55:17,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:17,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:55:17,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:55:17,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:55:17,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 22:55:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:55:17,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:55:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 22:55:17,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:55:17,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580190911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:17,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:55:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:55:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980720061] [2024-11-11 22:55:17,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:17,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:55:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:17,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:55:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:17,324 INFO L87 Difference]: Start difference. First operand 1196 states and 1627 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 22:55:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:17,368 INFO L93 Difference]: Finished difference Result 1506 states and 2008 transitions. [2024-11-11 22:55:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:55:17,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2024-11-11 22:55:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:17,371 INFO L225 Difference]: With dead ends: 1506 [2024-11-11 22:55:17,371 INFO L226 Difference]: Without dead ends: 422 [2024-11-11 22:55:17,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:17,374 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 60 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:17,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1516 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:55:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-11 22:55:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2024-11-11 22:55:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 386 states have (on average 1.5621761658031088) internal successors, (603), 388 states have internal predecessors, (603), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-11 22:55:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 659 transitions. [2024-11-11 22:55:17,390 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 659 transitions. Word has length 103 [2024-11-11 22:55:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:17,390 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 659 transitions. [2024-11-11 22:55:17,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 22:55:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 659 transitions. [2024-11-11 22:55:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:17,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:17,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:17,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 22:55:17,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 22:55:17,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:17,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1255778744, now seen corresponding path program 1 times [2024-11-11 22:55:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547736041] [2024-11-11 22:55:17,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:17,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547736041] [2024-11-11 22:55:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547736041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:17,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:55:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862932193] [2024-11-11 22:55:17,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:17,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:55:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:55:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:55:17,870 INFO L87 Difference]: Start difference. First operand 422 states and 659 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:19,912 INFO L93 Difference]: Finished difference Result 988 states and 1569 transitions. [2024-11-11 22:55:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:55:19,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:19,917 INFO L225 Difference]: With dead ends: 988 [2024-11-11 22:55:19,919 INFO L226 Difference]: Without dead ends: 575 [2024-11-11 22:55:19,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:55:19,920 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1131 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:19,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 843 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 22:55:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-11 22:55:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 422. [2024-11-11 22:55:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 386 states have (on average 1.5595854922279793) internal successors, (602), 388 states have internal predecessors, (602), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-11 22:55:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 658 transitions. [2024-11-11 22:55:19,950 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 658 transitions. Word has length 190 [2024-11-11 22:55:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:19,950 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 658 transitions. [2024-11-11 22:55:19,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 658 transitions. [2024-11-11 22:55:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:19,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:19,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:19,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:55:19,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:19,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1728118390, now seen corresponding path program 1 times [2024-11-11 22:55:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655709814] [2024-11-11 22:55:19,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:20,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:20,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655709814] [2024-11-11 22:55:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655709814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:20,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:20,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:55:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269399946] [2024-11-11 22:55:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:20,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:55:20,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:20,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:55:20,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:55:20,182 INFO L87 Difference]: Start difference. First operand 422 states and 658 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:22,134 INFO L93 Difference]: Finished difference Result 980 states and 1552 transitions. [2024-11-11 22:55:22,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:55:22,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:22,138 INFO L225 Difference]: With dead ends: 980 [2024-11-11 22:55:22,138 INFO L226 Difference]: Without dead ends: 575 [2024-11-11 22:55:22,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:55:22,139 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1122 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:22,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 841 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:55:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-11 22:55:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 422. [2024-11-11 22:55:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 386 states have (on average 1.5569948186528497) internal successors, (601), 388 states have internal predecessors, (601), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-11 22:55:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 657 transitions. [2024-11-11 22:55:22,169 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 657 transitions. Word has length 190 [2024-11-11 22:55:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:22,170 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 657 transitions. [2024-11-11 22:55:22,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 657 transitions. [2024-11-11 22:55:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:22,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:22,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:22,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:55:22,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:22,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash -359657780, now seen corresponding path program 1 times [2024-11-11 22:55:22,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:22,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873732762] [2024-11-11 22:55:22,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:22,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873732762] [2024-11-11 22:55:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873732762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:22,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:55:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505581548] [2024-11-11 22:55:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:22,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:55:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:55:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:55:22,450 INFO L87 Difference]: Start difference. First operand 422 states and 657 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:25,477 INFO L93 Difference]: Finished difference Result 1548 states and 2468 transitions. [2024-11-11 22:55:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:55:25,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:25,484 INFO L225 Difference]: With dead ends: 1548 [2024-11-11 22:55:25,484 INFO L226 Difference]: Without dead ends: 1148 [2024-11-11 22:55:25,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:25,488 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1701 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:25,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 1440 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:55:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-11-11 22:55:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 841. [2024-11-11 22:55:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 776 states have (on average 1.5695876288659794) internal successors, (1218), 779 states have internal predecessors, (1218), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-11-11 22:55:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1321 transitions. [2024-11-11 22:55:25,540 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1321 transitions. Word has length 190 [2024-11-11 22:55:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:25,540 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1321 transitions. [2024-11-11 22:55:25,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1321 transitions. [2024-11-11 22:55:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:25,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:25,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:25,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:55:25,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:25,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2088283080, now seen corresponding path program 1 times [2024-11-11 22:55:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:25,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70888369] [2024-11-11 22:55:25,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:25,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:25,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70888369] [2024-11-11 22:55:25,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70888369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:25,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:25,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:25,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456468967] [2024-11-11 22:55:25,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:25,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:25,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:25,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:25,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:25,882 INFO L87 Difference]: Start difference. First operand 841 states and 1321 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:29,786 INFO L93 Difference]: Finished difference Result 2560 states and 4091 transitions. [2024-11-11 22:55:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:29,795 INFO L225 Difference]: With dead ends: 2560 [2024-11-11 22:55:29,795 INFO L226 Difference]: Without dead ends: 1741 [2024-11-11 22:55:29,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:29,798 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 1736 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3867 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:29,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 2803 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3867 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:55:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2024-11-11 22:55:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1231. [2024-11-11 22:55:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1137 states have (on average 1.5628847845206684) internal successors, (1777), 1141 states have internal predecessors, (1777), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-11-11 22:55:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1926 transitions. [2024-11-11 22:55:29,876 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1926 transitions. Word has length 190 [2024-11-11 22:55:29,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:29,876 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1926 transitions. [2024-11-11 22:55:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1926 transitions. [2024-11-11 22:55:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:29,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:29,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:29,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:55:29,879 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:29,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash 165032650, now seen corresponding path program 1 times [2024-11-11 22:55:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268053491] [2024-11-11 22:55:29,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268053491] [2024-11-11 22:55:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268053491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:30,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578296872] [2024-11-11 22:55:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:30,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:30,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:30,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:30,213 INFO L87 Difference]: Start difference. First operand 1231 states and 1926 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:34,034 INFO L93 Difference]: Finished difference Result 4053 states and 6464 transitions. [2024-11-11 22:55:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:34,047 INFO L225 Difference]: With dead ends: 4053 [2024-11-11 22:55:34,048 INFO L226 Difference]: Without dead ends: 2844 [2024-11-11 22:55:34,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:34,053 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1734 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:34,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 2801 Invalid, 3932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 22:55:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2024-11-11 22:55:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2012. [2024-11-11 22:55:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1860 states have (on average 1.5569892473118279) internal successors, (2896), 1866 states have internal predecessors, (2896), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-11 22:55:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3141 transitions. [2024-11-11 22:55:34,191 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3141 transitions. Word has length 190 [2024-11-11 22:55:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:34,192 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 3141 transitions. [2024-11-11 22:55:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3141 transitions. [2024-11-11 22:55:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:34,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:34,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:34,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:55:34,195 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:34,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1559575672, now seen corresponding path program 1 times [2024-11-11 22:55:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122686154] [2024-11-11 22:55:34,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:34,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:34,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122686154] [2024-11-11 22:55:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122686154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:34,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026452107] [2024-11-11 22:55:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:34,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:34,464 INFO L87 Difference]: Start difference. First operand 2012 states and 3141 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:36,297 INFO L93 Difference]: Finished difference Result 4822 states and 7670 transitions. [2024-11-11 22:55:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:36,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:36,310 INFO L225 Difference]: With dead ends: 4822 [2024-11-11 22:55:36,310 INFO L226 Difference]: Without dead ends: 2832 [2024-11-11 22:55:36,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:36,316 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1425 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:36,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1185 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:55:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2024-11-11 22:55:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2012. [2024-11-11 22:55:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1860 states have (on average 1.5543010752688171) internal successors, (2891), 1866 states have internal predecessors, (2891), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-11 22:55:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3136 transitions. [2024-11-11 22:55:36,464 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3136 transitions. Word has length 190 [2024-11-11 22:55:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:36,464 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 3136 transitions. [2024-11-11 22:55:36,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3136 transitions. [2024-11-11 22:55:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:36,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:36,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:36,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:55:36,468 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:36,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:36,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1061018870, now seen corresponding path program 1 times [2024-11-11 22:55:36,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:36,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520458309] [2024-11-11 22:55:36,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520458309] [2024-11-11 22:55:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520458309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:36,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010066069] [2024-11-11 22:55:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:36,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:36,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:36,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:36,754 INFO L87 Difference]: Start difference. First operand 2012 states and 3136 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:40,540 INFO L93 Difference]: Finished difference Result 6915 states and 10957 transitions. [2024-11-11 22:55:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:40,587 INFO L225 Difference]: With dead ends: 6915 [2024-11-11 22:55:40,588 INFO L226 Difference]: Without dead ends: 4925 [2024-11-11 22:55:40,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:40,595 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 1848 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:40,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 1778 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3247 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 22:55:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2024-11-11 22:55:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 3584. [2024-11-11 22:55:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3316 states have (on average 1.5500603136308806) internal successors, (5140), 3326 states have internal predecessors, (5140), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-11 22:55:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5583 transitions. [2024-11-11 22:55:40,851 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5583 transitions. Word has length 190 [2024-11-11 22:55:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:40,852 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5583 transitions. [2024-11-11 22:55:40,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5583 transitions. [2024-11-11 22:55:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:40,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:40,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:40,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:55:40,856 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:40,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 342850316, now seen corresponding path program 1 times [2024-11-11 22:55:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:40,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970884340] [2024-11-11 22:55:40,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:40,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:41,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970884340] [2024-11-11 22:55:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970884340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:41,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:41,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870229414] [2024-11-11 22:55:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:41,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:41,137 INFO L87 Difference]: Start difference. First operand 3584 states and 5583 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:43,354 INFO L93 Difference]: Finished difference Result 8517 states and 13490 transitions. [2024-11-11 22:55:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:43,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:43,374 INFO L225 Difference]: With dead ends: 8517 [2024-11-11 22:55:43,374 INFO L226 Difference]: Without dead ends: 4955 [2024-11-11 22:55:43,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:43,383 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1243 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:43,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 1411 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:55:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2024-11-11 22:55:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 3584. [2024-11-11 22:55:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3316 states have (on average 1.5473462002412546) internal successors, (5131), 3326 states have internal predecessors, (5131), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-11 22:55:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5574 transitions. [2024-11-11 22:55:43,678 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5574 transitions. Word has length 190 [2024-11-11 22:55:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:43,678 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5574 transitions. [2024-11-11 22:55:43,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5574 transitions. [2024-11-11 22:55:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:43,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:43,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:43,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:55:43,683 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:43,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash -443147574, now seen corresponding path program 1 times [2024-11-11 22:55:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803545196] [2024-11-11 22:55:43,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:43,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:43,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:43,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803545196] [2024-11-11 22:55:43,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803545196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:43,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:43,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:43,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976688692] [2024-11-11 22:55:43,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:43,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:43,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:43,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:43,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:43,991 INFO L87 Difference]: Start difference. First operand 3584 states and 5574 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:48,064 INFO L93 Difference]: Finished difference Result 12653 states and 19964 transitions. [2024-11-11 22:55:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:48,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:48,114 INFO L225 Difference]: With dead ends: 12653 [2024-11-11 22:55:48,114 INFO L226 Difference]: Without dead ends: 9091 [2024-11-11 22:55:48,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:48,129 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1720 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:48,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 2801 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 22:55:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2024-11-11 22:55:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 6740. [2024-11-11 22:55:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6740 states, 6240 states have (on average 1.54375) internal successors, (9633), 6258 states have internal predecessors, (9633), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-11 22:55:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 10490 transitions. [2024-11-11 22:55:48,585 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 10490 transitions. Word has length 190 [2024-11-11 22:55:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:48,586 INFO L471 AbstractCegarLoop]: Abstraction has 6740 states and 10490 transitions. [2024-11-11 22:55:48,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 10490 transitions. [2024-11-11 22:55:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:48,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:48,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:48,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:55:48,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:48,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash 224234316, now seen corresponding path program 1 times [2024-11-11 22:55:48,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:48,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443030169] [2024-11-11 22:55:48,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:48,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:48,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443030169] [2024-11-11 22:55:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443030169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:48,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462705111] [2024-11-11 22:55:48,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:48,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:48,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:48,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:48,860 INFO L87 Difference]: Start difference. First operand 6740 states and 10490 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:50,829 INFO L93 Difference]: Finished difference Result 15913 states and 25157 transitions. [2024-11-11 22:55:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:55:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:50,865 INFO L225 Difference]: With dead ends: 15913 [2024-11-11 22:55:50,865 INFO L226 Difference]: Without dead ends: 9195 [2024-11-11 22:55:50,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:55:50,890 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1421 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:50,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 1185 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:55:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9195 states. [2024-11-11 22:55:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9195 to 6740. [2024-11-11 22:55:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6740 states, 6240 states have (on average 1.541025641025641) internal successors, (9616), 6258 states have internal predecessors, (9616), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-11 22:55:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 10473 transitions. [2024-11-11 22:55:51,406 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 10473 transitions. Word has length 190 [2024-11-11 22:55:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:51,407 INFO L471 AbstractCegarLoop]: Abstraction has 6740 states and 10473 transitions. [2024-11-11 22:55:51,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 10473 transitions. [2024-11-11 22:55:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:51,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:51,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:51,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:55:51,413 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:51,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:51,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1970994550, now seen corresponding path program 1 times [2024-11-11 22:55:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:51,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026880098] [2024-11-11 22:55:51,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026880098] [2024-11-11 22:55:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026880098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:51,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164641734] [2024-11-11 22:55:51,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:51,734 INFO L87 Difference]: Start difference. First operand 6740 states and 10473 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:56,202 INFO L93 Difference]: Finished difference Result 24129 states and 37994 transitions. [2024-11-11 22:55:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:55:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:55:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:56,260 INFO L225 Difference]: With dead ends: 24129 [2024-11-11 22:55:56,260 INFO L226 Difference]: Without dead ends: 17411 [2024-11-11 22:55:56,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:55:56,285 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1712 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3730 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:56,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 2801 Invalid, 3799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3730 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 22:55:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17411 states. [2024-11-11 22:55:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17411 to 13082. [2024-11-11 22:55:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13082 states, 12118 states have (on average 1.5382076250206305) internal successors, (18640), 12152 states have internal predecessors, (18640), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-11 22:55:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13082 states to 13082 states and 20379 transitions. [2024-11-11 22:55:57,393 INFO L78 Accepts]: Start accepts. Automaton has 13082 states and 20379 transitions. Word has length 190 [2024-11-11 22:55:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:57,394 INFO L471 AbstractCegarLoop]: Abstraction has 13082 states and 20379 transitions. [2024-11-11 22:55:57,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:55:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13082 states and 20379 transitions. [2024-11-11 22:55:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:55:57,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:57,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:57,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:55:57,403 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:57,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1626166388, now seen corresponding path program 1 times [2024-11-11 22:55:57,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:57,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289037304] [2024-11-11 22:55:57,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:55:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:55:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:55:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:55:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:57,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289037304] [2024-11-11 22:55:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289037304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:57,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:57,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169828120] [2024-11-11 22:55:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:57,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:57,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:57,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:57,666 INFO L87 Difference]: Start difference. First operand 13082 states and 20379 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:00,215 INFO L93 Difference]: Finished difference Result 30705 states and 48576 transitions. [2024-11-11 22:56:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:56:00,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:56:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:00,276 INFO L225 Difference]: With dead ends: 30705 [2024-11-11 22:56:00,277 INFO L226 Difference]: Without dead ends: 17645 [2024-11-11 22:56:00,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:00,303 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1420 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:00,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 1185 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:56:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17645 states. [2024-11-11 22:56:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17645 to 13082. [2024-11-11 22:56:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13082 states, 12118 states have (on average 1.5354844033668922) internal successors, (18607), 12152 states have internal predecessors, (18607), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-11 22:56:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13082 states to 13082 states and 20346 transitions. [2024-11-11 22:56:01,620 INFO L78 Accepts]: Start accepts. Automaton has 13082 states and 20346 transitions. Word has length 190 [2024-11-11 22:56:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:01,620 INFO L471 AbstractCegarLoop]: Abstraction has 13082 states and 20346 transitions. [2024-11-11 22:56:01,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 13082 states and 20346 transitions. [2024-11-11 22:56:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:56:01,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:01,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:01,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:56:01,629 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:01,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:01,630 INFO L85 PathProgramCache]: Analyzing trace with hash -645211574, now seen corresponding path program 1 times [2024-11-11 22:56:01,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:01,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181899886] [2024-11-11 22:56:01,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:56:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:01,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:56:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:01,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:56:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:01,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:56:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:01,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:01,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181899886] [2024-11-11 22:56:01,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181899886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:01,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286384633] [2024-11-11 22:56:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:01,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:01,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:01,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:01,900 INFO L87 Difference]: Start difference. First operand 13082 states and 20346 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:07,654 INFO L93 Difference]: Finished difference Result 47083 states and 74158 transitions. [2024-11-11 22:56:07,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:07,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:56:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:07,778 INFO L225 Difference]: With dead ends: 47083 [2024-11-11 22:56:07,779 INFO L226 Difference]: Without dead ends: 34023 [2024-11-11 22:56:07,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:07,822 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1710 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 3756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:07,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 2801 Invalid, 3756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 22:56:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34023 states. [2024-11-11 22:56:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34023 to 25828. [2024-11-11 22:56:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25828 states, 23936 states have (on average 1.5332135695187166) internal successors, (36699), 24002 states have internal predecessors, (36699), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-11 22:56:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25828 states to 25828 states and 40364 transitions. [2024-11-11 22:56:10,080 INFO L78 Accepts]: Start accepts. Automaton has 25828 states and 40364 transitions. Word has length 190 [2024-11-11 22:56:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:10,081 INFO L471 AbstractCegarLoop]: Abstraction has 25828 states and 40364 transitions. [2024-11-11 22:56:10,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25828 states and 40364 transitions. [2024-11-11 22:56:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:56:10,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:10,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:10,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 22:56:10,100 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1880284108, now seen corresponding path program 1 times [2024-11-11 22:56:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759482267] [2024-11-11 22:56:10,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:56:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:56:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:56:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:56:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759482267] [2024-11-11 22:56:10,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759482267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:10,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:10,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763736290] [2024-11-11 22:56:10,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:10,410 INFO L87 Difference]: Start difference. First operand 25828 states and 40364 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:14,270 INFO L93 Difference]: Finished difference Result 60223 states and 95611 transitions. [2024-11-11 22:56:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:56:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:56:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:14,417 INFO L225 Difference]: With dead ends: 60223 [2024-11-11 22:56:14,417 INFO L226 Difference]: Without dead ends: 34417 [2024-11-11 22:56:14,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:14,496 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 1302 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:14,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1410 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:56:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34417 states. [2024-11-11 22:56:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34417 to 25828. [2024-11-11 22:56:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25828 states, 23936 states have (on average 1.5304979946524064) internal successors, (36634), 24002 states have internal predecessors, (36634), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-11 22:56:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25828 states to 25828 states and 40299 transitions. [2024-11-11 22:56:16,618 INFO L78 Accepts]: Start accepts. Automaton has 25828 states and 40299 transitions. Word has length 190 [2024-11-11 22:56:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:16,618 INFO L471 AbstractCegarLoop]: Abstraction has 25828 states and 40299 transitions. [2024-11-11 22:56:16,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 25828 states and 40299 transitions. [2024-11-11 22:56:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:56:16,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:16,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 22:56:16,634 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:16,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash 475092430, now seen corresponding path program 1 times [2024-11-11 22:56:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572210445] [2024-11-11 22:56:16,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:56:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:56:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:56:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:56:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572210445] [2024-11-11 22:56:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572210445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:16,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432435942] [2024-11-11 22:56:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:16,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:16,881 INFO L87 Difference]: Start difference. First operand 25828 states and 40299 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)