./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2468c605d5c29b15a54525a5c6944fa0a2b4d36426cacd5fefa10555cb2b8a7a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:00:34,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:00:34,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:00:34,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:00:34,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:00:34,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:00:34,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:00:34,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:00:34,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:00:34,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:00:34,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:00:34,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:00:34,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:00:34,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:00:34,715 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:00:34,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:00:34,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:00:34,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:00:34,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:00:34,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:00:34,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:00:34,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:00:34,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:00:34,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:00:34,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:00:34,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:00:34,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:00:34,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:00:34,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:00:34,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:00:34,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:00:34,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:00:34,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:00:34,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:00:34,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:00:34,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:00:34,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:00:34,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:00:34,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:00:34,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:00:34,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:00:34,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:00:34,727 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-clean/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-clean/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 -> 2468c605d5c29b15a54525a5c6944fa0a2b4d36426cacd5fefa10555cb2b8a7a [2024-10-11 05:00:34,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:00:34,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:00:34,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:00:34,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:00:34,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:00:34,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c [2024-10-11 05:00:36,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:00:36,517 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:00:36,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c [2024-10-11 05:00:36,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b42e9ac5c/a8a89025717a46739b66e1f6bab53b27/FLAGb392133e4 [2024-10-11 05:00:36,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b42e9ac5c/a8a89025717a46739b66e1f6bab53b27 [2024-10-11 05:00:36,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:00:36,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:00:36,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:00:36,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:00:36,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:00:36,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:36,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d2bd240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36, skipping insertion in model container [2024-10-11 05:00:36,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:36,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:00:36,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c[913,926] [2024-10-11 05:00:36,823 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c[5977,5990] [2024-10-11 05:00:36,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:00:36,899 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:00:36,908 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c[913,926] [2024-10-11 05:00:36,922 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c[5977,5990] [2024-10-11 05:00:36,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:00:36,963 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:00:36,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36 WrapperNode [2024-10-11 05:00:36,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:00:36,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:00:36,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:00:36,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:00:36,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:36,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,016 INFO L138 Inliner]: procedures = 58, calls = 64, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 669 [2024-10-11 05:00:37,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:00:37,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:00:37,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:00:37,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:00:37,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,047 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:00:37,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:00:37,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:00:37,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:00:37,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:00:37,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (1/1) ... [2024-10-11 05:00:37,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:00:37,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:37,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:00:37,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:00:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:00:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:00:37,155 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:00:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-11 05:00:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-11 05:00:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:00:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:00:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:00:37,157 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:00:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:00:37,157 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:00:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:00:37,158 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:00:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:00:37,158 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:00:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:00:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:00:37,158 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:00:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:00:37,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:00:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:00:37,158 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:00:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:00:37,159 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:00:37,265 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:00:37,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:00:37,782 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-11 05:00:37,782 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:00:37,838 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:00:37,838 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-11 05:00:37,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:00:37 BoogieIcfgContainer [2024-10-11 05:00:37,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:00:37,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:00:37,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:00:37,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:00:37,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:00:36" (1/3) ... [2024-10-11 05:00:37,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c790e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:00:37, skipping insertion in model container [2024-10-11 05:00:37,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:00:36" (2/3) ... [2024-10-11 05:00:37,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c790e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:00:37, skipping insertion in model container [2024-10-11 05:00:37,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:00:37" (3/3) ... [2024-10-11 05:00:37,846 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.05.cil-2.c [2024-10-11 05:00:37,860 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:00:37,860 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:00:37,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:00:37,926 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;@39c85f08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:00:37,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:00:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 218 states have (on average 1.6972477064220184) internal successors, (370), 225 states have internal predecessors, (370), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 05:00:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 05:00:37,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:37,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:37,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:37,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1842572142, now seen corresponding path program 1 times [2024-10-11 05:00:37,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:37,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469982736] [2024-10-11 05:00:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469982736] [2024-10-11 05:00:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469982736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100013871] [2024-10-11 05:00:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:38,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:38,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:38,280 INFO L87 Difference]: Start difference. First operand has 258 states, 218 states have (on average 1.6972477064220184) internal successors, (370), 225 states have internal predecessors, (370), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:38,726 INFO L93 Difference]: Finished difference Result 563 states and 926 transitions. [2024-10-11 05:00:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:38,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-11 05:00:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:38,739 INFO L225 Difference]: With dead ends: 563 [2024-10-11 05:00:38,740 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 05:00:38,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:38,746 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 500 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:38,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 486 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 05:00:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 309. [2024-10-11 05:00:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 265 states have (on average 1.5433962264150944) internal successors, (409), 270 states have internal predecessors, (409), 31 states have call successors, (31), 12 states have call predecessors, (31), 11 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2024-10-11 05:00:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2024-10-11 05:00:38,804 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 37 [2024-10-11 05:00:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:38,804 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2024-10-11 05:00:38,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2024-10-11 05:00:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 05:00:38,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:38,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:38,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:00:38,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash -425398402, now seen corresponding path program 1 times [2024-10-11 05:00:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603801869] [2024-10-11 05:00:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 05:00:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603801869] [2024-10-11 05:00:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603801869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:38,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:38,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961206686] [2024-10-11 05:00:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:38,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:38,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:38,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:38,894 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:39,202 INFO L93 Difference]: Finished difference Result 543 states and 817 transitions. [2024-10-11 05:00:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-11 05:00:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:39,206 INFO L225 Difference]: With dead ends: 543 [2024-10-11 05:00:39,206 INFO L226 Difference]: Without dead ends: 432 [2024-10-11 05:00:39,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:39,208 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 513 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:39,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 479 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-11 05:00:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 409. [2024-10-11 05:00:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 352 states have (on average 1.4971590909090908) internal successors, (527), 358 states have internal predecessors, (527), 39 states have call successors, (39), 16 states have call predecessors, (39), 16 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2024-10-11 05:00:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 613 transitions. [2024-10-11 05:00:39,244 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 613 transitions. Word has length 38 [2024-10-11 05:00:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:39,244 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 613 transitions. [2024-10-11 05:00:39,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 613 transitions. [2024-10-11 05:00:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 05:00:39,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:39,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:39,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:00:39,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash 522643096, now seen corresponding path program 1 times [2024-10-11 05:00:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543732756] [2024-10-11 05:00:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:00:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:39,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543732756] [2024-10-11 05:00:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543732756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:39,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643665850] [2024-10-11 05:00:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:39,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:39,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:39,348 INFO L87 Difference]: Start difference. First operand 409 states and 613 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:39,728 INFO L93 Difference]: Finished difference Result 829 states and 1194 transitions. [2024-10-11 05:00:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:39,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-11 05:00:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:39,734 INFO L225 Difference]: With dead ends: 829 [2024-10-11 05:00:39,735 INFO L226 Difference]: Without dead ends: 618 [2024-10-11 05:00:39,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:39,736 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 214 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:39,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 661 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-10-11 05:00:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 514. [2024-10-11 05:00:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 445 states have (on average 1.4741573033707864) internal successors, (656), 453 states have internal predecessors, (656), 45 states have call successors, (45), 22 states have call predecessors, (45), 22 states have return successors, (53), 39 states have call predecessors, (53), 41 states have call successors, (53) [2024-10-11 05:00:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 754 transitions. [2024-10-11 05:00:39,768 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 754 transitions. Word has length 39 [2024-10-11 05:00:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:39,769 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 754 transitions. [2024-10-11 05:00:39,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 05:00:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 754 transitions. [2024-10-11 05:00:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 05:00:39,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:39,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:39,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:00:39,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:39,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1026612791, now seen corresponding path program 1 times [2024-10-11 05:00:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762021613] [2024-10-11 05:00:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 05:00:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:00:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:00:39,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:39,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762021613] [2024-10-11 05:00:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762021613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:39,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:39,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465540450] [2024-10-11 05:00:39,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:39,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:39,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:39,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:39,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:39,869 INFO L87 Difference]: Start difference. First operand 514 states and 754 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:40,185 INFO L93 Difference]: Finished difference Result 1030 states and 1471 transitions. [2024-10-11 05:00:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:40,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-11 05:00:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:40,190 INFO L225 Difference]: With dead ends: 1030 [2024-10-11 05:00:40,191 INFO L226 Difference]: Without dead ends: 714 [2024-10-11 05:00:40,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:40,195 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 199 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:40,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 705 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-10-11 05:00:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 680. [2024-10-11 05:00:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 587 states have (on average 1.4173764906303237) internal successors, (832), 597 states have internal predecessors, (832), 59 states have call successors, (59), 30 states have call predecessors, (59), 32 states have return successors, (77), 53 states have call predecessors, (77), 55 states have call successors, (77) [2024-10-11 05:00:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 968 transitions. [2024-10-11 05:00:40,242 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 968 transitions. Word has length 54 [2024-10-11 05:00:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:40,242 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 968 transitions. [2024-10-11 05:00:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 968 transitions. [2024-10-11 05:00:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:00:40,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:40,271 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:40,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:00:40,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:40,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash -169003874, now seen corresponding path program 1 times [2024-10-11 05:00:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:40,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956786740] [2024-10-11 05:00:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:00:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:00:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:00:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:40,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956786740] [2024-10-11 05:00:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956786740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:40,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675081996] [2024-10-11 05:00:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:40,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:40,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:40,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:40,354 INFO L87 Difference]: Start difference. First operand 680 states and 968 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:40,622 INFO L93 Difference]: Finished difference Result 1259 states and 1747 transitions. [2024-10-11 05:00:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:40,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-11 05:00:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:40,629 INFO L225 Difference]: With dead ends: 1259 [2024-10-11 05:00:40,630 INFO L226 Difference]: Without dead ends: 857 [2024-10-11 05:00:40,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:40,631 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 499 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:40,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 491 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:00:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-10-11 05:00:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 808. [2024-10-11 05:00:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 699 states have (on average 1.3834048640915593) internal successors, (967), 711 states have internal predecessors, (967), 67 states have call successors, (67), 36 states have call predecessors, (67), 40 states have return successors, (91), 61 states have call predecessors, (91), 63 states have call successors, (91) [2024-10-11 05:00:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1125 transitions. [2024-10-11 05:00:40,676 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1125 transitions. Word has length 59 [2024-10-11 05:00:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:40,676 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1125 transitions. [2024-10-11 05:00:40,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1125 transitions. [2024-10-11 05:00:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:40,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:40,678 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:40,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:00:40,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:40,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash 208415176, now seen corresponding path program 1 times [2024-10-11 05:00:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:40,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713836926] [2024-10-11 05:00:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:40,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:00:40,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713836926] [2024-10-11 05:00:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713836926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926898989] [2024-10-11 05:00:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:40,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:40,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:40,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:00:40,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:00:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:40,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:00:40,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:00:40,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:40,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926898989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:40,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:40,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:00:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808218881] [2024-10-11 05:00:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:40,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:40,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:40,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:40,920 INFO L87 Difference]: Start difference. First operand 808 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:41,056 INFO L93 Difference]: Finished difference Result 1296 states and 1799 transitions. [2024-10-11 05:00:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:00:41,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:00:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:41,060 INFO L225 Difference]: With dead ends: 1296 [2024-10-11 05:00:41,060 INFO L226 Difference]: Without dead ends: 813 [2024-10-11 05:00:41,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:41,064 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:41,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:00:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-11 05:00:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-10-11 05:00:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 704 states have (on average 1.3693181818181819) internal successors, (964), 716 states have internal predecessors, (964), 67 states have call successors, (67), 36 states have call predecessors, (67), 40 states have return successors, (91), 61 states have call predecessors, (91), 63 states have call successors, (91) [2024-10-11 05:00:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1122 transitions. [2024-10-11 05:00:41,115 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1122 transitions. Word has length 60 [2024-10-11 05:00:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:41,115 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1122 transitions. [2024-10-11 05:00:41,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1122 transitions. [2024-10-11 05:00:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:41,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:41,117 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:41,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 05:00:41,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:41,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash -635590326, now seen corresponding path program 1 times [2024-10-11 05:00:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:41,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807949163] [2024-10-11 05:00:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:00:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807949163] [2024-10-11 05:00:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807949163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140504234] [2024-10-11 05:00:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:41,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:41,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:41,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:00:41,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:00:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:00:41,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:00:41,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:41,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140504234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:41,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:41,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 05:00:41,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325377079] [2024-10-11 05:00:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:41,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:41,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:41,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:41,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:41,503 INFO L87 Difference]: Start difference. First operand 813 states and 1122 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:41,577 INFO L93 Difference]: Finished difference Result 1239 states and 1701 transitions. [2024-10-11 05:00:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:00:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-11 05:00:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:41,580 INFO L225 Difference]: With dead ends: 1239 [2024-10-11 05:00:41,580 INFO L226 Difference]: Without dead ends: 710 [2024-10-11 05:00:41,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:41,584 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:41,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:00:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-11 05:00:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 703. [2024-10-11 05:00:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 612 states have (on average 1.3741830065359477) internal successors, (841), 622 states have internal predecessors, (841), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (72), 51 states have call predecessors, (72), 53 states have call successors, (72) [2024-10-11 05:00:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 970 transitions. [2024-10-11 05:00:41,611 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 970 transitions. Word has length 60 [2024-10-11 05:00:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:41,613 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 970 transitions. [2024-10-11 05:00:41,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:00:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 970 transitions. [2024-10-11 05:00:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:00:41,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:41,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:41,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 05:00:41,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:41,815 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:41,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1162049290, now seen corresponding path program 1 times [2024-10-11 05:00:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:41,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672921584] [2024-10-11 05:00:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672921584] [2024-10-11 05:00:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672921584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:41,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:41,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:00:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957020534] [2024-10-11 05:00:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:41,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:00:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:41,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:00:41,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:41,891 INFO L87 Difference]: Start difference. First operand 703 states and 970 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:42,235 INFO L93 Difference]: Finished difference Result 788 states and 1073 transitions. [2024-10-11 05:00:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:00:42,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-11 05:00:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:42,239 INFO L225 Difference]: With dead ends: 788 [2024-10-11 05:00:42,239 INFO L226 Difference]: Without dead ends: 785 [2024-10-11 05:00:42,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:00:42,241 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 851 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:42,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 488 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:00:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-11 05:00:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 702. [2024-10-11 05:00:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 612 states have (on average 1.3709150326797386) internal successors, (839), 621 states have internal predecessors, (839), 56 states have call successors, (56), 30 states have call predecessors, (56), 32 states have return successors, (72), 51 states have call predecessors, (72), 53 states have call successors, (72) [2024-10-11 05:00:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 967 transitions. [2024-10-11 05:00:42,281 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 967 transitions. Word has length 60 [2024-10-11 05:00:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:42,281 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 967 transitions. [2024-10-11 05:00:42,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:00:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 967 transitions. [2024-10-11 05:00:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 05:00:42,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:42,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:42,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:00:42,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:42,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1662876575, now seen corresponding path program 1 times [2024-10-11 05:00:42,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:42,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088018777] [2024-10-11 05:00:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:00:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:42,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088018777] [2024-10-11 05:00:42,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088018777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705012964] [2024-10-11 05:00:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:42,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:42,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:42,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:00:42,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:00:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:42,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:00:42,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:42,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:00:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 05:00:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705012964] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:00:42,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:00:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-11 05:00:42,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695759566] [2024-10-11 05:00:42,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:00:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:00:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:00:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:00:42,780 INFO L87 Difference]: Start difference. First operand 702 states and 967 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:00:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:43,320 INFO L93 Difference]: Finished difference Result 1505 states and 2002 transitions. [2024-10-11 05:00:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 05:00:43,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-11 05:00:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:43,326 INFO L225 Difference]: With dead ends: 1505 [2024-10-11 05:00:43,326 INFO L226 Difference]: Without dead ends: 1502 [2024-10-11 05:00:43,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:00:43,327 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 695 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:43,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1222 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:00:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-10-11 05:00:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1005. [2024-10-11 05:00:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 879 states have (on average 1.348122866894198) internal successors, (1185), 894 states have internal predecessors, (1185), 75 states have call successors, (75), 43 states have call predecessors, (75), 49 states have return successors, (102), 68 states have call predecessors, (102), 72 states have call successors, (102) [2024-10-11 05:00:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1362 transitions. [2024-10-11 05:00:43,371 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1362 transitions. Word has length 61 [2024-10-11 05:00:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:43,371 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1362 transitions. [2024-10-11 05:00:43,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 05:00:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1362 transitions. [2024-10-11 05:00:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 05:00:43,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:43,373 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:43,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 05:00:43,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:43,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:43,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash -401503642, now seen corresponding path program 2 times [2024-10-11 05:00:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:43,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530661620] [2024-10-11 05:00:43,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:43,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:00:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:00:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 05:00:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:43,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530661620] [2024-10-11 05:00:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530661620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:43,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:43,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:00:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013177538] [2024-10-11 05:00:43,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:43,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:00:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:43,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:00:43,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:00:43,622 INFO L87 Difference]: Start difference. First operand 1005 states and 1362 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:00:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:43,880 INFO L93 Difference]: Finished difference Result 1633 states and 2179 transitions. [2024-10-11 05:00:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:00:43,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-11 05:00:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:43,885 INFO L225 Difference]: With dead ends: 1633 [2024-10-11 05:00:43,885 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 05:00:43,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:00:43,887 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 512 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:43,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 507 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:00:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 05:00:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 897. [2024-10-11 05:00:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 784 states have (on average 1.3482142857142858) internal successors, (1057), 799 states have internal predecessors, (1057), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 60 states have call predecessors, (91), 65 states have call successors, (91) [2024-10-11 05:00:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1216 transitions. [2024-10-11 05:00:43,935 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1216 transitions. Word has length 78 [2024-10-11 05:00:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:43,935 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1216 transitions. [2024-10-11 05:00:43,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 05:00:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1216 transitions. [2024-10-11 05:00:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:43,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:43,937 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:43,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:00:43,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:43,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:43,938 INFO L85 PathProgramCache]: Analyzing trace with hash -43566558, now seen corresponding path program 1 times [2024-10-11 05:00:43,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:43,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284378930] [2024-10-11 05:00:43,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:43,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 05:00:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:00:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 05:00:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 05:00:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 05:00:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 05:00:44,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:44,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284378930] [2024-10-11 05:00:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284378930] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:00:44,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817514375] [2024-10-11 05:00:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:44,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:00:44,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:00:44,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:00:44,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:00:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:00:44,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:00:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:00:44,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:00:44,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817514375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:44,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:00:44,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 05:00:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133568524] [2024-10-11 05:00:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:44,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:00:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:44,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:00:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:44,139 INFO L87 Difference]: Start difference. First operand 897 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:00:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:44,209 INFO L93 Difference]: Finished difference Result 1180 states and 1572 transitions. [2024-10-11 05:00:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:00:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-11 05:00:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:44,211 INFO L225 Difference]: With dead ends: 1180 [2024-10-11 05:00:44,211 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 05:00:44,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:00:44,214 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 55 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:44,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 728 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:00:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 05:00:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-11 05:00:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.6) internal successors, (264), 167 states have internal predecessors, (264), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 05:00:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 304 transitions. [2024-10-11 05:00:44,222 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 304 transitions. Word has length 92 [2024-10-11 05:00:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:44,223 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 304 transitions. [2024-10-11 05:00:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 05:00:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 304 transitions. [2024-10-11 05:00:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:44,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:44,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:44,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 05:00:44,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 05:00:44,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1427183430, now seen corresponding path program 1 times [2024-10-11 05:00:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:44,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904451444] [2024-10-11 05:00:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:44,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904451444] [2024-10-11 05:00:44,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904451444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:44,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863156317] [2024-10-11 05:00:44,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:44,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:44,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:44,589 INFO L87 Difference]: Start difference. First operand 193 states and 304 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:46,150 INFO L93 Difference]: Finished difference Result 691 states and 1121 transitions. [2024-10-11 05:00:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:00:46,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:46,153 INFO L225 Difference]: With dead ends: 691 [2024-10-11 05:00:46,153 INFO L226 Difference]: Without dead ends: 510 [2024-10-11 05:00:46,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:00:46,154 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 694 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:46,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1163 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:00:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-11 05:00:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 381. [2024-10-11 05:00:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 329 states have (on average 1.6109422492401215) internal successors, (530), 333 states have internal predecessors, (530), 37 states have call successors, (37), 13 states have call predecessors, (37), 14 states have return successors, (42), 36 states have call predecessors, (42), 35 states have call successors, (42) [2024-10-11 05:00:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 609 transitions. [2024-10-11 05:00:46,175 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 609 transitions. Word has length 92 [2024-10-11 05:00:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 609 transitions. [2024-10-11 05:00:46,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 609 transitions. [2024-10-11 05:00:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:46,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:46,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:00:46,177 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:46,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1454249032, now seen corresponding path program 1 times [2024-10-11 05:00:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697261725] [2024-10-11 05:00:46,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:46,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:46,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697261725] [2024-10-11 05:00:46,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697261725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:46,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:46,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:46,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949885787] [2024-10-11 05:00:46,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:46,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:46,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:46,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:46,314 INFO L87 Difference]: Start difference. First operand 381 states and 609 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:47,766 INFO L93 Difference]: Finished difference Result 1319 states and 2136 transitions. [2024-10-11 05:00:47,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:00:47,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:47,771 INFO L225 Difference]: With dead ends: 1319 [2024-10-11 05:00:47,772 INFO L226 Difference]: Without dead ends: 952 [2024-10-11 05:00:47,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:00:47,774 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 698 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:47,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1079 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:00:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-11 05:00:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 725. [2024-10-11 05:00:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 631 states have (on average 1.6022187004754358) internal successors, (1011), 637 states have internal predecessors, (1011), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (80), 66 states have call predecessors, (80), 63 states have call successors, (80) [2024-10-11 05:00:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1156 transitions. [2024-10-11 05:00:47,840 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1156 transitions. Word has length 92 [2024-10-11 05:00:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:47,840 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1156 transitions. [2024-10-11 05:00:47,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1156 transitions. [2024-10-11 05:00:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:47,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:47,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:00:47,842 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash -623087866, now seen corresponding path program 1 times [2024-10-11 05:00:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968891375] [2024-10-11 05:00:47,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:47,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:47,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968891375] [2024-10-11 05:00:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968891375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:47,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535997615] [2024-10-11 05:00:47,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:47,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:47,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:47,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:47,982 INFO L87 Difference]: Start difference. First operand 725 states and 1156 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:48,657 INFO L93 Difference]: Finished difference Result 1666 states and 2702 transitions. [2024-10-11 05:00:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:48,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:48,661 INFO L225 Difference]: With dead ends: 1666 [2024-10-11 05:00:48,662 INFO L226 Difference]: Without dead ends: 953 [2024-10-11 05:00:48,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:48,664 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 614 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:48,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 486 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-10-11 05:00:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 725. [2024-10-11 05:00:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 631 states have (on average 1.5942947702060222) internal successors, (1006), 637 states have internal predecessors, (1006), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (80), 66 states have call predecessors, (80), 63 states have call successors, (80) [2024-10-11 05:00:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1151 transitions. [2024-10-11 05:00:48,710 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1151 transitions. Word has length 92 [2024-10-11 05:00:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:48,710 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1151 transitions. [2024-10-11 05:00:48,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1151 transitions. [2024-10-11 05:00:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:48,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:48,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:00:48,712 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:48,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1111016584, now seen corresponding path program 1 times [2024-10-11 05:00:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:48,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867807340] [2024-10-11 05:00:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:48,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867807340] [2024-10-11 05:00:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867807340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:48,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:48,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:48,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314215260] [2024-10-11 05:00:48,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:48,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:48,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:48,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:48,851 INFO L87 Difference]: Start difference. First operand 725 states and 1151 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:49,623 INFO L93 Difference]: Finished difference Result 1662 states and 2681 transitions. [2024-10-11 05:00:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:49,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:49,630 INFO L225 Difference]: With dead ends: 1662 [2024-10-11 05:00:49,630 INFO L226 Difference]: Without dead ends: 949 [2024-10-11 05:00:49,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:49,634 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 537 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:49,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 582 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:00:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-10-11 05:00:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 725. [2024-10-11 05:00:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 631 states have (on average 1.5863708399366085) internal successors, (1001), 637 states have internal predecessors, (1001), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (80), 66 states have call predecessors, (80), 63 states have call successors, (80) [2024-10-11 05:00:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1146 transitions. [2024-10-11 05:00:49,677 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1146 transitions. Word has length 92 [2024-10-11 05:00:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:49,678 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1146 transitions. [2024-10-11 05:00:49,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1146 transitions. [2024-10-11 05:00:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:49,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:49,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:49,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:00:49,679 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:49,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1998239430, now seen corresponding path program 1 times [2024-10-11 05:00:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:49,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509727501] [2024-10-11 05:00:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:49,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:49,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509727501] [2024-10-11 05:00:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509727501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412076425] [2024-10-11 05:00:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:49,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:49,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:49,804 INFO L87 Difference]: Start difference. First operand 725 states and 1146 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:50,500 INFO L93 Difference]: Finished difference Result 1657 states and 2658 transitions. [2024-10-11 05:00:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:00:50,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:50,505 INFO L225 Difference]: With dead ends: 1657 [2024-10-11 05:00:50,506 INFO L226 Difference]: Without dead ends: 944 [2024-10-11 05:00:50,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:00:50,508 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 535 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:50,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 582 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:00:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-10-11 05:00:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 725. [2024-10-11 05:00:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 631 states have (on average 1.578446909667195) internal successors, (996), 637 states have internal predecessors, (996), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (80), 66 states have call predecessors, (80), 63 states have call successors, (80) [2024-10-11 05:00:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1141 transitions. [2024-10-11 05:00:50,577 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1141 transitions. Word has length 92 [2024-10-11 05:00:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:50,577 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1141 transitions. [2024-10-11 05:00:50,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1141 transitions. [2024-10-11 05:00:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:50,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:50,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:50,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:00:50,579 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:50,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 87196872, now seen corresponding path program 1 times [2024-10-11 05:00:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:50,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252894166] [2024-10-11 05:00:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252894166] [2024-10-11 05:00:50,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252894166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:50,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:50,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:50,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849125225] [2024-10-11 05:00:50,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:50,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:50,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:50,739 INFO L87 Difference]: Start difference. First operand 725 states and 1141 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:52,020 INFO L93 Difference]: Finished difference Result 2800 states and 4451 transitions. [2024-10-11 05:00:52,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:00:52,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:52,030 INFO L225 Difference]: With dead ends: 2800 [2024-10-11 05:00:52,030 INFO L226 Difference]: Without dead ends: 2089 [2024-10-11 05:00:52,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:00:52,033 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 880 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:52,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1081 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:00:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-10-11 05:00:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1416. [2024-10-11 05:00:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1242 states have (on average 1.5724637681159421) internal successors, (1953), 1252 states have internal predecessors, (1953), 117 states have call successors, (117), 49 states have call predecessors, (117), 56 states have return successors, (158), 122 states have call predecessors, (158), 115 states have call successors, (158) [2024-10-11 05:00:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2228 transitions. [2024-10-11 05:00:52,140 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2228 transitions. Word has length 92 [2024-10-11 05:00:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:52,140 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2228 transitions. [2024-10-11 05:00:52,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2228 transitions. [2024-10-11 05:00:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:52,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:52,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:52,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:00:52,142 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:52,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 164097670, now seen corresponding path program 1 times [2024-10-11 05:00:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:52,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219848546] [2024-10-11 05:00:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:52,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:52,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219848546] [2024-10-11 05:00:52,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219848546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:52,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352087070] [2024-10-11 05:00:52,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:52,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:52,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:52,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:52,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:52,274 INFO L87 Difference]: Start difference. First operand 1416 states and 2228 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:53,716 INFO L93 Difference]: Finished difference Result 5403 states and 8594 transitions. [2024-10-11 05:00:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:00:53,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:53,730 INFO L225 Difference]: With dead ends: 5403 [2024-10-11 05:00:53,730 INFO L226 Difference]: Without dead ends: 4001 [2024-10-11 05:00:53,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:00:53,734 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 739 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:53,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1107 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:00:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4001 states. [2024-10-11 05:00:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4001 to 2717. [2024-10-11 05:00:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2387 states have (on average 1.5622119815668203) internal successors, (3729), 2405 states have internal predecessors, (3729), 217 states have call successors, (217), 97 states have call predecessors, (217), 112 states have return successors, (328), 230 states have call predecessors, (328), 215 states have call successors, (328) [2024-10-11 05:00:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4274 transitions. [2024-10-11 05:00:53,961 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4274 transitions. Word has length 92 [2024-10-11 05:00:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:53,961 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4274 transitions. [2024-10-11 05:00:53,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4274 transitions. [2024-10-11 05:00:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:53,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:53,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:53,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:00:53,965 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:53,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash -803252984, now seen corresponding path program 1 times [2024-10-11 05:00:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:53,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999942255] [2024-10-11 05:00:53,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:53,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999942255] [2024-10-11 05:00:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999942255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:54,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:54,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847042097] [2024-10-11 05:00:54,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:54,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:54,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:54,094 INFO L87 Difference]: Start difference. First operand 2717 states and 4274 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:55,767 INFO L93 Difference]: Finished difference Result 10050 states and 15996 transitions. [2024-10-11 05:00:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:00:55,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:55,795 INFO L225 Difference]: With dead ends: 10050 [2024-10-11 05:00:55,799 INFO L226 Difference]: Without dead ends: 7347 [2024-10-11 05:00:55,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:00:55,807 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 724 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:55,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1119 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:00:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7347 states. [2024-10-11 05:00:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7347 to 5414. [2024-10-11 05:00:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5414 states, 4780 states have (on average 1.5629707112970712) internal successors, (7471), 4814 states have internal predecessors, (7471), 409 states have call successors, (409), 193 states have call predecessors, (409), 224 states have return successors, (714), 438 states have call predecessors, (714), 407 states have call successors, (714) [2024-10-11 05:00:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5414 states to 5414 states and 8594 transitions. [2024-10-11 05:00:56,241 INFO L78 Accepts]: Start accepts. Automaton has 5414 states and 8594 transitions. Word has length 92 [2024-10-11 05:00:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:56,242 INFO L471 AbstractCegarLoop]: Abstraction has 5414 states and 8594 transitions. [2024-10-11 05:00:56,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 5414 states and 8594 transitions. [2024-10-11 05:00:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:56,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:56,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:56,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:00:56,248 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:56,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1295879158, now seen corresponding path program 1 times [2024-10-11 05:00:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:56,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111039136] [2024-10-11 05:00:56,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:56,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111039136] [2024-10-11 05:00:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111039136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:56,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:56,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019329784] [2024-10-11 05:00:56,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:56,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:56,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:56,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:56,370 INFO L87 Difference]: Start difference. First operand 5414 states and 8594 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:00:58,455 INFO L93 Difference]: Finished difference Result 19549 states and 31358 transitions. [2024-10-11 05:00:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:00:58,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:00:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:00:58,511 INFO L225 Difference]: With dead ends: 19549 [2024-10-11 05:00:58,512 INFO L226 Difference]: Without dead ends: 14149 [2024-10-11 05:00:58,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:00:58,528 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 756 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:00:58,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1119 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:00:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2024-10-11 05:00:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 10808. [2024-10-11 05:00:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10808 states, 9582 states have (on average 1.5640784804842414) internal successors, (14987), 9648 states have internal predecessors, (14987), 777 states have call successors, (777), 385 states have call predecessors, (777), 448 states have return successors, (1632), 838 states have call predecessors, (1632), 775 states have call successors, (1632) [2024-10-11 05:00:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10808 states to 10808 states and 17396 transitions. [2024-10-11 05:00:59,338 INFO L78 Accepts]: Start accepts. Automaton has 10808 states and 17396 transitions. Word has length 92 [2024-10-11 05:00:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:00:59,338 INFO L471 AbstractCegarLoop]: Abstraction has 10808 states and 17396 transitions. [2024-10-11 05:00:59,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:00:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 10808 states and 17396 transitions. [2024-10-11 05:00:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:00:59,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:00:59,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:00:59,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:00:59,347 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:00:59,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:00:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash -341939000, now seen corresponding path program 1 times [2024-10-11 05:00:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:00:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068177941] [2024-10-11 05:00:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:00:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:00:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:00:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:00:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:00:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:00:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:00:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:00:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:00:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:00:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068177941] [2024-10-11 05:00:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068177941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:00:59,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:00:59,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:00:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681164422] [2024-10-11 05:00:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:00:59,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:00:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:00:59,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:00:59,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:00:59,448 INFO L87 Difference]: Start difference. First operand 10808 states and 17396 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:01,142 INFO L93 Difference]: Finished difference Result 24193 states and 39587 transitions. [2024-10-11 05:01:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:01:01,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 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 92 [2024-10-11 05:01:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:01,197 INFO L225 Difference]: With dead ends: 24193 [2024-10-11 05:01:01,197 INFO L226 Difference]: Without dead ends: 13397 [2024-10-11 05:01:01,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:01:01,233 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 536 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:01,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 581 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:01:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13397 states. [2024-10-11 05:01:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13397 to 10808. [2024-10-11 05:01:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10808 states, 9582 states have (on average 1.5572949279899813) internal successors, (14922), 9648 states have internal predecessors, (14922), 777 states have call successors, (777), 385 states have call predecessors, (777), 448 states have return successors, (1632), 838 states have call predecessors, (1632), 775 states have call successors, (1632) [2024-10-11 05:01:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10808 states to 10808 states and 17331 transitions. [2024-10-11 05:01:02,019 INFO L78 Accepts]: Start accepts. Automaton has 10808 states and 17331 transitions. Word has length 92 [2024-10-11 05:01:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:02,020 INFO L471 AbstractCegarLoop]: Abstraction has 10808 states and 17331 transitions. [2024-10-11 05:01:02,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10808 states and 17331 transitions. [2024-10-11 05:01:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 05:01:02,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:02,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:02,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:01:02,029 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:02,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1558092726, now seen corresponding path program 1 times [2024-10-11 05:01:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:02,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113636167] [2024-10-11 05:01:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:02,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:02,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:01:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:01:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:01:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:02,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:01:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:01:02,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:02,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113636167] [2024-10-11 05:01:02,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113636167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:02,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:01:02,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:01:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253110180] [2024-10-11 05:01:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:02,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:01:02,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:01:02,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:01:02,127 INFO L87 Difference]: Start difference. First operand 10808 states and 17331 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:04,313 INFO L93 Difference]: Finished difference Result 30576 states and 48953 transitions. [2024-10-11 05:01:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:01:04,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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 92 [2024-10-11 05:01:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:04,454 INFO L225 Difference]: With dead ends: 30576 [2024-10-11 05:01:04,455 INFO L226 Difference]: Without dead ends: 19782 [2024-10-11 05:01:04,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:01:04,484 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 917 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:04,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 843 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:01:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19782 states. [2024-10-11 05:01:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19782 to 16043. [2024-10-11 05:01:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16043 states, 14192 states have (on average 1.5451662908680948) internal successors, (21929), 14322 states have internal predecessors, (21929), 1178 states have call successors, (1178), 577 states have call predecessors, (1178), 672 states have return successors, (2307), 1207 states have call predecessors, (2307), 1176 states have call successors, (2307) [2024-10-11 05:01:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16043 states to 16043 states and 25414 transitions. [2024-10-11 05:01:06,185 INFO L78 Accepts]: Start accepts. Automaton has 16043 states and 25414 transitions. Word has length 92 [2024-10-11 05:01:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:06,186 INFO L471 AbstractCegarLoop]: Abstraction has 16043 states and 25414 transitions. [2024-10-11 05:01:06,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:01:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 16043 states and 25414 transitions. [2024-10-11 05:01:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:01:06,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:06,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:06,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:01:06,220 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:06,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 907813625, now seen corresponding path program 1 times [2024-10-11 05:01:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:06,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438119375] [2024-10-11 05:01:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:01:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:01:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:01:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:01:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:01:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:01:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:01:06,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:06,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438119375] [2024-10-11 05:01:06,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438119375] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:06,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104454595] [2024-10-11 05:01:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:06,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:06,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:06,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 05:01:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:06,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:06,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 05:01:06,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104454595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:06,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:06,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467618464] [2024-10-11 05:01:06,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:06,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:06,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:06,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:06,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:06,498 INFO L87 Difference]: Start difference. First operand 16043 states and 25414 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:08,593 INFO L93 Difference]: Finished difference Result 47811 states and 76240 transitions. [2024-10-11 05:01:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:08,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2024-10-11 05:01:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:08,692 INFO L225 Difference]: With dead ends: 47811 [2024-10-11 05:01:08,692 INFO L226 Difference]: Without dead ends: 31782 [2024-10-11 05:01:08,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 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-10-11 05:01:08,728 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 251 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:08,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 523 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:01:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31782 states. [2024-10-11 05:01:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31782 to 31682. [2024-10-11 05:01:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31682 states, 28037 states have (on average 1.5414273995077932) internal successors, (43217), 28295 states have internal predecessors, (43217), 2300 states have call successors, (2300), 1153 states have call predecessors, (2300), 1344 states have return successors, (4495), 2297 states have call predecessors, (4495), 2298 states have call successors, (4495) [2024-10-11 05:01:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31682 states to 31682 states and 50012 transitions. [2024-10-11 05:01:11,763 INFO L78 Accepts]: Start accepts. Automaton has 31682 states and 50012 transitions. Word has length 148 [2024-10-11 05:01:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:11,764 INFO L471 AbstractCegarLoop]: Abstraction has 31682 states and 50012 transitions. [2024-10-11 05:01:11,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31682 states and 50012 transitions. [2024-10-11 05:01:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:01:11,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:11,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:11,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 05:01:12,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 05:01:12,030 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:12,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash -846949513, now seen corresponding path program 1 times [2024-10-11 05:01:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186354182] [2024-10-11 05:01:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:01:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:01:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:01:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:01:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:01:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:01:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:01:12,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186354182] [2024-10-11 05:01:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186354182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511344431] [2024-10-11 05:01:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:12,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:12,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:12,171 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:12,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 05:01:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:12,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:12,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 05:01:12,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511344431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130346379] [2024-10-11 05:01:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:12,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:12,348 INFO L87 Difference]: Start difference. First operand 31682 states and 50012 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:01:16,815 INFO L93 Difference]: Finished difference Result 94248 states and 149716 transitions. [2024-10-11 05:01:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:01:16,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2024-10-11 05:01:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:01:17,023 INFO L225 Difference]: With dead ends: 94248 [2024-10-11 05:01:17,023 INFO L226 Difference]: Without dead ends: 62580 [2024-10-11 05:01:17,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 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-10-11 05:01:17,097 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 241 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:01:17,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 523 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:01:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62580 states. [2024-10-11 05:01:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62580 to 62384. [2024-10-11 05:01:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62384 states, 55295 states have (on average 1.538529704313229) internal successors, (85073), 55809 states have internal predecessors, (85073), 4400 states have call successors, (4400), 2305 states have call predecessors, (4400), 2688 states have return successors, (8727), 4333 states have call predecessors, (8727), 4398 states have call successors, (8727) [2024-10-11 05:01:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62384 states to 62384 states and 98200 transitions. [2024-10-11 05:01:22,623 INFO L78 Accepts]: Start accepts. Automaton has 62384 states and 98200 transitions. Word has length 148 [2024-10-11 05:01:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:01:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 62384 states and 98200 transitions. [2024-10-11 05:01:22,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:01:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 62384 states and 98200 transitions. [2024-10-11 05:01:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:01:22,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:01:22,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:01:22,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 05:01:22,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 05:01:22,899 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:01:22,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:01:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash -185996939, now seen corresponding path program 1 times [2024-10-11 05:01:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:01:22,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550807384] [2024-10-11 05:01:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:22,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:01:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:01:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 05:01:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 05:01:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:01:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:01:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:01:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:01:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 05:01:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:01:23,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:01:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550807384] [2024-10-11 05:01:23,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550807384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:01:23,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226138699] [2024-10-11 05:01:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:01:23,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:01:23,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:01:23,015 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:01:23,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 05:01:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:01:23,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:01:23,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:01:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 05:01:23,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:01:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226138699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:01:23,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:01:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:01:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581043874] [2024-10-11 05:01:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:01:23,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:01:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:01:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:01:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:01:23,170 INFO L87 Difference]: Start difference. First operand 62384 states and 98200 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)