./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/Problem05_label46+token_ring.04.cil-1.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/Problem05_label46+token_ring.04.cil-1.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 6b2ea308b98ca1eae9030e7a6017fcc5084f411cde9353ed6e1419a4046239c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:21:42,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:21:42,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:21:42,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:21:42,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:21:42,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:21:42,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:21:42,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:21:42,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:21:42,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:21:42,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:21:42,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:21:42,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:21:42,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:21:42,781 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:21:42,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:21:42,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:21:42,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:21:42,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:21:42,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:21:42,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:21:42,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:21:42,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:21:42,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:21:42,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:21:42,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:21:42,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:21:42,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:21:42,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:21:42,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:21:42,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:21:42,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:21:42,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:21:42,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:21:42,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:21:42,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:21:42,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:21:42,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:21:42,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:21:42,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:21:42,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:21:42,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:21:42,793 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 -> 6b2ea308b98ca1eae9030e7a6017fcc5084f411cde9353ed6e1419a4046239c4 [2024-10-11 04:21:43,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:21:43,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:21:43,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:21:43,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:21:43,043 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:21:43,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-1.c [2024-10-11 04:21:44,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:21:44,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:21:44,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-1.c [2024-10-11 04:21:44,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/feb98212d/f65a3bb6a64645259e10fbde64f6b635/FLAGac33c11fe [2024-10-11 04:21:44,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/feb98212d/f65a3bb6a64645259e10fbde64f6b635 [2024-10-11 04:21:44,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:21:44,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:21:44,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:21:44,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:21:44,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:21:44,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:21:44" (1/1) ... [2024-10-11 04:21:44,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ebcfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:44, skipping insertion in model container [2024-10-11 04:21:44,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:21:44" (1/1) ... [2024-10-11 04:21:44,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:21:46,118 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/Problem05_label46+token_ring.04.cil-1.c[382357,382370] [2024-10-11 04:21:46,140 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/Problem05_label46+token_ring.04.cil-1.c[383339,383352] [2024-10-11 04:21:46,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:21:46,269 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:21:46,858 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/Problem05_label46+token_ring.04.cil-1.c[382357,382370] [2024-10-11 04:21:46,862 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/Problem05_label46+token_ring.04.cil-1.c[383339,383352] [2024-10-11 04:21:46,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:21:46,918 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:21:46,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46 WrapperNode [2024-10-11 04:21:46,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:21:46,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:21:46,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:21:46,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:21:46,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,305 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12753 [2024-10-11 04:21:47,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:21:47,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:21:47,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:21:47,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:21:47,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,485 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 04:21:47,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:21:47,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:21:47,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:21:47,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:21:47,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (1/1) ... [2024-10-11 04:21:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:21:47,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:47,886 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 04:21:47,888 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 04:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:21:47,930 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:21:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:21:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:21:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:21:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:21:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:21:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:21:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:21:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:21:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:21:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:21:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:21:48,035 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:21:48,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:21:53,801 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2024-10-11 04:21:53,801 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:21:53,889 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:21:53,890 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 04:21:53,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:21:53 BoogieIcfgContainer [2024-10-11 04:21:53,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:21:53,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:21:53,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:21:53,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:21:53,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:21:44" (1/3) ... [2024-10-11 04:21:53,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfa5115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:21:53, skipping insertion in model container [2024-10-11 04:21:53,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:46" (2/3) ... [2024-10-11 04:21:53,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfa5115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:21:53, skipping insertion in model container [2024-10-11 04:21:53,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:21:53" (3/3) ... [2024-10-11 04:21:53,898 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.04.cil-1.c [2024-10-11 04:21:53,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:21:53,913 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:21:54,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:21:54,027 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;@5c14471f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:21:54,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:21:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 2287 states, 2260 states have (on average 1.8836283185840708) internal successors, (4257), 2263 states have internal predecessors, (4257), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 04:21:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:21:54,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:54,050 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] [2024-10-11 04:21:54,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:54,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:54,055 INFO L85 PathProgramCache]: Analyzing trace with hash 441639431, now seen corresponding path program 1 times [2024-10-11 04:21:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:54,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274375483] [2024-10-11 04:21:54,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:54,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:21:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:21:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:54,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:21:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:54,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:21:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:54,435 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 04:21:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274375483] [2024-10-11 04:21:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274375483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:54,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:54,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:21:54,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368735502] [2024-10-11 04:21:54,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:54,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:21:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:54,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:21:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:21:54,470 INFO L87 Difference]: Start difference. First operand has 2287 states, 2260 states have (on average 1.8836283185840708) internal successors, (4257), 2263 states have internal predecessors, (4257), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:55,193 INFO L93 Difference]: Finished difference Result 4620 states and 8666 transitions. [2024-10-11 04:21:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:21:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:21:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:55,223 INFO L225 Difference]: With dead ends: 4620 [2024-10-11 04:21:55,223 INFO L226 Difference]: Without dead ends: 2333 [2024-10-11 04:21:55,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:21:55,233 INFO L432 NwaCegarLoop]: 4105 mSDtfsCounter, 411 mSDsluCounter, 12028 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 16133 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:55,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 16133 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:21:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2024-10-11 04:21:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2283. [2024-10-11 04:21:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2257 states have (on average 1.8489144882587505) internal successors, (4173), 2259 states have internal predecessors, (4173), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 04:21:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 4209 transitions. [2024-10-11 04:21:55,369 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 4209 transitions. Word has length 81 [2024-10-11 04:21:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:55,369 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 4209 transitions. [2024-10-11 04:21:55,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 4209 transitions. [2024-10-11 04:21:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:21:55,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:55,373 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] [2024-10-11 04:21:55,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:21:55,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:55,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:55,374 INFO L85 PathProgramCache]: Analyzing trace with hash -445583415, now seen corresponding path program 1 times [2024-10-11 04:21:55,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:55,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897813343] [2024-10-11 04:21:55,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:55,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:21:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:21:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:21:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:21:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,584 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 04:21:55,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:55,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897813343] [2024-10-11 04:21:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897813343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:21:55,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882560908] [2024-10-11 04:21:55,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:55,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:21:55,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:55,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:21:55,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:21:55,587 INFO L87 Difference]: Start difference. First operand 2283 states and 4209 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:56,677 INFO L93 Difference]: Finished difference Result 2690 states and 4863 transitions. [2024-10-11 04:21:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:21:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:21:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:56,687 INFO L225 Difference]: With dead ends: 2690 [2024-10-11 04:21:56,688 INFO L226 Difference]: Without dead ends: 2538 [2024-10-11 04:21:56,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:21:56,691 INFO L432 NwaCegarLoop]: 4086 mSDtfsCounter, 4562 mSDsluCounter, 12233 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4573 SdHoareTripleChecker+Valid, 16319 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:56,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4573 Valid, 16319 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:21:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2024-10-11 04:21:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2439. [2024-10-11 04:21:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2393 states have (on average 1.8340994567488509) internal successors, (4389), 2396 states have internal predecessors, (4389), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-11 04:21:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 4454 transitions. [2024-10-11 04:21:56,766 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 4454 transitions. Word has length 81 [2024-10-11 04:21:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:56,767 INFO L471 AbstractCegarLoop]: Abstraction has 2439 states and 4454 transitions. [2024-10-11 04:21:56,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 4454 transitions. [2024-10-11 04:21:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:21:56,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:56,769 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] [2024-10-11 04:21:56,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:21:56,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:56,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1863382519, now seen corresponding path program 1 times [2024-10-11 04:21:56,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:56,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875098556] [2024-10-11 04:21:56,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:21:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:21:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:21:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:21:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:56,949 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 04:21:56,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:56,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875098556] [2024-10-11 04:21:56,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875098556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:56,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:56,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520870917] [2024-10-11 04:21:56,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:56,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:56,952 INFO L87 Difference]: Start difference. First operand 2439 states and 4454 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:58,328 INFO L93 Difference]: Finished difference Result 3055 states and 5437 transitions. [2024-10-11 04:21:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:58,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:21:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:58,339 INFO L225 Difference]: With dead ends: 3055 [2024-10-11 04:21:58,340 INFO L226 Difference]: Without dead ends: 2747 [2024-10-11 04:21:58,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:58,345 INFO L432 NwaCegarLoop]: 4180 mSDtfsCounter, 4567 mSDsluCounter, 16521 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 20701 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:58,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 20701 Invalid, 1595 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:21:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2024-10-11 04:21:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2584. [2024-10-11 04:21:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2518 states have (on average 1.8200953137410643) internal successors, (4583), 2522 states have internal predecessors, (4583), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-11 04:21:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4676 transitions. [2024-10-11 04:21:58,426 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 4676 transitions. Word has length 81 [2024-10-11 04:21:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 2584 states and 4676 transitions. [2024-10-11 04:21:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 4676 transitions. [2024-10-11 04:21:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:21:58,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:58,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:58,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:21:58,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1215431051, now seen corresponding path program 1 times [2024-10-11 04:21:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:58,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821027696] [2024-10-11 04:21:58,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:58,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:21:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:21:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:21:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:21:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,604 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 04:21:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821027696] [2024-10-11 04:21:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821027696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558006581] [2024-10-11 04:21:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:58,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:58,607 INFO L87 Difference]: Start difference. First operand 2584 states and 4676 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:59,739 INFO L93 Difference]: Finished difference Result 3589 states and 6275 transitions. [2024-10-11 04:21:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:59,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:21:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:59,755 INFO L225 Difference]: With dead ends: 3589 [2024-10-11 04:21:59,755 INFO L226 Difference]: Without dead ends: 3136 [2024-10-11 04:21:59,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:59,761 INFO L432 NwaCegarLoop]: 4095 mSDtfsCounter, 4613 mSDsluCounter, 16302 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 20397 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:59,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 20397 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:21:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2024-10-11 04:21:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2875. [2024-10-11 04:21:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2769 states have (on average 1.795594077284218) internal successors, (4972), 2775 states have internal predecessors, (4972), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 04:21:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 5125 transitions. [2024-10-11 04:21:59,890 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 5125 transitions. Word has length 81 [2024-10-11 04:21:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:59,890 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 5125 transitions. [2024-10-11 04:21:59,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:21:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 5125 transitions. [2024-10-11 04:21:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:21:59,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:59,892 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] [2024-10-11 04:21:59,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:21:59,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:59,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 483463625, now seen corresponding path program 1 times [2024-10-11 04:21:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128716091] [2024-10-11 04:21:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:21:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:21:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:21:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:21:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,992 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 04:21:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128716091] [2024-10-11 04:21:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128716091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:59,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:59,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702666224] [2024-10-11 04:21:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:59,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:59,994 INFO L87 Difference]: Start difference. First operand 2875 states and 5125 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:00,553 INFO L93 Difference]: Finished difference Result 3870 states and 6717 transitions. [2024-10-11 04:22:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:22:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:22:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:00,565 INFO L225 Difference]: With dead ends: 3870 [2024-10-11 04:22:00,566 INFO L226 Difference]: Without dead ends: 3126 [2024-10-11 04:22:00,569 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 04:22:00,570 INFO L432 NwaCegarLoop]: 4073 mSDtfsCounter, 4416 mSDsluCounter, 16172 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 20245 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:00,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 20245 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:22:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2024-10-11 04:22:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2875. [2024-10-11 04:22:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2769 states have (on average 1.79378837125316) internal successors, (4967), 2775 states have internal predecessors, (4967), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 04:22:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 5120 transitions. [2024-10-11 04:22:00,641 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 5120 transitions. Word has length 81 [2024-10-11 04:22:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:00,641 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 5120 transitions. [2024-10-11 04:22:00,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 5120 transitions. [2024-10-11 04:22:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:22:00,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:00,643 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] [2024-10-11 04:22:00,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:22:00,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:00,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1202716213, now seen corresponding path program 1 times [2024-10-11 04:22:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:00,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407100523] [2024-10-11 04:22:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,769 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 04:22:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407100523] [2024-10-11 04:22:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407100523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:00,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:00,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817133590] [2024-10-11 04:22:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:00,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:00,771 INFO L87 Difference]: Start difference. First operand 2875 states and 5120 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:01,856 INFO L93 Difference]: Finished difference Result 4829 states and 8192 transitions. [2024-10-11 04:22:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:22:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:22:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:01,869 INFO L225 Difference]: With dead ends: 4829 [2024-10-11 04:22:01,869 INFO L226 Difference]: Without dead ends: 4085 [2024-10-11 04:22:01,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:22:01,873 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4711 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:01,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 20692 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:22:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2024-10-11 04:22:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3459. [2024-10-11 04:22:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3277 states have (on average 1.7552639609398841) internal successors, (5752), 3287 states have internal predecessors, (5752), 118 states have call successors, (118), 54 states have call predecessors, (118), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-11 04:22:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 6023 transitions. [2024-10-11 04:22:01,965 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 6023 transitions. Word has length 81 [2024-10-11 04:22:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:01,965 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 6023 transitions. [2024-10-11 04:22:01,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 6023 transitions. [2024-10-11 04:22:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:22:01,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:01,967 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] [2024-10-11 04:22:01,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:22:01,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:01,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1620112819, now seen corresponding path program 1 times [2024-10-11 04:22:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:01,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927325756] [2024-10-11 04:22:01,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,074 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 04:22:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927325756] [2024-10-11 04:22:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927325756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:02,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:02,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:02,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792478543] [2024-10-11 04:22:02,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:02,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:02,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:02,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:02,076 INFO L87 Difference]: Start difference. First operand 3459 states and 6023 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:03,389 INFO L93 Difference]: Finished difference Result 6997 states and 11579 transitions. [2024-10-11 04:22:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:22:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:22:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:03,410 INFO L225 Difference]: With dead ends: 6997 [2024-10-11 04:22:03,411 INFO L226 Difference]: Without dead ends: 5669 [2024-10-11 04:22:03,417 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 04:22:03,418 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4584 mSDsluCounter, 16513 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4594 SdHoareTripleChecker+Valid, 20688 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:03,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4594 Valid, 20688 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:22:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2024-10-11 04:22:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 4582. [2024-10-11 04:22:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 4252 states have (on average 1.7064910630291628) internal successors, (7256), 4270 states have internal predecessors, (7256), 210 states have call successors, (210), 102 states have call predecessors, (210), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-11 04:22:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 7773 transitions. [2024-10-11 04:22:03,590 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 7773 transitions. Word has length 81 [2024-10-11 04:22:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:03,590 INFO L471 AbstractCegarLoop]: Abstraction has 4582 states and 7773 transitions. [2024-10-11 04:22:03,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 7773 transitions. [2024-10-11 04:22:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:22:03,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:03,594 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] [2024-10-11 04:22:03,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:22:03,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:03,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash -940840565, now seen corresponding path program 1 times [2024-10-11 04:22:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:03,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051955824] [2024-10-11 04:22:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:03,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:03,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051955824] [2024-10-11 04:22:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051955824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695946473] [2024-10-11 04:22:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:03,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:03,733 INFO L87 Difference]: Start difference. First operand 4582 states and 7773 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:05,038 INFO L93 Difference]: Finished difference Result 11098 states and 18019 transitions. [2024-10-11 04:22:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:22:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:22:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:05,075 INFO L225 Difference]: With dead ends: 11098 [2024-10-11 04:22:05,075 INFO L226 Difference]: Without dead ends: 8647 [2024-10-11 04:22:05,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:22:05,085 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4639 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:05,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 20692 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:22:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8647 states. [2024-10-11 04:22:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8647 to 6867. [2024-10-11 04:22:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6867 states, 6249 states have (on average 1.6549847975676109) internal successors, (10342), 6283 states have internal predecessors, (10342), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-11 04:22:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 11389 transitions. [2024-10-11 04:22:05,354 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 11389 transitions. Word has length 81 [2024-10-11 04:22:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:05,355 INFO L471 AbstractCegarLoop]: Abstraction has 6867 states and 11389 transitions. [2024-10-11 04:22:05,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 11389 transitions. [2024-10-11 04:22:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:22:05,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:05,361 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] [2024-10-11 04:22:05,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:22:05,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:05,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1020734093, now seen corresponding path program 1 times [2024-10-11 04:22:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:05,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677640548] [2024-10-11 04:22:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:05,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:05,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:05,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:05,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:05,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:05,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:05,498 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 04:22:05,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:05,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677640548] [2024-10-11 04:22:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677640548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:05,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499351559] [2024-10-11 04:22:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:05,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:05,500 INFO L87 Difference]: Start difference. First operand 6867 states and 11389 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:07,385 INFO L93 Difference]: Finished difference Result 19165 states and 30877 transitions. [2024-10-11 04:22:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:22:07,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:22:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:07,431 INFO L225 Difference]: With dead ends: 19165 [2024-10-11 04:22:07,431 INFO L226 Difference]: Without dead ends: 14429 [2024-10-11 04:22:07,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:22:07,451 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4603 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4619 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:07,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4619 Valid, 20692 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:22:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14429 states. [2024-10-11 04:22:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14429 to 11436. [2024-10-11 04:22:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11436 states, 10258 states have (on average 1.6127900175472802) internal successors, (16544), 10324 states have internal predecessors, (16544), 722 states have call successors, (722), 390 states have call predecessors, (722), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-11 04:22:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11436 states to 11436 states and 18781 transitions. [2024-10-11 04:22:08,018 INFO L78 Accepts]: Start accepts. Automaton has 11436 states and 18781 transitions. Word has length 81 [2024-10-11 04:22:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:08,018 INFO L471 AbstractCegarLoop]: Abstraction has 11436 states and 18781 transitions. [2024-10-11 04:22:08,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 11436 states and 18781 transitions. [2024-10-11 04:22:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:22:08,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:08,025 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] [2024-10-11 04:22:08,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:22:08,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:08,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1222558027, now seen corresponding path program 1 times [2024-10-11 04:22:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:08,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267995133] [2024-10-11 04:22:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:08,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:08,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:08,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:08,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:08,128 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 04:22:08,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:08,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267995133] [2024-10-11 04:22:08,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267995133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:08,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:08,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:08,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84980645] [2024-10-11 04:22:08,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:08,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:08,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:08,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:08,130 INFO L87 Difference]: Start difference. First operand 11436 states and 18781 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:10,214 INFO L93 Difference]: Finished difference Result 34784 states and 56375 transitions. [2024-10-11 04:22:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:22:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:22:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:10,297 INFO L225 Difference]: With dead ends: 34784 [2024-10-11 04:22:10,298 INFO L226 Difference]: Without dead ends: 25479 [2024-10-11 04:22:10,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:22:10,331 INFO L432 NwaCegarLoop]: 4166 mSDtfsCounter, 4552 mSDsluCounter, 16504 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4562 SdHoareTripleChecker+Valid, 20670 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:10,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4562 Valid, 20670 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:22:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25479 states. [2024-10-11 04:22:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25479 to 20561. [2024-10-11 04:22:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20561 states, 18303 states have (on average 1.5847675244495438) internal successors, (29006), 18433 states have internal predecessors, (29006), 1358 states have call successors, (1358), 770 states have call predecessors, (1358), 898 states have return successors, (3673), 1485 states have call predecessors, (3673), 1358 states have call successors, (3673) [2024-10-11 04:22:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20561 states to 20561 states and 34037 transitions. [2024-10-11 04:22:11,425 INFO L78 Accepts]: Start accepts. Automaton has 20561 states and 34037 transitions. Word has length 81 [2024-10-11 04:22:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:11,425 INFO L471 AbstractCegarLoop]: Abstraction has 20561 states and 34037 transitions. [2024-10-11 04:22:11,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 20561 states and 34037 transitions. [2024-10-11 04:22:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:22:11,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:11,438 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] [2024-10-11 04:22:11,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:22:11,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:11,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1783257805, now seen corresponding path program 1 times [2024-10-11 04:22:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:11,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117527858] [2024-10-11 04:22:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:11,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:11,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:11,511 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 04:22:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:11,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117527858] [2024-10-11 04:22:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117527858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:11,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:22:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200052641] [2024-10-11 04:22:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:11,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:22:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:11,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:22:11,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:22:11,513 INFO L87 Difference]: Start difference. First operand 20561 states and 34037 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:14,284 INFO L93 Difference]: Finished difference Result 54256 states and 88376 transitions. [2024-10-11 04:22:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:22:14,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:22:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:14,388 INFO L225 Difference]: With dead ends: 54256 [2024-10-11 04:22:14,388 INFO L226 Difference]: Without dead ends: 35827 [2024-10-11 04:22:14,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:22:14,434 INFO L432 NwaCegarLoop]: 4213 mSDtfsCounter, 4743 mSDsluCounter, 12309 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 16522 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:14,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 16522 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:22:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35827 states. [2024-10-11 04:22:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35827 to 29690. [2024-10-11 04:22:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29690 states, 26260 states have (on average 1.562909367859863) internal successors, (41042), 26519 states have internal predecessors, (41042), 2076 states have call successors, (2076), 1160 states have call predecessors, (2076), 1352 states have return successors, (5121), 2138 states have call predecessors, (5121), 2076 states have call successors, (5121) [2024-10-11 04:22:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29690 states to 29690 states and 48239 transitions. [2024-10-11 04:22:15,948 INFO L78 Accepts]: Start accepts. Automaton has 29690 states and 48239 transitions. Word has length 81 [2024-10-11 04:22:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:15,948 INFO L471 AbstractCegarLoop]: Abstraction has 29690 states and 48239 transitions. [2024-10-11 04:22:15,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 29690 states and 48239 transitions. [2024-10-11 04:22:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:22:16,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:16,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:22:16,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:16,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2026060594, now seen corresponding path program 1 times [2024-10-11 04:22:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:16,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204598173] [2024-10-11 04:22:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:22:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:22:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:22:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:16,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204598173] [2024-10-11 04:22:16,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204598173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:22:16,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530144846] [2024-10-11 04:22:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:16,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:16,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:16,135 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 04:22:16,136 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 04:22:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:16,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:22:16,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:22:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 04:22:16,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:22:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530144846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:16,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:22:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:22:16,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327138134] [2024-10-11 04:22:16,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:16,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:22:16,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:22:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:16,327 INFO L87 Difference]: Start difference. First operand 29690 states and 48239 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:22:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:19,323 INFO L93 Difference]: Finished difference Result 84209 states and 136555 transitions. [2024-10-11 04:22:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:22:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-11 04:22:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:19,529 INFO L225 Difference]: With dead ends: 84209 [2024-10-11 04:22:19,529 INFO L226 Difference]: Without dead ends: 56651 [2024-10-11 04:22:19,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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 04:22:19,606 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4157 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4157 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:19,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4157 Valid, 4391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:22:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56651 states. [2024-10-11 04:22:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56651 to 56455. [2024-10-11 04:22:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56455 states, 49707 states have (on average 1.5459995574064016) internal successors, (76847), 50223 states have internal predecessors, (76847), 4046 states have call successors, (4046), 2316 states have call predecessors, (4046), 2700 states have return successors, (10009), 4043 states have call predecessors, (10009), 4046 states have call successors, (10009) [2024-10-11 04:22:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56455 states to 56455 states and 90902 transitions. [2024-10-11 04:22:22,754 INFO L78 Accepts]: Start accepts. Automaton has 56455 states and 90902 transitions. Word has length 131 [2024-10-11 04:22:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:22,755 INFO L471 AbstractCegarLoop]: Abstraction has 56455 states and 90902 transitions. [2024-10-11 04:22:22,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:22:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 56455 states and 90902 transitions. [2024-10-11 04:22:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:22:22,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:22,844 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 04:22:23,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:22:23,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:23,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -746424850, now seen corresponding path program 1 times [2024-10-11 04:22:23,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:23,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769882544] [2024-10-11 04:22:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:22:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:22:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:22:23,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:23,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769882544] [2024-10-11 04:22:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769882544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:22:23,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418727292] [2024-10-11 04:22:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:23,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:23,157 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 04:22:23,157 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 04:22:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:23,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:22:23,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:22:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 04:22:23,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:22:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418727292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:23,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:22:23,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:22:23,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433575299] [2024-10-11 04:22:23,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:23,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:22:23,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:22:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:23,311 INFO L87 Difference]: Start difference. First operand 56455 states and 90902 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:22:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:29,209 INFO L93 Difference]: Finished difference Result 163896 states and 264344 transitions. [2024-10-11 04:22:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:22:29,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-11 04:22:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:29,782 INFO L225 Difference]: With dead ends: 163896 [2024-10-11 04:22:29,782 INFO L226 Difference]: Without dead ends: 109573 [2024-10-11 04:22:29,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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 04:22:29,886 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4162 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:29,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 4391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:22:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states. [2024-10-11 04:22:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109573 to 109183. [2024-10-11 04:22:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109183 states, 95913 states have (on average 1.5345886376195093) internal successors, (147187), 96943 states have internal predecessors, (147187), 7880 states have call successors, (7880), 4620 states have call predecessors, (7880), 5388 states have return successors, (19679), 7747 states have call predecessors, (19679), 7880 states have call successors, (19679) [2024-10-11 04:22:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109183 states to 109183 states and 174746 transitions. [2024-10-11 04:22:37,017 INFO L78 Accepts]: Start accepts. Automaton has 109183 states and 174746 transitions. Word has length 131 [2024-10-11 04:22:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:37,017 INFO L471 AbstractCegarLoop]: Abstraction has 109183 states and 174746 transitions. [2024-10-11 04:22:37,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:22:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 109183 states and 174746 transitions. [2024-10-11 04:22:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:22:37,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:37,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:22:37,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:22:37,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:37,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:37,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1430357810, now seen corresponding path program 1 times [2024-10-11 04:22:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:37,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535918026] [2024-10-11 04:22:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:22:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:22:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:22:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:22:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:22:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:22:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:22:37,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535918026] [2024-10-11 04:22:37,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535918026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:22:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271882171] [2024-10-11 04:22:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:37,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:37,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:37,747 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 04:22:37,747 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 04:22:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:37,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:22:37,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:22:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 04:22:37,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:22:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271882171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:22:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:22:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379743327] [2024-10-11 04:22:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:37,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:22:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:37,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:22:37,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:37,864 INFO L87 Difference]: Start difference. First operand 109183 states and 174746 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)