./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_label47+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.13.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed3d7c65b5f276938c992de2fd71c82e0f79af5cc9147088727c012b3d12461a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:24:53,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:24:53,460 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:24:53,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:24:53,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:24:53,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:24:53,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:24:53,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:24:53,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:24:53,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:24:53,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:24:53,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:24:53,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:24:53,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:24:53,492 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:24:53,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:24:53,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:24:53,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:24:53,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:24:53,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:24:53,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:24:53,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:24:53,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:24:53,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:24:53,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:24:53,499 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:24:53,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:24:53,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:24:53,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:24:53,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:24:53,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:24:53,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:24:53,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:24:53,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:24:53,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:24:53,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:24:53,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:24:53,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:24:53,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:24:53,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:24:53,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:24:53,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:24:53,504 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 -> ed3d7c65b5f276938c992de2fd71c82e0f79af5cc9147088727c012b3d12461a [2024-10-11 04:24:53,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:24:53,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:24:53,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:24:53,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:24:53,785 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:24:53,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.13.cil-2.c [2024-10-11 04:24:55,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:24:55,973 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:24:55,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.13.cil-2.c [2024-10-11 04:24:56,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bad78ca16/879cdf5e1e2f493daaaaeb76f46606e7/FLAGe6aa682d4 [2024-10-11 04:24:56,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bad78ca16/879cdf5e1e2f493daaaaeb76f46606e7 [2024-10-11 04:24:56,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:24:56,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:24:56,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:24:56,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:24:56,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:24:56,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:24:56" (1/1) ... [2024-10-11 04:24:56,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56911c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:56, skipping insertion in model container [2024-10-11 04:24:56,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:24:56" (1/1) ... [2024-10-11 04:24:56,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:24:57,932 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_label47+token_ring.13.cil-2.c[377612,377625] [2024-10-11 04:24:57,970 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_label47+token_ring.13.cil-2.c[383339,383352] [2024-10-11 04:24:58,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:24:58,316 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:24:59,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_label47+token_ring.13.cil-2.c[377612,377625] [2024-10-11 04:24:59,127 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_label47+token_ring.13.cil-2.c[383339,383352] [2024-10-11 04:24:59,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:24:59,223 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:24:59,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59 WrapperNode [2024-10-11 04:24:59,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:24:59,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:24:59,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:24:59,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:24:59,230 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:24:59" (1/1) ... [2024-10-11 04:24:59,328 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:24:59" (1/1) ... [2024-10-11 04:24:59,722 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-10-11 04:24:59,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:24:59,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:24:59,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:24:59,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:24:59,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:24:59,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:24:59,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:24:59,983 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:24:59,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:24:59,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:25:00,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:25:00,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:25:00,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:25:00,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:25:00,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:25:00,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:25:00,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:25:00,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:25:00,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (1/1) ... [2024-10-11 04:25:00,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:25:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:00,655 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:25:00,673 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:25:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:25:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:25:00,762 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:25:00,763 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:25:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:25:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:25:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:25:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:25:00,765 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:25:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:25:00,765 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:25:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:25:00,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:25:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:25:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:25:00,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:25:00,942 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:25:00,945 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:25:09,215 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-10-11 04:25:09,216 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:25:09,350 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:25:09,351 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-11 04:25:09,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:25:09 BoogieIcfgContainer [2024-10-11 04:25:09,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:25:09,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:25:09,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:25:09,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:25:09,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:24:56" (1/3) ... [2024-10-11 04:25:09,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b33de88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:25:09, skipping insertion in model container [2024-10-11 04:25:09,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:59" (2/3) ... [2024-10-11 04:25:09,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b33de88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:25:09, skipping insertion in model container [2024-10-11 04:25:09,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:25:09" (3/3) ... [2024-10-11 04:25:09,360 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.13.cil-2.c [2024-10-11 04:25:09,378 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:25:09,378 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:25:09,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:25:09,527 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;@20ee892e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:25:09,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:25:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 04:25:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:09,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:09,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:09,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:09,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1072822453, now seen corresponding path program 1 times [2024-10-11 04:25:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512323806] [2024-10-11 04:25:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:10,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:10,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:10,364 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:25:10,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:10,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512323806] [2024-10-11 04:25:10,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512323806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:25:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029326959] [2024-10-11 04:25:10,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:25:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:25:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:25:10,412 INFO L87 Difference]: Start difference. First operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:25:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:12,952 INFO L93 Difference]: Finished difference Result 5122 states and 9562 transitions. [2024-10-11 04:25:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:25:12,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:12,989 INFO L225 Difference]: With dead ends: 5122 [2024-10-11 04:25:12,989 INFO L226 Difference]: Without dead ends: 2630 [2024-10-11 04:25:13,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:25:13,004 INFO L432 NwaCegarLoop]: 4276 mSDtfsCounter, 1048 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 16502 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:13,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 16502 Invalid, 1206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:25:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-11 04:25:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-11 04:25:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.8354378818737271) internal successors, (4506), 2457 states have internal predecessors, (4506), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 04:25:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4560 transitions. [2024-10-11 04:25:13,176 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4560 transitions. Word has length 171 [2024-10-11 04:25:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:13,176 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4560 transitions. [2024-10-11 04:25:13,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:25:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4560 transitions. [2024-10-11 04:25:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:13,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:13,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:13,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:25:13,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1643094259, now seen corresponding path program 1 times [2024-10-11 04:25:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:13,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829193266] [2024-10-11 04:25:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,481 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:25:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829193266] [2024-10-11 04:25:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829193266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:13,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:13,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:25:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349440320] [2024-10-11 04:25:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:13,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:25:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:25:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:25:13,493 INFO L87 Difference]: Start difference. First operand 2490 states and 4560 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:25:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:15,618 INFO L93 Difference]: Finished difference Result 2984 states and 5386 transitions. [2024-10-11 04:25:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:25:15,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:15,633 INFO L225 Difference]: With dead ends: 2984 [2024-10-11 04:25:15,633 INFO L226 Difference]: Without dead ends: 2630 [2024-10-11 04:25:15,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:25:15,638 INFO L432 NwaCegarLoop]: 4272 mSDtfsCounter, 1036 mSDsluCounter, 12217 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 16489 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:15,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 16489 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:25:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-11 04:25:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-11 04:25:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.835030549898167) internal successors, (4505), 2457 states have internal predecessors, (4505), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 04:25:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4559 transitions. [2024-10-11 04:25:15,722 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4559 transitions. Word has length 171 [2024-10-11 04:25:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:15,723 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4559 transitions. [2024-10-11 04:25:15,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:25:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4559 transitions. [2024-10-11 04:25:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:15,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:15,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:15,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:25:15,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:15,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1031825201, now seen corresponding path program 1 times [2024-10-11 04:25:15,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279752200] [2024-10-11 04:25:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:16,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:16,202 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:25:16,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:16,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279752200] [2024-10-11 04:25:16,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279752200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:16,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:16,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:25:16,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366461706] [2024-10-11 04:25:16,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:16,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:25:16,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:16,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:25:16,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:25:16,206 INFO L87 Difference]: Start difference. First operand 2490 states and 4559 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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:25:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:19,446 INFO L93 Difference]: Finished difference Result 3491 states and 6239 transitions. [2024-10-11 04:25:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:25:19,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:19,470 INFO L225 Difference]: With dead ends: 3491 [2024-10-11 04:25:19,470 INFO L226 Difference]: Without dead ends: 3141 [2024-10-11 04:25:19,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:25:19,476 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 5542 mSDsluCounter, 12708 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 16946 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:19,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 16946 Invalid, 2578 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:25:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-10-11 04:25:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2862. [2024-10-11 04:25:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2798 states have (on average 1.812723373838456) internal successors, (5072), 2801 states have internal predecessors, (5072), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-11 04:25:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 5173 transitions. [2024-10-11 04:25:19,584 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 5173 transitions. Word has length 171 [2024-10-11 04:25:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:19,584 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 5173 transitions. [2024-10-11 04:25:19,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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:25:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 5173 transitions. [2024-10-11 04:25:19,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:19,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:19,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:19,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:25:19,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:19,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:19,588 INFO L85 PathProgramCache]: Analyzing trace with hash 247523539, now seen corresponding path program 1 times [2024-10-11 04:25:19,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213783035] [2024-10-11 04:25:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,024 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:25:20,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213783035] [2024-10-11 04:25:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213783035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:20,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:20,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293682478] [2024-10-11 04:25:20,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:20,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:20,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:20,028 INFO L87 Difference]: Start difference. First operand 2862 states and 5173 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:24,231 INFO L93 Difference]: Finished difference Result 4396 states and 7749 transitions. [2024-10-11 04:25:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:24,252 INFO L225 Difference]: With dead ends: 4396 [2024-10-11 04:25:24,252 INFO L226 Difference]: Without dead ends: 3674 [2024-10-11 04:25:24,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:25:24,258 INFO L432 NwaCegarLoop]: 4449 mSDtfsCounter, 5591 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3997 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5611 SdHoareTripleChecker+Valid, 21912 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:24,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5611 Valid, 21912 Invalid, 4060 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3997 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 04:25:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2024-10-11 04:25:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3205. [2024-10-11 04:25:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7933804627249357) internal successors, (5581), 3116 states have internal predecessors, (5581), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-11 04:25:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5728 transitions. [2024-10-11 04:25:24,520 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5728 transitions. Word has length 171 [2024-10-11 04:25:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:24,521 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5728 transitions. [2024-10-11 04:25:24,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5728 transitions. [2024-10-11 04:25:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:24,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:24,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:24,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:25:24,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:24,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash -17123951, now seen corresponding path program 1 times [2024-10-11 04:25:24,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:24,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98496002] [2024-10-11 04:25:24,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:24,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,929 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:25:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98496002] [2024-10-11 04:25:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98496002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:24,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:24,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133276165] [2024-10-11 04:25:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:24,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:24,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:24,936 INFO L87 Difference]: Start difference. First operand 3205 states and 5728 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:27,317 INFO L93 Difference]: Finished difference Result 4759 states and 8350 transitions. [2024-10-11 04:25:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:25:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:27,336 INFO L225 Difference]: With dead ends: 4759 [2024-10-11 04:25:27,337 INFO L226 Difference]: Without dead ends: 3694 [2024-10-11 04:25:27,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:25:27,344 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5115 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5136 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:27,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5136 Valid, 20880 Invalid, 2114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:25:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2024-10-11 04:25:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3205. [2024-10-11 04:25:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7924164524421593) internal successors, (5578), 3116 states have internal predecessors, (5578), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-11 04:25:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5725 transitions. [2024-10-11 04:25:27,512 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5725 transitions. Word has length 171 [2024-10-11 04:25:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:27,513 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5725 transitions. [2024-10-11 04:25:27,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5725 transitions. [2024-10-11 04:25:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:27,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:27,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:27,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:25:27,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:27,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1340302897, now seen corresponding path program 1 times [2024-10-11 04:25:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960390317] [2024-10-11 04:25:27,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,876 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:25:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960390317] [2024-10-11 04:25:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960390317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831519832] [2024-10-11 04:25:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:27,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:27,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:27,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:27,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:27,882 INFO L87 Difference]: Start difference. First operand 3205 states and 5725 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:29,983 INFO L93 Difference]: Finished difference Result 4755 states and 8333 transitions. [2024-10-11 04:25:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:25:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:30,004 INFO L225 Difference]: With dead ends: 4755 [2024-10-11 04:25:30,005 INFO L226 Difference]: Without dead ends: 3690 [2024-10-11 04:25:30,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:25:30,013 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5276 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5297 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:30,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5297 Valid, 16750 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:25:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2024-10-11 04:25:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3205. [2024-10-11 04:25:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.791452442159383) internal successors, (5575), 3116 states have internal predecessors, (5575), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-11 04:25:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5722 transitions. [2024-10-11 04:25:30,154 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5722 transitions. Word has length 171 [2024-10-11 04:25:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:30,154 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5722 transitions. [2024-10-11 04:25:30,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5722 transitions. [2024-10-11 04:25:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:30,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:30,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:30,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:25:30,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:30,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 556676561, now seen corresponding path program 1 times [2024-10-11 04:25:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551376219] [2024-10-11 04:25:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,479 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:25:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551376219] [2024-10-11 04:25:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551376219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:30,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37072754] [2024-10-11 04:25:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:30,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:30,481 INFO L87 Difference]: Start difference. First operand 3205 states and 5722 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:32,204 INFO L93 Difference]: Finished difference Result 4751 states and 8316 transitions. [2024-10-11 04:25:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:25:32,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:32,230 INFO L225 Difference]: With dead ends: 4751 [2024-10-11 04:25:32,231 INFO L226 Difference]: Without dead ends: 3686 [2024-10-11 04:25:32,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:25:32,238 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5274 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5295 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:32,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5295 Valid, 16750 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:25:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2024-10-11 04:25:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3205. [2024-10-11 04:25:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7904884318766068) internal successors, (5572), 3116 states have internal predecessors, (5572), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-11 04:25:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5719 transitions. [2024-10-11 04:25:32,354 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5719 transitions. Word has length 171 [2024-10-11 04:25:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:32,358 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5719 transitions. [2024-10-11 04:25:32,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5719 transitions. [2024-10-11 04:25:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:32,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:32,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:32,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:25:32,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 894964111, now seen corresponding path program 1 times [2024-10-11 04:25:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176552199] [2024-10-11 04:25:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:32,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:32,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:32,682 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:25:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176552199] [2024-10-11 04:25:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176552199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:32,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886878746] [2024-10-11 04:25:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:32,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:32,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:32,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:32,686 INFO L87 Difference]: Start difference. First operand 3205 states and 5719 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:36,262 INFO L93 Difference]: Finished difference Result 5709 states and 9880 transitions. [2024-10-11 04:25:36,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:36,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:36,283 INFO L225 Difference]: With dead ends: 5709 [2024-10-11 04:25:36,284 INFO L226 Difference]: Without dead ends: 4644 [2024-10-11 04:25:36,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:25:36,291 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 5674 mSDsluCounter, 16920 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5694 SdHoareTripleChecker+Valid, 21167 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:36,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5694 Valid, 21167 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:25:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2024-10-11 04:25:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 3904. [2024-10-11 04:25:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7593924860111911) internal successors, (6603), 3759 states have internal predecessors, (6603), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-11 04:25:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6846 transitions. [2024-10-11 04:25:36,492 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6846 transitions. Word has length 171 [2024-10-11 04:25:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:36,495 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6846 transitions. [2024-10-11 04:25:36,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6846 transitions. [2024-10-11 04:25:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:36,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:36,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:36,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:25:36,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:36,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1321518609, now seen corresponding path program 1 times [2024-10-11 04:25:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:36,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102348788] [2024-10-11 04:25:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:36,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:36,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:36,846 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:25:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102348788] [2024-10-11 04:25:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102348788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:36,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:36,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72921007] [2024-10-11 04:25:36,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:36,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:36,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:36,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:36,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:36,848 INFO L87 Difference]: Start difference. First operand 3904 states and 6846 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:38,611 INFO L93 Difference]: Finished difference Result 6395 states and 10995 transitions. [2024-10-11 04:25:38,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:25:38,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:38,630 INFO L225 Difference]: With dead ends: 6395 [2024-10-11 04:25:38,630 INFO L226 Difference]: Without dead ends: 4631 [2024-10-11 04:25:38,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:25:38,639 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5273 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:38,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 16750 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:25:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-11 04:25:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3904. [2024-10-11 04:25:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7580602184918732) internal successors, (6598), 3759 states have internal predecessors, (6598), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-11 04:25:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6841 transitions. [2024-10-11 04:25:38,809 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6841 transitions. Word has length 171 [2024-10-11 04:25:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:38,810 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6841 transitions. [2024-10-11 04:25:38,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6841 transitions. [2024-10-11 04:25:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:38,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:38,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:38,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:25:38,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:38,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash 781089103, now seen corresponding path program 1 times [2024-10-11 04:25:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:38,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374596452] [2024-10-11 04:25:38,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:39,120 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:25:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374596452] [2024-10-11 04:25:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374596452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:39,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:39,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208005858] [2024-10-11 04:25:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:39,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:39,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:39,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:39,122 INFO L87 Difference]: Start difference. First operand 3904 states and 6841 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:43,122 INFO L93 Difference]: Finished difference Result 8250 states and 14007 transitions. [2024-10-11 04:25:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:43,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:43,145 INFO L225 Difference]: With dead ends: 8250 [2024-10-11 04:25:43,146 INFO L226 Difference]: Without dead ends: 6486 [2024-10-11 04:25:43,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:25:43,154 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5556 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5576 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:43,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5576 Valid, 21910 Invalid, 3928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 04:25:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2024-10-11 04:25:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5302. [2024-10-11 04:25:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5302 states, 5035 states have (on average 1.717974180734856) internal successors, (8650), 5045 states have internal predecessors, (8650), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-11 04:25:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 9091 transitions. [2024-10-11 04:25:43,409 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 9091 transitions. Word has length 171 [2024-10-11 04:25:43,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:43,410 INFO L471 AbstractCegarLoop]: Abstraction has 5302 states and 9091 transitions. [2024-10-11 04:25:43,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 9091 transitions. [2024-10-11 04:25:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:43,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:43,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:43,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:25:43,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:43,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash 625108561, now seen corresponding path program 1 times [2024-10-11 04:25:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404167119] [2024-10-11 04:25:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,711 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:25:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:43,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404167119] [2024-10-11 04:25:43,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404167119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:43,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:43,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:43,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945448499] [2024-10-11 04:25:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:43,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:43,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:43,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:43,714 INFO L87 Difference]: Start difference. First operand 5302 states and 9091 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:47,777 INFO L93 Difference]: Finished difference Result 13338 states and 22315 transitions. [2024-10-11 04:25:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:47,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:47,819 INFO L225 Difference]: With dead ends: 13338 [2024-10-11 04:25:47,819 INFO L226 Difference]: Without dead ends: 10176 [2024-10-11 04:25:47,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:25:47,836 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5561 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5581 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:47,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5581 Valid, 21910 Invalid, 3910 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:25:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10176 states. [2024-10-11 04:25:48,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10176 to 8103. [2024-10-11 04:25:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6780641767490794) internal successors, (12760), 7622 states have internal predecessors, (12760), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-11 04:25:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13615 transitions. [2024-10-11 04:25:48,299 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13615 transitions. Word has length 171 [2024-10-11 04:25:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:48,299 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13615 transitions. [2024-10-11 04:25:48,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13615 transitions. [2024-10-11 04:25:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:48,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:48,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:48,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:25:48,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:48,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1035718927, now seen corresponding path program 1 times [2024-10-11 04:25:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:48,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431289820] [2024-10-11 04:25:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,585 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:25:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431289820] [2024-10-11 04:25:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431289820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:48,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144652034] [2024-10-11 04:25:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:48,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:48,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:48,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:48,587 INFO L87 Difference]: Start difference. First operand 8103 states and 13615 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:50,518 INFO L93 Difference]: Finished difference Result 16213 states and 27056 transitions. [2024-10-11 04:25:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:25:50,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:50,557 INFO L225 Difference]: With dead ends: 16213 [2024-10-11 04:25:50,557 INFO L226 Difference]: Without dead ends: 10250 [2024-10-11 04:25:50,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:25:50,580 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5277 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5298 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:50,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5298 Valid, 16750 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:25:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10250 states. [2024-10-11 04:25:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10250 to 8103. [2024-10-11 04:25:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.675828511309837) internal successors, (12743), 7622 states have internal predecessors, (12743), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-11 04:25:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13598 transitions. [2024-10-11 04:25:51,016 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13598 transitions. Word has length 171 [2024-10-11 04:25:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:51,018 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13598 transitions. [2024-10-11 04:25:51,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13598 transitions. [2024-10-11 04:25:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:51,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:51,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:25:51,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:51,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1100164275, now seen corresponding path program 1 times [2024-10-11 04:25:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880766879] [2024-10-11 04:25:51,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:51,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:51,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:51,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:51,275 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:25:51,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:51,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880766879] [2024-10-11 04:25:51,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880766879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:51,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:51,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940095590] [2024-10-11 04:25:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:51,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:51,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:51,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:51,279 INFO L87 Difference]: Start difference. First operand 8103 states and 13598 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:53,622 INFO L93 Difference]: Finished difference Result 16195 states and 26969 transitions. [2024-10-11 04:25:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:25:53,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:53,664 INFO L225 Difference]: With dead ends: 16195 [2024-10-11 04:25:53,664 INFO L226 Difference]: Without dead ends: 10232 [2024-10-11 04:25:53,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:25:53,691 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5112 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5133 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:53,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5133 Valid, 20880 Invalid, 1991 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:25:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10232 states. [2024-10-11 04:25:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10232 to 8103. [2024-10-11 04:25:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6735928458705944) internal successors, (12726), 7622 states have internal predecessors, (12726), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-11 04:25:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13581 transitions. [2024-10-11 04:25:54,344 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13581 transitions. Word has length 171 [2024-10-11 04:25:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:54,344 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13581 transitions. [2024-10-11 04:25:54,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13581 transitions. [2024-10-11 04:25:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:25:54,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:54,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:25:54,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:25:54,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:54,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1030516401, now seen corresponding path program 1 times [2024-10-11 04:25:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:54,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402294864] [2024-10-11 04:25:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:54,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:54,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:25:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:25:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:54,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:25:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:25:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:54,626 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:25:54,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402294864] [2024-10-11 04:25:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402294864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:54,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:54,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:54,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589792115] [2024-10-11 04:25:54,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:54,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:54,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:54,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:54,628 INFO L87 Difference]: Start difference. First operand 8103 states and 13581 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:25:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:59,181 INFO L93 Difference]: Finished difference Result 23459 states and 38713 transitions. [2024-10-11 04:25:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:59,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:25:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:59,250 INFO L225 Difference]: With dead ends: 23459 [2024-10-11 04:25:59,251 INFO L226 Difference]: Without dead ends: 17496 [2024-10-11 04:25:59,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:25:59,277 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5542 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:59,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 21910 Invalid, 3833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:25:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17496 states. [2024-10-11 04:26:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17496 to 13771. [2024-10-11 04:26:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13771 states, 12808 states have (on average 1.6400687070580886) internal successors, (21006), 12842 states have internal predecessors, (21006), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-11 04:26:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13771 states to 13771 states and 22743 transitions. [2024-10-11 04:26:00,182 INFO L78 Accepts]: Start accepts. Automaton has 13771 states and 22743 transitions. Word has length 171 [2024-10-11 04:26:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:26:00,182 INFO L471 AbstractCegarLoop]: Abstraction has 13771 states and 22743 transitions. [2024-10-11 04:26:00,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:26:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13771 states and 22743 transitions. [2024-10-11 04:26:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 04:26:00,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:26:00,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:26:00,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:26:00,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:26:00,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:26:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash -612627699, now seen corresponding path program 1 times [2024-10-11 04:26:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:26:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928944245] [2024-10-11 04:26:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:26:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:26:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:00,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:26:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 04:26:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:00,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 04:26:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:00,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 04:26:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:00,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 04:26:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:26:00,483 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:26:00,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:26:00,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928944245] [2024-10-11 04:26:00,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928944245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:26:00,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:26:00,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:26:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025681435] [2024-10-11 04:26:00,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:26:00,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:26:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:26:00,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:26:00,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:26:00,487 INFO L87 Difference]: Start difference. First operand 13771 states and 22743 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:26:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:26:05,774 INFO L93 Difference]: Finished difference Result 49061 states and 80615 transitions. [2024-10-11 04:26:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:26:05,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-11 04:26:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted.