./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_label42+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e8eec1743df688e821561fda517f1945d9b8e3e5029879578d4191f60280f1b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:13:24,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:13:24,252 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:13:24,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:13:24,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:13:24,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:13:24,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:13:24,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:13:24,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:13:24,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:13:24,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:13:24,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:13:24,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:13:24,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:13:24,276 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:13:24,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:13:24,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:13:24,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:13:24,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:13:24,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:13:24,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:13:24,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:13:24,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:13:24,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:13:24,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:13:24,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:13:24,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:13:24,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:13:24,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:13:24,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:13:24,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:13:24,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:13:24,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:13:24,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:13:24,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:13:24,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:13:24,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:13:24,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:13:24,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:13:24,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:13:24,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:13:24,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:13:24,290 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 -> 9e8eec1743df688e821561fda517f1945d9b8e3e5029879578d4191f60280f1b [2024-10-11 04:13:24,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:13:24,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:13:24,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:13:24,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:13:24,511 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:13:24,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c [2024-10-11 04:13:26,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:13:26,618 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:13:26,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c [2024-10-11 04:13:26,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/99ab439d7/5b33b692fbbd42c8a1ac807a7034a1f0/FLAG8483e0233 [2024-10-11 04:13:27,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/99ab439d7/5b33b692fbbd42c8a1ac807a7034a1f0 [2024-10-11 04:13:27,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:13:27,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:13:27,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:13:27,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:13:27,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:13:27,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:13:27" (1/1) ... [2024-10-11 04:13:27,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30216a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:27, skipping insertion in model container [2024-10-11 04:13:27,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:13:27" (1/1) ... [2024-10-11 04:13:27,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:13:28,746 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_label42+token_ring.04.cil-1.c[378560,378573] [2024-10-11 04:13:28,781 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_label42+token_ring.04.cil-1.c[383339,383352] [2024-10-11 04:13:29,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:13:29,059 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:13:29,801 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_label42+token_ring.04.cil-1.c[378560,378573] [2024-10-11 04:13:29,809 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_label42+token_ring.04.cil-1.c[383339,383352] [2024-10-11 04:13:29,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:13:29,891 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:13:29,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29 WrapperNode [2024-10-11 04:13:29,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:13:29,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:13:29,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:13:29,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:13:29,902 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:13:29" (1/1) ... [2024-10-11 04:13:30,046 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:13:29" (1/1) ... [2024-10-11 04:13:30,487 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12753 [2024-10-11 04:13:30,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:13:30,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:13:30,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:13:30,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:13:30,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:30,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:30,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:30,790 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:13:30,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:30,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:30,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:31,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:31,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:31,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:31,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:13:31,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:13:31,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:13:31,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:13:31,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (1/1) ... [2024-10-11 04:13:31,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:13:31,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:13:31,157 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:13:31,167 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:13:31,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:13:31,248 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:13:31,249 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:13:31,249 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:13:31,249 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:13:31,249 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:13:31,249 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:13:31,249 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:13:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:13:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:13:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:13:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:13:31,254 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:13:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:13:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:13:31,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:13:31,418 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:13:31,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:13:38,695 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2024-10-11 04:13:38,695 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:13:38,785 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:13:38,785 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 04:13:38,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:13:38 BoogieIcfgContainer [2024-10-11 04:13:38,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:13:38,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:13:38,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:13:38,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:13:38,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:13:27" (1/3) ... [2024-10-11 04:13:38,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41683d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:13:38, skipping insertion in model container [2024-10-11 04:13:38,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:29" (2/3) ... [2024-10-11 04:13:38,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41683d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:13:38, skipping insertion in model container [2024-10-11 04:13:38,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:13:38" (3/3) ... [2024-10-11 04:13:38,794 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.04.cil-1.c [2024-10-11 04:13:38,810 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:13:38,810 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:13:38,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:13:38,947 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;@43646fc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:13:38,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:13:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 2287 states, 2260 states have (on average 1.8836283185840708) internal successors, (4257), 2263 states have internal predecessors, (4257), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 04:13:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:38,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:38,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:38,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:38,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1377940007, now seen corresponding path program 1 times [2024-10-11 04:13:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710053560] [2024-10-11 04:13:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,681 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:13:39,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:39,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710053560] [2024-10-11 04:13:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710053560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:39,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:39,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:13:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781954706] [2024-10-11 04:13:39,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:39,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:13:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:13:39,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:13:39,713 INFO L87 Difference]: Start difference. First operand has 2287 states, 2260 states have (on average 1.8836283185840708) internal successors, (4257), 2263 states have internal predecessors, (4257), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:40,394 INFO L93 Difference]: Finished difference Result 4620 states and 8666 transitions. [2024-10-11 04:13:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:13:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:40,418 INFO L225 Difference]: With dead ends: 4620 [2024-10-11 04:13:40,418 INFO L226 Difference]: Without dead ends: 2333 [2024-10-11 04:13:40,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:13:40,430 INFO L432 NwaCegarLoop]: 4105 mSDtfsCounter, 411 mSDsluCounter, 12028 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 16133 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:40,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 16133 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:13:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2024-10-11 04:13:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2283. [2024-10-11 04:13:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2257 states have (on average 1.8489144882587505) internal successors, (4173), 2259 states have internal predecessors, (4173), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 04:13:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 4209 transitions. [2024-10-11 04:13:40,555 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 4209 transitions. Word has length 81 [2024-10-11 04:13:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:40,555 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 4209 transitions. [2024-10-11 04:13:40,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 4209 transitions. [2024-10-11 04:13:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:40,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:40,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:40,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:13:40,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:40,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash 490717161, now seen corresponding path program 1 times [2024-10-11 04:13:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:40,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560184658] [2024-10-11 04:13:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:40,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:40,719 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:13:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:40,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560184658] [2024-10-11 04:13:40,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560184658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:40,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:40,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:13:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879923076] [2024-10-11 04:13:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:40,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:13:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:13:40,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:13:40,722 INFO L87 Difference]: Start difference. First operand 2283 states and 4209 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:42,169 INFO L93 Difference]: Finished difference Result 2690 states and 4863 transitions. [2024-10-11 04:13:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:13:42,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:42,195 INFO L225 Difference]: With dead ends: 2690 [2024-10-11 04:13:42,199 INFO L226 Difference]: Without dead ends: 2538 [2024-10-11 04:13:42,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:13:42,203 INFO L432 NwaCegarLoop]: 4086 mSDtfsCounter, 4562 mSDsluCounter, 12233 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4573 SdHoareTripleChecker+Valid, 16319 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:42,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4573 Valid, 16319 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:13:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2024-10-11 04:13:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2439. [2024-10-11 04:13:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2393 states have (on average 1.8340994567488509) internal successors, (4389), 2396 states have internal predecessors, (4389), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-11 04:13:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 4454 transitions. [2024-10-11 04:13:42,368 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 4454 transitions. Word has length 81 [2024-10-11 04:13:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:42,371 INFO L471 AbstractCegarLoop]: Abstraction has 2439 states and 4454 transitions. [2024-10-11 04:13:42,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 4454 transitions. [2024-10-11 04:13:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:42,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:42,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:42,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:13:42,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:42,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash -927081943, now seen corresponding path program 1 times [2024-10-11 04:13:42,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:42,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800088583] [2024-10-11 04:13:42,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:42,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:42,566 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:13:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800088583] [2024-10-11 04:13:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800088583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:42,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63828197] [2024-10-11 04:13:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:42,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:42,570 INFO L87 Difference]: Start difference. First operand 2439 states and 4454 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:44,043 INFO L93 Difference]: Finished difference Result 3055 states and 5437 transitions. [2024-10-11 04:13:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:44,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:44,057 INFO L225 Difference]: With dead ends: 3055 [2024-10-11 04:13:44,057 INFO L226 Difference]: Without dead ends: 2747 [2024-10-11 04:13:44,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:13:44,061 INFO L432 NwaCegarLoop]: 4180 mSDtfsCounter, 4567 mSDsluCounter, 16521 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 20701 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:44,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 20701 Invalid, 1595 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:13:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2024-10-11 04:13:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2584. [2024-10-11 04:13:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2518 states have (on average 1.8200953137410643) internal successors, (4583), 2522 states have internal predecessors, (4583), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-11 04:13:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4676 transitions. [2024-10-11 04:13:44,130 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 4676 transitions. Word has length 81 [2024-10-11 04:13:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:44,130 INFO L471 AbstractCegarLoop]: Abstraction has 2584 states and 4676 transitions. [2024-10-11 04:13:44,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 4676 transitions. [2024-10-11 04:13:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:44,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:44,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:44,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:13:44,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2143235669, now seen corresponding path program 1 times [2024-10-11 04:13:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:44,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133744081] [2024-10-11 04:13:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,442 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:13:44,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133744081] [2024-10-11 04:13:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133744081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:44,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:44,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:44,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371069602] [2024-10-11 04:13:44,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:44,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:44,449 INFO L87 Difference]: Start difference. First operand 2584 states and 4676 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:45,696 INFO L93 Difference]: Finished difference Result 3589 states and 6275 transitions. [2024-10-11 04:13:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:45,708 INFO L225 Difference]: With dead ends: 3589 [2024-10-11 04:13:45,708 INFO L226 Difference]: Without dead ends: 3136 [2024-10-11 04:13:45,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:13:45,711 INFO L432 NwaCegarLoop]: 4095 mSDtfsCounter, 4613 mSDsluCounter, 16302 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 20397 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:45,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 20397 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:13:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2024-10-11 04:13:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2875. [2024-10-11 04:13:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2769 states have (on average 1.795594077284218) internal successors, (4972), 2775 states have internal predecessors, (4972), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 04:13:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 5125 transitions. [2024-10-11 04:13:45,804 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 5125 transitions. Word has length 81 [2024-10-11 04:13:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:45,804 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 5125 transitions. [2024-10-11 04:13:45,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 5125 transitions. [2024-10-11 04:13:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:45,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:45,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:13:45,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:45,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1419764201, now seen corresponding path program 1 times [2024-10-11 04:13:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:45,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592681063] [2024-10-11 04:13:45,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,997 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:13:45,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:45,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592681063] [2024-10-11 04:13:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592681063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:45,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756879821] [2024-10-11 04:13:45,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:45,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:45,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:45,999 INFO L87 Difference]: Start difference. First operand 2875 states and 5125 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:47,018 INFO L93 Difference]: Finished difference Result 3870 states and 6717 transitions. [2024-10-11 04:13:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:13:47,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:47,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:47,032 INFO L225 Difference]: With dead ends: 3870 [2024-10-11 04:13:47,033 INFO L226 Difference]: Without dead ends: 3126 [2024-10-11 04:13:47,037 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:13:47,038 INFO L432 NwaCegarLoop]: 4073 mSDtfsCounter, 4416 mSDsluCounter, 16172 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 20245 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:47,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 20245 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:13:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2024-10-11 04:13:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2875. [2024-10-11 04:13:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2769 states have (on average 1.79378837125316) internal successors, (4967), 2775 states have internal predecessors, (4967), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 04:13:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 5120 transitions. [2024-10-11 04:13:47,164 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 5120 transitions. Word has length 81 [2024-10-11 04:13:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:47,166 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 5120 transitions. [2024-10-11 04:13:47,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 5120 transitions. [2024-10-11 04:13:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:47,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:47,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:47,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:13:47,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:47,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:47,169 INFO L85 PathProgramCache]: Analyzing trace with hash -266415637, now seen corresponding path program 1 times [2024-10-11 04:13:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:47,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236883948] [2024-10-11 04:13:47,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:47,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,367 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:13:47,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236883948] [2024-10-11 04:13:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236883948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:47,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723924837] [2024-10-11 04:13:47,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:47,369 INFO L87 Difference]: Start difference. First operand 2875 states and 5120 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:49,147 INFO L93 Difference]: Finished difference Result 4829 states and 8192 transitions. [2024-10-11 04:13:49,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:13:49,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:49,168 INFO L225 Difference]: With dead ends: 4829 [2024-10-11 04:13:49,168 INFO L226 Difference]: Without dead ends: 4085 [2024-10-11 04:13:49,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:13:49,175 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4711 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:49,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 20692 Invalid, 1536 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:13:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2024-10-11 04:13:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3459. [2024-10-11 04:13:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3277 states have (on average 1.7552639609398841) internal successors, (5752), 3287 states have internal predecessors, (5752), 118 states have call successors, (118), 54 states have call predecessors, (118), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-11 04:13:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 6023 transitions. [2024-10-11 04:13:49,358 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 6023 transitions. Word has length 81 [2024-10-11 04:13:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:49,358 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 6023 transitions. [2024-10-11 04:13:49,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 6023 transitions. [2024-10-11 04:13:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:49,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:49,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:49,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:13:49,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:49,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -683812243, now seen corresponding path program 1 times [2024-10-11 04:13:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320704628] [2024-10-11 04:13:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:49,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:49,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:49,531 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:13:49,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:49,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320704628] [2024-10-11 04:13:49,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320704628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:49,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:49,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:49,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530398061] [2024-10-11 04:13:49,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:49,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:49,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:49,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:49,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:49,532 INFO L87 Difference]: Start difference. First operand 3459 states and 6023 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:51,308 INFO L93 Difference]: Finished difference Result 6997 states and 11579 transitions. [2024-10-11 04:13:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:13:51,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:51,331 INFO L225 Difference]: With dead ends: 6997 [2024-10-11 04:13:51,331 INFO L226 Difference]: Without dead ends: 5669 [2024-10-11 04:13:51,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:13:51,338 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4584 mSDsluCounter, 16513 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4594 SdHoareTripleChecker+Valid, 20688 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:51,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4594 Valid, 20688 Invalid, 1750 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:13:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2024-10-11 04:13:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 4582. [2024-10-11 04:13:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 4252 states have (on average 1.7064910630291628) internal successors, (7256), 4270 states have internal predecessors, (7256), 210 states have call successors, (210), 102 states have call predecessors, (210), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-11 04:13:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 7773 transitions. [2024-10-11 04:13:51,589 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 7773 transitions. Word has length 81 [2024-10-11 04:13:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:51,589 INFO L471 AbstractCegarLoop]: Abstraction has 4582 states and 7773 transitions. [2024-10-11 04:13:51,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 7773 transitions. [2024-10-11 04:13:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:51,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:51,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:51,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:13:51,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:51,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:51,594 INFO L85 PathProgramCache]: Analyzing trace with hash -4539989, now seen corresponding path program 1 times [2024-10-11 04:13:51,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:51,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179606446] [2024-10-11 04:13:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:51,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:51,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:51,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:51,735 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:13:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179606446] [2024-10-11 04:13:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179606446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:51,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294946171] [2024-10-11 04:13:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:51,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:51,738 INFO L87 Difference]: Start difference. First operand 4582 states and 7773 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:53,991 INFO L93 Difference]: Finished difference Result 11098 states and 18019 transitions. [2024-10-11 04:13:53,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:13:53,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:54,028 INFO L225 Difference]: With dead ends: 11098 [2024-10-11 04:13:54,028 INFO L226 Difference]: Without dead ends: 8647 [2024-10-11 04:13:54,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:13:54,041 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4639 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:54,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 20692 Invalid, 1510 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:13:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8647 states. [2024-10-11 04:13:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8647 to 6867. [2024-10-11 04:13:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6867 states, 6249 states have (on average 1.6549847975676109) internal successors, (10342), 6283 states have internal predecessors, (10342), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-11 04:13:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 11389 transitions. [2024-10-11 04:13:54,542 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 11389 transitions. Word has length 81 [2024-10-11 04:13:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:54,542 INFO L471 AbstractCegarLoop]: Abstraction has 6867 states and 11389 transitions. [2024-10-11 04:13:54,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 11389 transitions. [2024-10-11 04:13:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:54,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:54,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:54,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:13:54,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1957034669, now seen corresponding path program 1 times [2024-10-11 04:13:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666578399] [2024-10-11 04:13:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:54,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:54,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:54,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:54,703 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:13:54,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:54,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666578399] [2024-10-11 04:13:54,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666578399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:54,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:54,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:54,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941563606] [2024-10-11 04:13:54,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:54,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:54,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:54,707 INFO L87 Difference]: Start difference. First operand 6867 states and 11389 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:57,385 INFO L93 Difference]: Finished difference Result 19165 states and 30877 transitions. [2024-10-11 04:13:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:13:57,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:13:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:57,451 INFO L225 Difference]: With dead ends: 19165 [2024-10-11 04:13:57,452 INFO L226 Difference]: Without dead ends: 14429 [2024-10-11 04:13:57,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:13:57,480 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4603 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4619 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:57,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4619 Valid, 20692 Invalid, 1497 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:13:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14429 states. [2024-10-11 04:13:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14429 to 11436. [2024-10-11 04:13:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11436 states, 10258 states have (on average 1.6127900175472802) internal successors, (16544), 10324 states have internal predecessors, (16544), 722 states have call successors, (722), 390 states have call predecessors, (722), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-11 04:13:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11436 states to 11436 states and 18781 transitions. [2024-10-11 04:13:58,339 INFO L78 Accepts]: Start accepts. Automaton has 11436 states and 18781 transitions. Word has length 81 [2024-10-11 04:13:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:58,340 INFO L471 AbstractCegarLoop]: Abstraction has 11436 states and 18781 transitions. [2024-10-11 04:13:58,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11436 states and 18781 transitions. [2024-10-11 04:13:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:13:58,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:58,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:58,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:13:58,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:58,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2136108693, now seen corresponding path program 1 times [2024-10-11 04:13:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:58,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935627853] [2024-10-11 04:13:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:58,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:13:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:13:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:13:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:13:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:58,457 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:13:58,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:58,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935627853] [2024-10-11 04:13:58,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935627853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:58,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:58,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149263256] [2024-10-11 04:13:58,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:58,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:58,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:58,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:58,459 INFO L87 Difference]: Start difference. First operand 11436 states and 18781 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:00,909 INFO L93 Difference]: Finished difference Result 34784 states and 56375 transitions. [2024-10-11 04:14:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:14:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:14:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:00,982 INFO L225 Difference]: With dead ends: 34784 [2024-10-11 04:14:00,982 INFO L226 Difference]: Without dead ends: 25479 [2024-10-11 04:14:01,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:14:01,007 INFO L432 NwaCegarLoop]: 4166 mSDtfsCounter, 4552 mSDsluCounter, 16504 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4562 SdHoareTripleChecker+Valid, 20670 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:01,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4562 Valid, 20670 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:14:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25479 states. [2024-10-11 04:14:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25479 to 20561. [2024-10-11 04:14:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20561 states, 18303 states have (on average 1.5847675244495438) internal successors, (29006), 18433 states have internal predecessors, (29006), 1358 states have call successors, (1358), 770 states have call predecessors, (1358), 898 states have return successors, (3673), 1485 states have call predecessors, (3673), 1358 states have call successors, (3673) [2024-10-11 04:14:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20561 states to 20561 states and 34037 transitions. [2024-10-11 04:14:02,098 INFO L78 Accepts]: Start accepts. Automaton has 20561 states and 34037 transitions. Word has length 81 [2024-10-11 04:14:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:02,099 INFO L471 AbstractCegarLoop]: Abstraction has 20561 states and 34037 transitions. [2024-10-11 04:14:02,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 20561 states and 34037 transitions. [2024-10-11 04:14:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:14:02,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:02,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:14:02,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:14:02,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:02,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1575408915, now seen corresponding path program 1 times [2024-10-11 04:14:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:02,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134636284] [2024-10-11 04:14:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:02,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:02,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:14:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:02,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:14:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:02,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:14:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:02,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:14:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:02,205 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:14:02,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:02,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134636284] [2024-10-11 04:14:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134636284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:02,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:02,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:14:02,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713406053] [2024-10-11 04:14:02,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:02,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:14:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:02,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:14:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:14:02,207 INFO L87 Difference]: Start difference. First operand 20561 states and 34037 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:05,022 INFO L93 Difference]: Finished difference Result 54256 states and 88376 transitions. [2024-10-11 04:14:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:14:05,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 04:14:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:05,179 INFO L225 Difference]: With dead ends: 54256 [2024-10-11 04:14:05,179 INFO L226 Difference]: Without dead ends: 35827 [2024-10-11 04:14:05,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:14:05,237 INFO L432 NwaCegarLoop]: 4213 mSDtfsCounter, 4743 mSDsluCounter, 12309 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 16522 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:05,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 16522 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:14:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35827 states. [2024-10-11 04:14:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35827 to 29690. [2024-10-11 04:14:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29690 states, 26260 states have (on average 1.562909367859863) internal successors, (41042), 26519 states have internal predecessors, (41042), 2076 states have call successors, (2076), 1160 states have call predecessors, (2076), 1352 states have return successors, (5121), 2138 states have call predecessors, (5121), 2076 states have call successors, (5121) [2024-10-11 04:14:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29690 states to 29690 states and 48239 transitions. [2024-10-11 04:14:07,208 INFO L78 Accepts]: Start accepts. Automaton has 29690 states and 48239 transitions. Word has length 81 [2024-10-11 04:14:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:07,209 INFO L471 AbstractCegarLoop]: Abstraction has 29690 states and 48239 transitions. [2024-10-11 04:14:07,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29690 states and 48239 transitions. [2024-10-11 04:14:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:14:07,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:07,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:14:07,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:14:07,262 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:07,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:07,263 INFO L85 PathProgramCache]: Analyzing trace with hash -162136465, now seen corresponding path program 1 times [2024-10-11 04:14:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:07,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80035599] [2024-10-11 04:14:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:07,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:14:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:14:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:14:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:14:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:14:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:14:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:14:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:14:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80035599] [2024-10-11 04:14:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80035599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:14:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684343964] [2024-10-11 04:14:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:07,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:14:07,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:14:07,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:14:07,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:14:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:07,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:14:07,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:14:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 04:14:07,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:14:07,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684343964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:07,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:14:07,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:14:07,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567247371] [2024-10-11 04:14:07,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:07,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:14:07,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:07,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:14:07,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:07,624 INFO L87 Difference]: Start difference. First operand 29690 states and 48239 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:14:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:10,954 INFO L93 Difference]: Finished difference Result 84209 states and 136555 transitions. [2024-10-11 04:14:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:14:10,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-11 04:14:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:11,160 INFO L225 Difference]: With dead ends: 84209 [2024-10-11 04:14:11,160 INFO L226 Difference]: Without dead ends: 56651 [2024-10-11 04:14:11,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:11,229 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4157 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4157 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:11,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4157 Valid, 4391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:14:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56651 states. [2024-10-11 04:14:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56651 to 56455. [2024-10-11 04:14:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56455 states, 49707 states have (on average 1.5459995574064016) internal successors, (76847), 50223 states have internal predecessors, (76847), 4046 states have call successors, (4046), 2316 states have call predecessors, (4046), 2700 states have return successors, (10009), 4043 states have call predecessors, (10009), 4046 states have call successors, (10009) [2024-10-11 04:14:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56455 states to 56455 states and 90902 transitions. [2024-10-11 04:14:16,357 INFO L78 Accepts]: Start accepts. Automaton has 56455 states and 90902 transitions. Word has length 131 [2024-10-11 04:14:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:16,358 INFO L471 AbstractCegarLoop]: Abstraction has 56455 states and 90902 transitions. [2024-10-11 04:14:16,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:14:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 56455 states and 90902 transitions. [2024-10-11 04:14:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:14:16,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:16,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:14:16,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:14:16,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:14:16,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:16,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1117499279, now seen corresponding path program 1 times [2024-10-11 04:14:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642659612] [2024-10-11 04:14:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:14:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:14:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:14:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:14:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:14:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:14:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:14:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:14:17,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:17,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642659612] [2024-10-11 04:14:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642659612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:14:17,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618396428] [2024-10-11 04:14:17,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:17,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:14:17,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:14:17,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:14:17,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:14:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:17,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:14:17,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:14:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 04:14:17,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:14:17,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618396428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:17,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:14:17,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:14:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364157765] [2024-10-11 04:14:17,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:17,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:14:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:17,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:14:17,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:17,303 INFO L87 Difference]: Start difference. First operand 56455 states and 90902 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:14:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:24,513 INFO L93 Difference]: Finished difference Result 163896 states and 264344 transitions. [2024-10-11 04:14:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:14:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-11 04:14:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:25,079 INFO L225 Difference]: With dead ends: 163896 [2024-10-11 04:14:25,079 INFO L226 Difference]: Without dead ends: 109573 [2024-10-11 04:14:25,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:25,250 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4162 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:25,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 4391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:14:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states.