./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.12.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc6dc2c99e05b6915f0a2e5b5d96221c996d96767aaa6be997dea59c4d6f5f0a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:14:30,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:14:30,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:14:30,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:14:30,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:14:30,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:14:30,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:14:30,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:14:30,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:14:30,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:14:30,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:14:30,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:14:30,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:14:30,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:14:30,204 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:14:30,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:14:30,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:14:30,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:14:30,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:14:30,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:14:30,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:14:30,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:14:30,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:14:30,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:14:30,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:14:30,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:14:30,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:14:30,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:14:30,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:14:30,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:14:30,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:14:30,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:14:30,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:14:30,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:14:30,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:14:30,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:14:30,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:14:30,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:14:30,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:14:30,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:14:30,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:14:30,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:14:30,225 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 -> bc6dc2c99e05b6915f0a2e5b5d96221c996d96767aaa6be997dea59c4d6f5f0a [2024-10-11 03:14:30,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:14:30,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:14:30,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:14:30,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:14:30,517 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:14:30,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.12.cil-2.c [2024-10-11 03:14:31,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:14:32,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:14:32,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.12.cil-2.c [2024-10-11 03:14:32,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6421d9ac6/6280e9fe54d44286b7b2739926a0564d/FLAG65beb6543 [2024-10-11 03:14:32,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6421d9ac6/6280e9fe54d44286b7b2739926a0564d [2024-10-11 03:14:32,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:14:32,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:14:32,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:14:32,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:14:32,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:14:32,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:14:32" (1/1) ... [2024-10-11 03:14:32,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70363916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:32, skipping insertion in model container [2024-10-11 03:14:32,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:14:32" (1/1) ... [2024-10-11 03:14:32,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:14:32,811 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/systemc/token_ring.12.cil-2.c[671,684] [2024-10-11 03:14:32,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:14:32,971 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:14:32,984 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/systemc/token_ring.12.cil-2.c[671,684] [2024-10-11 03:14:33,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:14:33,081 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:14:33,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33 WrapperNode [2024-10-11 03:14:33,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:14:33,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:14:33,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:14:33,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:14:33,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,160 INFO L138 Inliner]: procedures = 52, calls = 67, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 879 [2024-10-11 03:14:33,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:14:33,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:14:33,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:14:33,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:14:33,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,204 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 03:14:33,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:14:33,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:14:33,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:14:33,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:14:33,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (1/1) ... [2024-10-11 03:14:33,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:14:33,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:14:33,300 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 03:14:33,303 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 03:14:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:14:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:14:33,354 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:14:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 03:14:33,354 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 03:14:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:14:33,354 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:14:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:14:33,355 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:14:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:14:33,356 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:14:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:14:33,356 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:14:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:14:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:14:33,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:14:33,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:14:33,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:14:34,447 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2024-10-11 03:14:34,448 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:14:34,517 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:14:34,519 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 03:14:34,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:14:34 BoogieIcfgContainer [2024-10-11 03:14:34,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:14:34,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:14:34,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:14:34,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:14:34,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:14:32" (1/3) ... [2024-10-11 03:14:34,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746add95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:14:34, skipping insertion in model container [2024-10-11 03:14:34,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:14:33" (2/3) ... [2024-10-11 03:14:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746add95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:14:34, skipping insertion in model container [2024-10-11 03:14:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:14:34" (3/3) ... [2024-10-11 03:14:34,529 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.12.cil-2.c [2024-10-11 03:14:34,544 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:14:34,545 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:14:34,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:14:34,635 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;@263ad1fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:14:34,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:14:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 314 states have (on average 1.7356687898089171) internal successors, (545), 316 states have internal predecessors, (545), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:14:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:14:34,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:34,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:34,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:34,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 855529277, now seen corresponding path program 1 times [2024-10-11 03:14:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:34,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083463864] [2024-10-11 03:14:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:14:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:14:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:35,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:14:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:14:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:35,444 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 03:14:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083463864] [2024-10-11 03:14:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083463864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:35,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:35,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:14:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448523563] [2024-10-11 03:14:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:35,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:14:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:35,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:14:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:14:35,491 INFO L87 Difference]: Start difference. First operand has 348 states, 314 states have (on average 1.7356687898089171) internal successors, (545), 316 states have internal predecessors, (545), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 3 states have internal predecessors, (150), 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 03:14:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:37,760 INFO L93 Difference]: Finished difference Result 818 states and 1413 transitions. [2024-10-11 03:14:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:14:37,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 3 states have internal predecessors, (150), 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 160 [2024-10-11 03:14:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:37,780 INFO L225 Difference]: With dead ends: 818 [2024-10-11 03:14:37,781 INFO L226 Difference]: Without dead ends: 476 [2024-10-11 03:14:37,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:14:37,791 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 975 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:37,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 625 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 03:14:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-11 03:14:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 346. [2024-10-11 03:14:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 313 states have (on average 1.6325878594249201) internal successors, (511), 314 states have internal predecessors, (511), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:14:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 563 transitions. [2024-10-11 03:14:37,875 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 563 transitions. Word has length 160 [2024-10-11 03:14:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:37,876 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 563 transitions. [2024-10-11 03:14:37,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 3 states have internal predecessors, (150), 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 03:14:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 563 transitions. [2024-10-11 03:14:37,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:14:37,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:37,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:37,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:14:37,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:37,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash -591051589, now seen corresponding path program 1 times [2024-10-11 03:14:37,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:37,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932345227] [2024-10-11 03:14:37,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:38,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:14:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:38,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:14:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:14:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:38,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:14:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:38,219 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 03:14:38,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:38,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932345227] [2024-10-11 03:14:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932345227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:38,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:14:38,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651934244] [2024-10-11 03:14:38,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:38,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:14:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:38,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:14:38,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:14:38,225 INFO L87 Difference]: Start difference. First operand 346 states and 563 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 3 states have internal predecessors, (150), 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 03:14:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:40,016 INFO L93 Difference]: Finished difference Result 806 states and 1330 transitions. [2024-10-11 03:14:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:14:40,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 3 states have internal predecessors, (150), 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 160 [2024-10-11 03:14:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:40,021 INFO L225 Difference]: With dead ends: 806 [2024-10-11 03:14:40,021 INFO L226 Difference]: Without dead ends: 476 [2024-10-11 03:14:40,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:14:40,024 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 964 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:40,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 620 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:14:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-11 03:14:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 346. [2024-10-11 03:14:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 313 states have (on average 1.6293929712460065) internal successors, (510), 314 states have internal predecessors, (510), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 03:14:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 562 transitions. [2024-10-11 03:14:40,080 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 562 transitions. Word has length 160 [2024-10-11 03:14:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:40,081 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 562 transitions. [2024-10-11 03:14:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 3 states have internal predecessors, (150), 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 03:14:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 562 transitions. [2024-10-11 03:14:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:14:40,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:40,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:40,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:14:40,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:40,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1017606087, now seen corresponding path program 1 times [2024-10-11 03:14:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:40,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232397427] [2024-10-11 03:14:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:40,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:14:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:40,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:14:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:14:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:14:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:40,461 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 03:14:40,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:40,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232397427] [2024-10-11 03:14:40,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232397427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:40,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:40,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:14:40,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513382716] [2024-10-11 03:14:40,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:40,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:14:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:40,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:14:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:14:40,465 INFO L87 Difference]: Start difference. First operand 346 states and 562 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 4 states have internal predecessors, (150), 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 03:14:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:43,416 INFO L93 Difference]: Finished difference Result 1281 states and 2128 transitions. [2024-10-11 03:14:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:14:43,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 4 states have internal predecessors, (150), 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 160 [2024-10-11 03:14:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:43,422 INFO L225 Difference]: With dead ends: 1281 [2024-10-11 03:14:43,422 INFO L226 Difference]: Without dead ends: 953 [2024-10-11 03:14:43,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:43,427 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1476 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:43,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1048 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 03:14:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-10-11 03:14:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 694. [2024-10-11 03:14:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 633 states have (on average 1.6398104265402844) internal successors, (1038), 635 states have internal predecessors, (1038), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-11 03:14:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1135 transitions. [2024-10-11 03:14:43,484 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1135 transitions. Word has length 160 [2024-10-11 03:14:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:43,485 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1135 transitions. [2024-10-11 03:14:43,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 4 states have internal predecessors, (150), 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 03:14:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1135 transitions. [2024-10-11 03:14:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:14:43,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:43,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:43,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:14:43,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:43,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1504388999, now seen corresponding path program 1 times [2024-10-11 03:14:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:43,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050562026] [2024-10-11 03:14:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:14:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:14:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:14:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:14:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:43,887 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 03:14:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:43,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050562026] [2024-10-11 03:14:43,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050562026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:43,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:43,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:43,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779983439] [2024-10-11 03:14:43,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:43,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:43,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:43,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:43,892 INFO L87 Difference]: Start difference. First operand 694 states and 1135 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:14:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:47,843 INFO L93 Difference]: Finished difference Result 2126 states and 3534 transitions. [2024-10-11 03:14:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:47,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:14:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:47,852 INFO L225 Difference]: With dead ends: 2126 [2024-10-11 03:14:47,852 INFO L226 Difference]: Without dead ends: 1450 [2024-10-11 03:14:47,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:47,855 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1513 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3720 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:47,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 1992 Invalid, 3781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3720 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 03:14:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2024-10-11 03:14:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1015. [2024-10-11 03:14:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 926 states have (on average 1.632829373650108) internal successors, (1512), 929 states have internal predecessors, (1512), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 03:14:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1653 transitions. [2024-10-11 03:14:47,924 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1653 transitions. Word has length 160 [2024-10-11 03:14:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:47,925 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1653 transitions. [2024-10-11 03:14:47,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:14:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1653 transitions. [2024-10-11 03:14:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:14:47,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:47,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:47,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:14:47,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:47,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1002708475, now seen corresponding path program 1 times [2024-10-11 03:14:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004216515] [2024-10-11 03:14:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:48,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:14:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:14:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:14:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:48,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:14:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:14:48,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:48,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004216515] [2024-10-11 03:14:48,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004216515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:48,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:48,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131053789] [2024-10-11 03:14:48,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:48,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:48,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:48,242 INFO L87 Difference]: Start difference. First operand 1015 states and 1653 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:14:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:51,435 INFO L93 Difference]: Finished difference Result 3364 states and 5580 transitions. [2024-10-11 03:14:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:14:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:14:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:51,450 INFO L225 Difference]: With dead ends: 3364 [2024-10-11 03:14:51,451 INFO L226 Difference]: Without dead ends: 2367 [2024-10-11 03:14:51,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:14:51,457 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 1623 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:51,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 1296 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3086 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 03:14:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-10-11 03:14:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1658. [2024-10-11 03:14:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1513 states have (on average 1.6265697290152017) internal successors, (2461), 1518 states have internal predecessors, (2461), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 03:14:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2694 transitions. [2024-10-11 03:14:51,590 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2694 transitions. Word has length 160 [2024-10-11 03:14:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:51,591 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2694 transitions. [2024-10-11 03:14:51,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:14:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2694 transitions. [2024-10-11 03:14:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:14:51,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:14:51,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:14:51,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:51,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:51,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1133174727, now seen corresponding path program 1 times [2024-10-11 03:14:51,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:51,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547232683] [2024-10-11 03:14:51,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:51,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:14:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:14:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:14:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:14:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:51,910 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 03:14:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547232683] [2024-10-11 03:14:51,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547232683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83829567] [2024-10-11 03:14:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:51,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:51,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:51,915 INFO L87 Difference]: Start difference. First operand 1658 states and 2694 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:14:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:53,696 INFO L93 Difference]: Finished difference Result 3997 states and 6614 transitions. [2024-10-11 03:14:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:53,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:14:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:53,709 INFO L225 Difference]: With dead ends: 3997 [2024-10-11 03:14:53,709 INFO L226 Difference]: Without dead ends: 2357 [2024-10-11 03:14:53,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:53,717 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1235 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:53,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 862 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:14:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2024-10-11 03:14:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1658. [2024-10-11 03:14:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1513 states have (on average 1.6232650363516192) internal successors, (2456), 1518 states have internal predecessors, (2456), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 03:14:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2689 transitions. [2024-10-11 03:14:53,855 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2689 transitions. Word has length 160 [2024-10-11 03:14:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:53,856 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2689 transitions. [2024-10-11 03:14:53,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:14:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2689 transitions. [2024-10-11 03:14:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:14:53,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:53,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:53,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:14:53,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:53,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:53,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1063526853, now seen corresponding path program 1 times [2024-10-11 03:14:53,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:53,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504323530] [2024-10-11 03:14:53,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:53,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:53,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:14:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:54,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:14:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:54,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:14:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:14:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:54,172 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 03:14:54,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:54,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504323530] [2024-10-11 03:14:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504323530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017248002] [2024-10-11 03:14:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:54,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:54,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:54,176 INFO L87 Difference]: Start difference. First operand 1658 states and 2689 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:14:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:55,999 INFO L93 Difference]: Finished difference Result 3986 states and 6578 transitions. [2024-10-11 03:14:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:14:56,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:14:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:56,011 INFO L225 Difference]: With dead ends: 3986 [2024-10-11 03:14:56,013 INFO L226 Difference]: Without dead ends: 2346 [2024-10-11 03:14:56,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:14:56,022 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1231 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:56,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 862 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:14:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2024-10-11 03:14:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 1658. [2024-10-11 03:14:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1513 states have (on average 1.619960343688037) internal successors, (2451), 1518 states have internal predecessors, (2451), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 03:14:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2684 transitions. [2024-10-11 03:14:56,131 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2684 transitions. Word has length 160 [2024-10-11 03:14:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:56,132 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2684 transitions. [2024-10-11 03:14:56,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:14:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2684 transitions. [2024-10-11 03:14:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:14:56,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:56,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:14:56,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:14:56,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:56,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash 335426749, now seen corresponding path program 1 times [2024-10-11 03:14:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:56,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761282589] [2024-10-11 03:14:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:14:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:56,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:14:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:56,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:14:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:56,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:14:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:56,430 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 03:14:56,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:56,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761282589] [2024-10-11 03:14:56,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761282589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:56,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:14:56,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:14:56,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105733101] [2024-10-11 03:14:56,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:56,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:14:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:56,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:14:56,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:56,433 INFO L87 Difference]: Start difference. First operand 1658 states and 2684 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:00,007 INFO L93 Difference]: Finished difference Result 5718 states and 9399 transitions. [2024-10-11 03:15:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:15:00,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:15:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:00,028 INFO L225 Difference]: With dead ends: 5718 [2024-10-11 03:15:00,028 INFO L226 Difference]: Without dead ends: 4078 [2024-10-11 03:15:00,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:15:00,036 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1496 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3641 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:00,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1990 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3641 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 03:15:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2024-10-11 03:15:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 2959. [2024-10-11 03:15:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2702 states have (on average 1.614359733530718) internal successors, (4362), 2711 states have internal predecessors, (4362), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 03:15:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4785 transitions. [2024-10-11 03:15:00,252 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4785 transitions. Word has length 160 [2024-10-11 03:15:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:00,252 INFO L471 AbstractCegarLoop]: Abstraction has 2959 states and 4785 transitions. [2024-10-11 03:15:00,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4785 transitions. [2024-10-11 03:15:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:15:00,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:00,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:15:00,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1282013701, now seen corresponding path program 1 times [2024-10-11 03:15:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100483082] [2024-10-11 03:15:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:15:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:15:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:00,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:15:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:15:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:00,528 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 03:15:00,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100483082] [2024-10-11 03:15:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100483082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:00,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668430334] [2024-10-11 03:15:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:00,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:00,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:00,532 INFO L87 Difference]: Start difference. First operand 2959 states and 4785 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:02,194 INFO L93 Difference]: Finished difference Result 7044 states and 11575 transitions. [2024-10-11 03:15:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:02,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:15:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:02,215 INFO L225 Difference]: With dead ends: 7044 [2024-10-11 03:15:02,215 INFO L226 Difference]: Without dead ends: 4103 [2024-10-11 03:15:02,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:02,227 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1230 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:02,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 862 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:15:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2024-10-11 03:15:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 2959. [2024-10-11 03:15:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2702 states have (on average 1.6110288675055515) internal successors, (4353), 2711 states have internal predecessors, (4353), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 03:15:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4776 transitions. [2024-10-11 03:15:02,474 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4776 transitions. Word has length 160 [2024-10-11 03:15:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:02,475 INFO L471 AbstractCegarLoop]: Abstraction has 2959 states and 4776 transitions. [2024-10-11 03:15:02,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4776 transitions. [2024-10-11 03:15:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:15:02,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:02,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:02,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:15:02,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:02,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash -918547203, now seen corresponding path program 1 times [2024-10-11 03:15:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565382756] [2024-10-11 03:15:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:02,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:02,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:15:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:02,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:15:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:02,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:15:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:02,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:15:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:02,760 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 03:15:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565382756] [2024-10-11 03:15:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565382756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:02,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:02,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282005322] [2024-10-11 03:15:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:02,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:02,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:02,763 INFO L87 Difference]: Start difference. First operand 2959 states and 4776 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:06,507 INFO L93 Difference]: Finished difference Result 10453 states and 17108 transitions. [2024-10-11 03:15:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:15:06,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:15:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:06,545 INFO L225 Difference]: With dead ends: 10453 [2024-10-11 03:15:06,546 INFO L226 Difference]: Without dead ends: 7512 [2024-10-11 03:15:06,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:15:06,559 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1488 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3603 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:06,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1990 Invalid, 3666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3603 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 03:15:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7512 states. [2024-10-11 03:15:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7512 to 5571. [2024-10-11 03:15:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5571 states, 5090 states have (on average 1.606090373280943) internal successors, (8175), 5107 states have internal predecessors, (8175), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 03:15:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5571 states to 5571 states and 8996 transitions. [2024-10-11 03:15:07,014 INFO L78 Accepts]: Start accepts. Automaton has 5571 states and 8996 transitions. Word has length 160 [2024-10-11 03:15:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:07,015 INFO L471 AbstractCegarLoop]: Abstraction has 5571 states and 8996 transitions. [2024-10-11 03:15:07,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5571 states and 8996 transitions. [2024-10-11 03:15:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:15:07,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:07,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:07,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:15:07,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash -629727813, now seen corresponding path program 1 times [2024-10-11 03:15:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763318397] [2024-10-11 03:15:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:15:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:15:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:15:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:15:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,292 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 03:15:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763318397] [2024-10-11 03:15:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763318397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:07,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:07,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232436656] [2024-10-11 03:15:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:07,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:07,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:07,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:07,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:07,295 INFO L87 Difference]: Start difference. First operand 5571 states and 8996 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:11,093 INFO L93 Difference]: Finished difference Result 19939 states and 32658 transitions. [2024-10-11 03:15:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:15:11,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:15:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:11,204 INFO L225 Difference]: With dead ends: 19939 [2024-10-11 03:15:11,204 INFO L226 Difference]: Without dead ends: 14386 [2024-10-11 03:15:11,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:15:11,224 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1487 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3590 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:11,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1990 Invalid, 3653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3590 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 03:15:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14386 states. [2024-10-11 03:15:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14386 to 10808. [2024-10-11 03:15:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10808 states, 9879 states have (on average 1.603097479501974) internal successors, (15837), 9912 states have internal predecessors, (15837), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-11 03:15:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10808 states to 10808 states and 17508 transitions. [2024-10-11 03:15:12,149 INFO L78 Accepts]: Start accepts. Automaton has 10808 states and 17508 transitions. Word has length 160 [2024-10-11 03:15:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:12,150 INFO L471 AbstractCegarLoop]: Abstraction has 10808 states and 17508 transitions. [2024-10-11 03:15:12,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 10808 states and 17508 transitions. [2024-10-11 03:15:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:15:12,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:12,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:12,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:15:12,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:12,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1174600387, now seen corresponding path program 1 times [2024-10-11 03:15:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675943808] [2024-10-11 03:15:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:12,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:15:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:12,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:15:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:15:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:15:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:12,440 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 03:15:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675943808] [2024-10-11 03:15:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675943808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:12,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439512757] [2024-10-11 03:15:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:12,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:12,443 INFO L87 Difference]: Start difference. First operand 10808 states and 17508 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:16,675 INFO L93 Difference]: Finished difference Result 38910 states and 63948 transitions. [2024-10-11 03:15:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:15:16,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:15:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:16,814 INFO L225 Difference]: With dead ends: 38910 [2024-10-11 03:15:16,815 INFO L226 Difference]: Without dead ends: 28120 [2024-10-11 03:15:16,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:15:16,872 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 1584 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:16,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 1296 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2992 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 03:15:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28120 states. [2024-10-11 03:15:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28120 to 21313. [2024-10-11 03:15:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21313 states, 19488 states have (on average 1.6013444170771758) internal successors, (31207), 19553 states have internal predecessors, (31207), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 03:15:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21313 states to 21313 states and 34740 transitions. [2024-10-11 03:15:18,627 INFO L78 Accepts]: Start accepts. Automaton has 21313 states and 34740 transitions. Word has length 160 [2024-10-11 03:15:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:18,628 INFO L471 AbstractCegarLoop]: Abstraction has 21313 states and 34740 transitions. [2024-10-11 03:15:18,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21313 states and 34740 transitions. [2024-10-11 03:15:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:15:18,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:18,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:18,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:15:18,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:18,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash -499440261, now seen corresponding path program 1 times [2024-10-11 03:15:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:18,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993011512] [2024-10-11 03:15:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:15:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:15:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:15:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:15:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,896 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 03:15:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993011512] [2024-10-11 03:15:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993011512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333293296] [2024-10-11 03:15:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:18,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:18,899 INFO L87 Difference]: Start difference. First operand 21313 states and 34740 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:22,084 INFO L93 Difference]: Finished difference Result 49848 states and 82690 transitions. [2024-10-11 03:15:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:15:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:15:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:22,222 INFO L225 Difference]: With dead ends: 49848 [2024-10-11 03:15:22,222 INFO L226 Difference]: Without dead ends: 28553 [2024-10-11 03:15:22,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:15:22,291 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1237 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:22,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 862 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:15:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28553 states. [2024-10-11 03:15:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28553 to 21313. [2024-10-11 03:15:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21313 states, 19488 states have (on average 1.5980090311986863) internal successors, (31142), 19553 states have internal predecessors, (31142), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 03:15:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21313 states to 21313 states and 34675 transitions. [2024-10-11 03:15:24,025 INFO L78 Accepts]: Start accepts. Automaton has 21313 states and 34675 transitions. Word has length 160 [2024-10-11 03:15:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:24,026 INFO L471 AbstractCegarLoop]: Abstraction has 21313 states and 34675 transitions. [2024-10-11 03:15:24,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 21313 states and 34675 transitions. [2024-10-11 03:15:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:15:24,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:24,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:24,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:15:24,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:24,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1447492227, now seen corresponding path program 1 times [2024-10-11 03:15:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072612114] [2024-10-11 03:15:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:15:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:15:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:15:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:15:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:24,285 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 03:15:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072612114] [2024-10-11 03:15:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072612114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:24,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593677467] [2024-10-11 03:15:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:24,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:24,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:24,288 INFO L87 Difference]: Start difference. First operand 21313 states and 34675 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:31,676 INFO L93 Difference]: Finished difference Result 86449 states and 142352 transitions. [2024-10-11 03:15:31,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:15:31,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:15:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:32,015 INFO L225 Difference]: With dead ends: 86449 [2024-10-11 03:15:32,016 INFO L226 Difference]: Without dead ends: 65154 [2024-10-11 03:15:32,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:15:32,117 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 1914 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 3510 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:32,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 1983 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3510 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 03:15:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65154 states. [2024-10-11 03:15:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65154 to 42388. [2024-10-11 03:15:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42388 states, 38835 states have (on average 1.5976310029612464) internal successors, (62044), 38964 states have internal predecessors, (62044), 2650 states have call successors, (2650), 774 states have call predecessors, (2650), 902 states have return successors, (4965), 2777 states have call predecessors, (4965), 2650 states have call successors, (4965) [2024-10-11 03:15:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42388 states to 42388 states and 69659 transitions. [2024-10-11 03:15:35,450 INFO L78 Accepts]: Start accepts. Automaton has 42388 states and 69659 transitions. Word has length 160 [2024-10-11 03:15:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:35,450 INFO L471 AbstractCegarLoop]: Abstraction has 42388 states and 69659 transitions. [2024-10-11 03:15:35,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 42388 states and 69659 transitions. [2024-10-11 03:15:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 03:15:35,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:35,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:35,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:15:35,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:35,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1881997825, now seen corresponding path program 1 times [2024-10-11 03:15:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:35,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305048372] [2024-10-11 03:15:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:35,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:15:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:35,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:15:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:15:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:15:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:15:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:35,775 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 03:15:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305048372] [2024-10-11 03:15:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305048372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:35,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:35,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:15:35,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90002020] [2024-10-11 03:15:35,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:35,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:15:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:15:35,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:15:35,777 INFO L87 Difference]: Start difference. First operand 42388 states and 69659 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 03:15:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:46,589 INFO L93 Difference]: Finished difference Result 170274 states and 283114 transitions. [2024-10-11 03:15:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:15:46,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 5 states have internal predecessors, (150), 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 160 [2024-10-11 03:15:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted.