./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_label44+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.07.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c711e78fce30df46f5383f1c4f7f14d04991b46d5fa8feba742040345837246 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:18:22,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:18:22,801 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:18:22,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:18:22,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:18:22,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:18:22,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:18:22,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:18:22,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:18:22,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:18:22,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:18:22,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:18:22,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:18:22,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:18:22,838 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:18:22,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:18:22,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:18:22,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:18:22,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:18:22,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:18:22,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:18:22,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:18:22,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:18:22,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:18:22,845 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:18:22,845 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:18:22,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:18:22,846 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:18:22,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:18:22,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:18:22,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:18:22,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:18:22,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:18:22,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:18:22,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:18:22,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:18:22,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:18:22,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:18:22,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:18:22,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:18:22,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:18:22,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:18:22,852 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 -> 0c711e78fce30df46f5383f1c4f7f14d04991b46d5fa8feba742040345837246 [2024-10-11 04:18:23,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:18:23,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:18:23,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:18:23,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:18:23,097 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:18:23,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.07.cil-1.c [2024-10-11 04:18:24,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:18:24,990 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:18:24,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.07.cil-1.c [2024-10-11 04:18:25,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43fff234d/0da1b357018b4e7ca865417b02ef5c62/FLAG5ff5a4a6d [2024-10-11 04:18:25,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43fff234d/0da1b357018b4e7ca865417b02ef5c62 [2024-10-11 04:18:25,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:18:25,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:18:25,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:18:25,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:18:25,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:18:25,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:18:25" (1/1) ... [2024-10-11 04:18:25,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a03a127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:25, skipping insertion in model container [2024-10-11 04:18:25,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:18:25" (1/1) ... [2024-10-11 04:18:25,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:18:26,798 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_label44+token_ring.07.cil-1.c[377340,377353] [2024-10-11 04:18:26,826 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_label44+token_ring.07.cil-1.c[383339,383352] [2024-10-11 04:18:26,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:18:26,997 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:18:27,597 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_label44+token_ring.07.cil-1.c[377340,377353] [2024-10-11 04:18:27,603 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_label44+token_ring.07.cil-1.c[383339,383352] [2024-10-11 04:18:27,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:18:27,662 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:18:27,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27 WrapperNode [2024-10-11 04:18:27,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:18:27,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:18:27,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:18:27,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:18:27,671 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:18:27" (1/1) ... [2024-10-11 04:18:27,731 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:18:27" (1/1) ... [2024-10-11 04:18:28,058 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12933 [2024-10-11 04:18:28,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:18:28,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:18:28,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:18:28,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:18:28,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,202 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:18:28,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:18:28,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:18:28,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:18:28,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:18:28,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (1/1) ... [2024-10-11 04:18:28,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:18:28,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:18:28,595 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:18:28,597 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:18:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:18:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:18:28,634 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:18:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:18:28,635 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:18:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:18:28,636 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:18:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:18:28,636 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:18:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:18:28,636 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:18:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:18:28,636 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:18:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:18:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:18:28,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:18:28,752 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:18:28,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:18:35,384 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2024-10-11 04:18:35,385 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:18:35,493 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:18:35,494 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 04:18:35,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:18:35 BoogieIcfgContainer [2024-10-11 04:18:35,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:18:35,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:18:35,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:18:35,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:18:35,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:18:25" (1/3) ... [2024-10-11 04:18:35,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ced1a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:18:35, skipping insertion in model container [2024-10-11 04:18:35,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:27" (2/3) ... [2024-10-11 04:18:35,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ced1a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:18:35, skipping insertion in model container [2024-10-11 04:18:35,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:18:35" (3/3) ... [2024-10-11 04:18:35,508 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.07.cil-1.c [2024-10-11 04:18:35,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:18:35,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:18:35,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:18:35,644 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;@6ce40025, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:18:35,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:18:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 2356 states, 2326 states have (on average 1.880481513327601) internal successors, (4374), 2329 states have internal predecessors, (4374), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 04:18:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:35,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:35,668 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] [2024-10-11 04:18:35,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash -777767020, now seen corresponding path program 1 times [2024-10-11 04:18:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:35,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325222309] [2024-10-11 04:18:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:35,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:36,236 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:18:36,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:36,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325222309] [2024-10-11 04:18:36,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325222309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:36,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:18:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678172232] [2024-10-11 04:18:36,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:36,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:18:36,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:18:36,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:18:36,270 INFO L87 Difference]: Start difference. First operand has 2356 states, 2326 states have (on average 1.880481513327601) internal successors, (4374), 2329 states have internal predecessors, (4374), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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:18:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:37,468 INFO L93 Difference]: Finished difference Result 4782 states and 8954 transitions. [2024-10-11 04:18:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:18:37,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:37,501 INFO L225 Difference]: With dead ends: 4782 [2024-10-11 04:18:37,502 INFO L226 Difference]: Without dead ends: 2432 [2024-10-11 04:18:37,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:18:37,513 INFO L432 NwaCegarLoop]: 4162 mSDtfsCounter, 618 mSDsluCounter, 12094 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 16256 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:37,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 16256 Invalid, 726 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:18:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-10-11 04:18:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2352. [2024-10-11 04:18:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2323 states have (on average 1.8441670253981919) internal successors, (4284), 2325 states have internal predecessors, (4284), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 04:18:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 4326 transitions. [2024-10-11 04:18:37,662 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 4326 transitions. Word has length 111 [2024-10-11 04:18:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:37,662 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 4326 transitions. [2024-10-11 04:18:37,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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:18:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 4326 transitions. [2024-10-11 04:18:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:37,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:37,667 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] [2024-10-11 04:18:37,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:18:37,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:37,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1128636246, now seen corresponding path program 1 times [2024-10-11 04:18:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:37,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469684970] [2024-10-11 04:18:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:37,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:37,921 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:18:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:37,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469684970] [2024-10-11 04:18:37,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469684970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:37,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:37,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:18:37,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128645959] [2024-10-11 04:18:37,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:37,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:18:37,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:37,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:18:37,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:18:37,925 INFO L87 Difference]: Start difference. First operand 2352 states and 4326 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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:18:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:39,621 INFO L93 Difference]: Finished difference Result 2957 states and 5322 transitions. [2024-10-11 04:18:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:18:39,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:39,632 INFO L225 Difference]: With dead ends: 2957 [2024-10-11 04:18:39,633 INFO L226 Difference]: Without dead ends: 2739 [2024-10-11 04:18:39,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:18:39,636 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4889 mSDsluCounter, 12392 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 16529 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:39,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 16529 Invalid, 1541 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:18:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2024-10-11 04:18:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2580. [2024-10-11 04:18:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 2528 states have (on average 1.8263449367088607) internal successors, (4617), 2531 states have internal predecessors, (4617), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-11 04:18:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 4694 transitions. [2024-10-11 04:18:39,718 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 4694 transitions. Word has length 111 [2024-10-11 04:18:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:39,718 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 4694 transitions. [2024-10-11 04:18:39,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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:18:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 4694 transitions. [2024-10-11 04:18:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:39,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:39,721 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] [2024-10-11 04:18:39,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:18:39,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:39,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1887332390, now seen corresponding path program 1 times [2024-10-11 04:18:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:39,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958303932] [2024-10-11 04:18:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:39,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:39,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:39,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:39,925 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:18:39,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:39,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958303932] [2024-10-11 04:18:39,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958303932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:39,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:39,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827500560] [2024-10-11 04:18:39,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:39,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:39,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:39,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:39,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:39,929 INFO L87 Difference]: Start difference. First operand 2580 states and 4694 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:42,031 INFO L93 Difference]: Finished difference Result 3502 states and 6208 transitions. [2024-10-11 04:18:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:18:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:42,047 INFO L225 Difference]: With dead ends: 3502 [2024-10-11 04:18:42,047 INFO L226 Difference]: Without dead ends: 3056 [2024-10-11 04:18:42,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:18:42,051 INFO L432 NwaCegarLoop]: 4270 mSDtfsCounter, 4904 mSDsluCounter, 16836 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4918 SdHoareTripleChecker+Valid, 21106 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:42,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4918 Valid, 21106 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:18:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2024-10-11 04:18:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2791. [2024-10-11 04:18:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2716 states have (on average 1.8100147275405007) internal successors, (4916), 2720 states have internal predecessors, (4916), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-11 04:18:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 5027 transitions. [2024-10-11 04:18:42,144 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 5027 transitions. Word has length 111 [2024-10-11 04:18:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:42,145 INFO L471 AbstractCegarLoop]: Abstraction has 2791 states and 5027 transitions. [2024-10-11 04:18:42,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 5027 transitions. [2024-10-11 04:18:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:42,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:42,148 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] [2024-10-11 04:18:42,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:18:42,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:42,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:42,150 INFO L85 PathProgramCache]: Analyzing trace with hash 788659992, now seen corresponding path program 1 times [2024-10-11 04:18:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:42,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472791198] [2024-10-11 04:18:42,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:42,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:42,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:42,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:42,398 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:18:42,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:42,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472791198] [2024-10-11 04:18:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472791198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:42,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:42,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:42,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7114237] [2024-10-11 04:18:42,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:42,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:42,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:42,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:42,401 INFO L87 Difference]: Start difference. First operand 2791 states and 5027 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:44,406 INFO L93 Difference]: Finished difference Result 4300 states and 7499 transitions. [2024-10-11 04:18:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:18:44,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:44,418 INFO L225 Difference]: With dead ends: 4300 [2024-10-11 04:18:44,419 INFO L226 Difference]: Without dead ends: 3643 [2024-10-11 04:18:44,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:18:44,422 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 4902 mSDsluCounter, 16836 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4916 SdHoareTripleChecker+Valid, 21104 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:44,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4916 Valid, 21104 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:18:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2024-10-11 04:18:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3214. [2024-10-11 04:18:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7830585192369868) internal successors, (5515), 3099 states have internal predecessors, (5515), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:18:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5698 transitions. [2024-10-11 04:18:44,513 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5698 transitions. Word has length 111 [2024-10-11 04:18:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:44,513 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5698 transitions. [2024-10-11 04:18:44,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5698 transitions. [2024-10-11 04:18:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:44,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:44,515 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] [2024-10-11 04:18:44,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:18:44,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:44,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash -94848998, now seen corresponding path program 1 times [2024-10-11 04:18:44,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:44,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663708213] [2024-10-11 04:18:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:44,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:44,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:44,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:44,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:44,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:44,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:44,683 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:18:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663708213] [2024-10-11 04:18:44,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663708213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:44,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:44,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226604524] [2024-10-11 04:18:44,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:44,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:44,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:44,688 INFO L87 Difference]: Start difference. First operand 3214 states and 5698 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:45,712 INFO L93 Difference]: Finished difference Result 4713 states and 8163 transitions. [2024-10-11 04:18:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:18:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:45,724 INFO L225 Difference]: With dead ends: 4713 [2024-10-11 04:18:45,724 INFO L226 Difference]: Without dead ends: 3633 [2024-10-11 04:18:45,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:18:45,728 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4645 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4660 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:45,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4660 Valid, 20458 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:18:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2024-10-11 04:18:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3214. [2024-10-11 04:18:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7814419657290657) internal successors, (5510), 3099 states have internal predecessors, (5510), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:18:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5693 transitions. [2024-10-11 04:18:45,811 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5693 transitions. Word has length 111 [2024-10-11 04:18:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:45,811 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5693 transitions. [2024-10-11 04:18:45,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5693 transitions. [2024-10-11 04:18:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:45,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:45,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] [2024-10-11 04:18:45,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:18:45,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash -123349288, now seen corresponding path program 1 times [2024-10-11 04:18:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:45,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774889942] [2024-10-11 04:18:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:45,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:45,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:45,991 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:18:45,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774889942] [2024-10-11 04:18:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774889942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:45,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:45,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:45,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75658864] [2024-10-11 04:18:45,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:45,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:45,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:45,997 INFO L87 Difference]: Start difference. First operand 3214 states and 5693 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:46,883 INFO L93 Difference]: Finished difference Result 4707 states and 8137 transitions. [2024-10-11 04:18:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:18:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:46,896 INFO L225 Difference]: With dead ends: 4707 [2024-10-11 04:18:46,897 INFO L226 Difference]: Without dead ends: 3627 [2024-10-11 04:18:46,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:18:46,901 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4740 mSDsluCounter, 12269 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4755 SdHoareTripleChecker+Valid, 16393 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:46,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4755 Valid, 16393 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:18:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2024-10-11 04:18:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3214. [2024-10-11 04:18:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7798254122211445) internal successors, (5505), 3099 states have internal predecessors, (5505), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:18:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5688 transitions. [2024-10-11 04:18:47,019 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5688 transitions. Word has length 111 [2024-10-11 04:18:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:47,019 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5688 transitions. [2024-10-11 04:18:47,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5688 transitions. [2024-10-11 04:18:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:47,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:47,021 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] [2024-10-11 04:18:47,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:18:47,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:47,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2063931302, now seen corresponding path program 1 times [2024-10-11 04:18:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:47,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736867809] [2024-10-11 04:18:47,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:47,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:47,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:47,234 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:18:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736867809] [2024-10-11 04:18:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736867809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:47,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883821385] [2024-10-11 04:18:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:47,239 INFO L87 Difference]: Start difference. First operand 3214 states and 5688 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:48,162 INFO L93 Difference]: Finished difference Result 4700 states and 8109 transitions. [2024-10-11 04:18:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:18:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:48,181 INFO L225 Difference]: With dead ends: 4700 [2024-10-11 04:18:48,182 INFO L226 Difference]: Without dead ends: 3620 [2024-10-11 04:18:48,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:18:48,190 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4646 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:48,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 20458 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:18:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2024-10-11 04:18:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3214. [2024-10-11 04:18:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7782088587132234) internal successors, (5500), 3099 states have internal predecessors, (5500), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:18:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5683 transitions. [2024-10-11 04:18:48,286 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5683 transitions. Word has length 111 [2024-10-11 04:18:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:48,286 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5683 transitions. [2024-10-11 04:18:48,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5683 transitions. [2024-10-11 04:18:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:48,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:48,290 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] [2024-10-11 04:18:48,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:18:48,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash -186868072, now seen corresponding path program 1 times [2024-10-11 04:18:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:48,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357948759] [2024-10-11 04:18:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:48,451 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:18:48,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:48,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357948759] [2024-10-11 04:18:48,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357948759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:48,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:48,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385658270] [2024-10-11 04:18:48,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:48,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:48,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:48,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:48,454 INFO L87 Difference]: Start difference. First operand 3214 states and 5683 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:49,356 INFO L93 Difference]: Finished difference Result 4688 states and 8071 transitions. [2024-10-11 04:18:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:18:49,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:49,381 INFO L225 Difference]: With dead ends: 4688 [2024-10-11 04:18:49,386 INFO L226 Difference]: Without dead ends: 3608 [2024-10-11 04:18:49,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:18:49,391 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4643 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4658 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:49,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4658 Valid, 20458 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:18:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2024-10-11 04:18:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3214. [2024-10-11 04:18:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7765923052053023) internal successors, (5495), 3099 states have internal predecessors, (5495), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:18:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5678 transitions. [2024-10-11 04:18:49,473 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5678 transitions. Word has length 111 [2024-10-11 04:18:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:49,474 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5678 transitions. [2024-10-11 04:18:49,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5678 transitions. [2024-10-11 04:18:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:49,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:49,476 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] [2024-10-11 04:18:49,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:18:49,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:49,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1181561770, now seen corresponding path program 1 times [2024-10-11 04:18:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:49,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891711677] [2024-10-11 04:18:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:49,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:49,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:49,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:49,688 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:18:49,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891711677] [2024-10-11 04:18:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891711677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:49,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:49,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:49,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755965697] [2024-10-11 04:18:49,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:49,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:49,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:49,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:49,689 INFO L87 Difference]: Start difference. First operand 3214 states and 5678 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:52,109 INFO L93 Difference]: Finished difference Result 6166 states and 10402 transitions. [2024-10-11 04:18:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:18:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:52,123 INFO L225 Difference]: With dead ends: 6166 [2024-10-11 04:18:52,123 INFO L226 Difference]: Without dead ends: 5086 [2024-10-11 04:18:52,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:18:52,128 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5132 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5154 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:52,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5154 Valid, 21097 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:18:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2024-10-11 04:18:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 4075. [2024-10-11 04:18:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 3866 states have (on average 1.734092084842214) internal successors, (6704), 3876 states have internal predecessors, (6704), 145 states have call successors, (145), 54 states have call predecessors, (145), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-11 04:18:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 7029 transitions. [2024-10-11 04:18:52,333 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 7029 transitions. Word has length 111 [2024-10-11 04:18:52,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:52,333 INFO L471 AbstractCegarLoop]: Abstraction has 4075 states and 7029 transitions. [2024-10-11 04:18:52,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 7029 transitions. [2024-10-11 04:18:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:52,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:52,336 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] [2024-10-11 04:18:52,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:18:52,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:52,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1767837992, now seen corresponding path program 1 times [2024-10-11 04:18:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:52,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779310234] [2024-10-11 04:18:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,502 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:18:52,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:52,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779310234] [2024-10-11 04:18:52,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779310234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:52,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:52,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:52,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017306955] [2024-10-11 04:18:52,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:52,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:52,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:52,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:52,504 INFO L87 Difference]: Start difference. First operand 4075 states and 7029 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:55,082 INFO L93 Difference]: Finished difference Result 9483 states and 15673 transitions. [2024-10-11 04:18:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:18:55,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:55,108 INFO L225 Difference]: With dead ends: 9483 [2024-10-11 04:18:55,108 INFO L226 Difference]: Without dead ends: 7542 [2024-10-11 04:18:55,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:18:55,118 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4927 mSDsluCounter, 16828 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4940 SdHoareTripleChecker+Valid, 21093 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:55,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4940 Valid, 21093 Invalid, 2667 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:18:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7542 states. [2024-10-11 04:18:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7542 to 5746. [2024-10-11 04:18:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 5365 states have (on average 1.6857409133271202) internal successors, (9044), 5383 states have internal predecessors, (9044), 261 states have call successors, (261), 102 states have call predecessors, (261), 118 states have return successors, (358), 276 states have call predecessors, (358), 261 states have call successors, (358) [2024-10-11 04:18:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 9663 transitions. [2024-10-11 04:18:55,562 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 9663 transitions. Word has length 111 [2024-10-11 04:18:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:55,562 INFO L471 AbstractCegarLoop]: Abstraction has 5746 states and 9663 transitions. [2024-10-11 04:18:55,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 9663 transitions. [2024-10-11 04:18:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:55,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:55,566 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] [2024-10-11 04:18:55,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:18:55,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:55,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash 568554518, now seen corresponding path program 1 times [2024-10-11 04:18:55,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:55,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601972557] [2024-10-11 04:18:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:55,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:55,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:55,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:55,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:55,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:55,774 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:18:55,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:55,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601972557] [2024-10-11 04:18:55,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601972557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:55,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:55,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:55,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711033330] [2024-10-11 04:18:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:55,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:55,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:55,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:55,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:55,776 INFO L87 Difference]: Start difference. First operand 5746 states and 9663 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:58,106 INFO L93 Difference]: Finished difference Result 15876 states and 25869 transitions. [2024-10-11 04:18:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:18:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:18:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:58,140 INFO L225 Difference]: With dead ends: 15876 [2024-10-11 04:18:58,141 INFO L226 Difference]: Without dead ends: 12264 [2024-10-11 04:18:58,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:18:58,156 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5060 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:58,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 21097 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:18:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2024-10-11 04:18:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 9127. [2024-10-11 04:18:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9127 states, 8410 states have (on average 1.641141498216409) internal successors, (13802), 8444 states have internal predecessors, (13802), 485 states have call successors, (485), 198 states have call predecessors, (485), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-11 04:18:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9127 states to 9127 states and 15047 transitions. [2024-10-11 04:18:58,757 INFO L78 Accepts]: Start accepts. Automaton has 9127 states and 15047 transitions. Word has length 111 [2024-10-11 04:18:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:58,758 INFO L471 AbstractCegarLoop]: Abstraction has 9127 states and 15047 transitions. [2024-10-11 04:18:58,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:18:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 9127 states and 15047 transitions. [2024-10-11 04:18:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:18:58,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:58,763 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] [2024-10-11 04:18:58,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:18:58,763 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:58,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1849929960, now seen corresponding path program 1 times [2024-10-11 04:18:58,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:58,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106119136] [2024-10-11 04:18:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:58,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:18:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:18:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:58,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:18:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:58,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:18:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:58,888 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:18:58,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:58,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106119136] [2024-10-11 04:18:58,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106119136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:58,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:58,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:58,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092108943] [2024-10-11 04:18:58,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:58,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:58,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:58,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:58,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:58,890 INFO L87 Difference]: Start difference. First operand 9127 states and 15047 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:19:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:01,578 INFO L93 Difference]: Finished difference Result 28527 states and 46239 transitions. [2024-10-11 04:19:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:19:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:01,641 INFO L225 Difference]: With dead ends: 28527 [2024-10-11 04:19:01,642 INFO L226 Difference]: Without dead ends: 21534 [2024-10-11 04:19:01,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:01,670 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5024 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5046 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:01,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 21097 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:19:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21534 states. [2024-10-11 04:19:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21534 to 15888. [2024-10-11 04:19:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15888 states, 14515 states have (on average 1.608542886668963) internal successors, (23348), 14581 states have internal predecessors, (23348), 917 states have call successors, (917), 390 states have call predecessors, (917), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-11 04:19:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15888 states to 15888 states and 25975 transitions. [2024-10-11 04:19:02,647 INFO L78 Accepts]: Start accepts. Automaton has 15888 states and 25975 transitions. Word has length 111 [2024-10-11 04:19:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:02,647 INFO L471 AbstractCegarLoop]: Abstraction has 15888 states and 25975 transitions. [2024-10-11 04:19:02,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:19:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15888 states and 25975 transitions. [2024-10-11 04:19:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:19:02,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:02,657 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] [2024-10-11 04:19:02,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:19:02,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:02,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 565906390, now seen corresponding path program 1 times [2024-10-11 04:19:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:02,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257996449] [2024-10-11 04:19:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:02,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:19:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:02,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:19:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:19:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:19:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:02,793 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:19:02,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:02,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257996449] [2024-10-11 04:19:02,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257996449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:02,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:02,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202702525] [2024-10-11 04:19:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:02,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:02,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:02,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:02,795 INFO L87 Difference]: Start difference. First operand 15888 states and 25975 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:19:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:06,903 INFO L93 Difference]: Finished difference Result 53350 states and 86797 transitions. [2024-10-11 04:19:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:06,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:19:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:07,095 INFO L225 Difference]: With dead ends: 53350 [2024-10-11 04:19:07,095 INFO L226 Difference]: Without dead ends: 39596 [2024-10-11 04:19:07,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:07,128 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4898 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4911 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:07,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4911 Valid, 21097 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:19:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39596 states. [2024-10-11 04:19:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39596 to 29409. [2024-10-11 04:19:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29409 states, 26756 states have (on average 1.5885035132306773) internal successors, (42502), 26886 states have internal predecessors, (42502), 1749 states have call successors, (1749), 774 states have call predecessors, (1749), 902 states have return successors, (4064), 1876 states have call predecessors, (4064), 1749 states have call successors, (4064) [2024-10-11 04:19:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29409 states to 29409 states and 48315 transitions. [2024-10-11 04:19:08,773 INFO L78 Accepts]: Start accepts. Automaton has 29409 states and 48315 transitions. Word has length 111 [2024-10-11 04:19:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:08,774 INFO L471 AbstractCegarLoop]: Abstraction has 29409 states and 48315 transitions. [2024-10-11 04:19:08,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:19:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 29409 states and 48315 transitions. [2024-10-11 04:19:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:19:08,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:08,790 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] [2024-10-11 04:19:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:19:08,791 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:08,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1890762584, now seen corresponding path program 1 times [2024-10-11 04:19:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139515935] [2024-10-11 04:19:08,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:19:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:19:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:19:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:19:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:08,923 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:19:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:08,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139515935] [2024-10-11 04:19:08,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139515935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:08,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:08,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452175448] [2024-10-11 04:19:08,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:08,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:08,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:08,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:08,925 INFO L87 Difference]: Start difference. First operand 29409 states and 48315 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:19:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:14,434 INFO L93 Difference]: Finished difference Result 102037 states and 168195 transitions. [2024-10-11 04:19:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-11 04:19:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:14,656 INFO L225 Difference]: With dead ends: 102037 [2024-10-11 04:19:14,656 INFO L226 Difference]: Without dead ends: 74762 [2024-10-11 04:19:14,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:14,728 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4958 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4980 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:14,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4980 Valid, 21097 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:19:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2024-10-11 04:19:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 56450. [2024-10-11 04:19:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56450 states, 51301 states have (on average 1.57766905128555) internal successors, (80936), 51559 states have internal predecessors, (80936), 3349 states have call successors, (3349), 1542 states have call predecessors, (3349), 1798 states have return successors, (10166), 3604 states have call predecessors, (10166), 3349 states have call successors, (10166) [2024-10-11 04:19:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56450 states to 56450 states and 94451 transitions. [2024-10-11 04:19:19,426 INFO L78 Accepts]: Start accepts. Automaton has 56450 states and 94451 transitions. Word has length 111 [2024-10-11 04:19:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:19,427 INFO L471 AbstractCegarLoop]: Abstraction has 56450 states and 94451 transitions. [2024-10-11 04:19:19,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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:19:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 56450 states and 94451 transitions. [2024-10-11 04:19:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 04:19:19,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:19,458 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] [2024-10-11 04:19:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:19:19,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:19,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -837446762, now seen corresponding path program 1 times [2024-10-11 04:19:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608736115] [2024-10-11 04:19:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:19,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:19:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:19,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:19:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:19:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:19,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:19:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:19,627 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:19:19,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:19,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608736115] [2024-10-11 04:19:19,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608736115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:19,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:19,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:19,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178779757] [2024-10-11 04:19:19,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:19,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:19,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:19,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:19,629 INFO L87 Difference]: Start difference. First operand 56450 states and 94451 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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)