./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:11:59,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:11:59,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:11:59,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:11:59,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:11:59,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:11:59,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:11:59,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:11:59,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:11:59,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:11:59,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:11:59,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:11:59,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:11:59,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:11:59,160 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:11:59,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:11:59,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:11:59,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:11:59,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:11:59,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:11:59,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:11:59,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:11:59,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:11:59,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:11:59,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:11:59,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:11:59,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:11:59,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:11:59,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:11:59,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:11:59,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:11:59,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:11:59,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:11:59,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:11:59,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:11:59,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:11:59,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:11:59,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:11:59,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:11:59,176 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2024-10-11 06:11:59,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:11:59,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:11:59,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:11:59,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:11:59,462 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:11:59,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-10-11 06:12:01,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:12:01,252 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:12:01,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-10-11 06:12:01,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d44019ad9/70b4db905e7d4759b312054e50ba0826/FLAG1769d9382 [2024-10-11 06:12:01,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d44019ad9/70b4db905e7d4759b312054e50ba0826 [2024-10-11 06:12:01,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:12:01,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:12:01,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:12:01,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:12:01,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:12:01,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:01" (1/1) ... [2024-10-11 06:12:01,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a997724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:01, skipping insertion in model container [2024-10-11 06:12:01,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:01" (1/1) ... [2024-10-11 06:12:01,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:12:01,858 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-10-11 06:12:01,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:12:01,987 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:12:02,002 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/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-10-11 06:12:02,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:12:02,081 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:12:02,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02 WrapperNode [2024-10-11 06:12:02,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:12:02,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:12:02,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:12:02,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:12:02,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,191 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 590 [2024-10-11 06:12:02,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:12:02,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:12:02,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:12:02,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:12:02,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,281 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 06:12:02,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:12:02,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:12:02,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:12:02,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:12:02,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (1/1) ... [2024-10-11 06:12:02,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:12:02,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:02,374 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 06:12:02,377 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 06:12:02,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:12:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:12:02,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:12:02,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:12:02,560 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:12:02,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:12:03,451 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2024-10-11 06:12:03,452 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:12:03,498 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:12:03,500 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:12:03,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:03 BoogieIcfgContainer [2024-10-11 06:12:03,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:12:03,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:12:03,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:12:03,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:12:03,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:12:01" (1/3) ... [2024-10-11 06:12:03,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86331cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:03, skipping insertion in model container [2024-10-11 06:12:03,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:02" (2/3) ... [2024-10-11 06:12:03,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86331cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:03, skipping insertion in model container [2024-10-11 06:12:03,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:03" (3/3) ... [2024-10-11 06:12:03,512 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2024-10-11 06:12:03,526 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:12:03,527 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:12:03,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:12:03,616 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;@79deb4bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:12:03,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:12:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 157 states have (on average 1.5031847133757963) internal successors, (236), 158 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 06:12:03,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:03,633 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] [2024-10-11 06:12:03,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:03,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1490537309, now seen corresponding path program 1 times [2024-10-11 06:12:03,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145713611] [2024-10-11 06:12:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:04,443 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 06:12:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145713611] [2024-10-11 06:12:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145713611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:04,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:04,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:04,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174610025] [2024-10-11 06:12:04,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:04,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:04,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:04,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:04,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:04,483 INFO L87 Difference]: Start difference. First operand has 159 states, 157 states have (on average 1.5031847133757963) internal successors, (236), 158 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:04,563 INFO L93 Difference]: Finished difference Result 306 states and 456 transitions. [2024-10-11 06:12:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 06:12:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:04,574 INFO L225 Difference]: With dead ends: 306 [2024-10-11 06:12:04,574 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 06:12:04,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:04,579 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:04,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 06:12:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-11 06:12:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.4842767295597483) internal successors, (236), 159 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 236 transitions. [2024-10-11 06:12:04,619 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 236 transitions. Word has length 34 [2024-10-11 06:12:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:04,619 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 236 transitions. [2024-10-11 06:12:04,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 236 transitions. [2024-10-11 06:12:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 06:12:04,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:04,621 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] [2024-10-11 06:12:04,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:12:04,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:04,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1039679025, now seen corresponding path program 1 times [2024-10-11 06:12:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:04,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787142271] [2024-10-11 06:12:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:04,878 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 06:12:04,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:04,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787142271] [2024-10-11 06:12:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787142271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:04,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:04,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:04,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868044663] [2024-10-11 06:12:04,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:04,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:04,883 INFO L87 Difference]: Start difference. First operand 160 states and 236 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:04,934 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2024-10-11 06:12:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:04,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 06:12:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:04,939 INFO L225 Difference]: With dead ends: 309 [2024-10-11 06:12:04,939 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 06:12:04,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:04,944 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:04,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 06:12:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 06:12:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4782608695652173) internal successors, (238), 161 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2024-10-11 06:12:04,960 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 35 [2024-10-11 06:12:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:04,963 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2024-10-11 06:12:04,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2024-10-11 06:12:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 06:12:04,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:04,965 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] [2024-10-11 06:12:04,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:12:04,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:04,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:04,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1067312956, now seen corresponding path program 1 times [2024-10-11 06:12:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11598078] [2024-10-11 06:12:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:05,871 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 06:12:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11598078] [2024-10-11 06:12:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11598078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:05,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:05,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 06:12:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988855180] [2024-10-11 06:12:05,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:05,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 06:12:05,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 06:12:05,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:05,876 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:06,078 INFO L93 Difference]: Finished difference Result 356 states and 524 transitions. [2024-10-11 06:12:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 06:12:06,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-11 06:12:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:06,086 INFO L225 Difference]: With dead ends: 356 [2024-10-11 06:12:06,086 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 06:12:06,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:06,091 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 45 mSDsluCounter, 2141 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2356 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:06,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2356 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 06:12:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2024-10-11 06:12:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.481283422459893) internal successors, (277), 187 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 277 transitions. [2024-10-11 06:12:06,107 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 277 transitions. Word has length 36 [2024-10-11 06:12:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:06,108 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 277 transitions. [2024-10-11 06:12:06,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 277 transitions. [2024-10-11 06:12:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 06:12:06,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:06,109 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] [2024-10-11 06:12:06,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:12:06,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:06,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:06,111 INFO L85 PathProgramCache]: Analyzing trace with hash -364149736, now seen corresponding path program 1 times [2024-10-11 06:12:06,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:06,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583559161] [2024-10-11 06:12:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:06,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:06,529 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 06:12:06,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583559161] [2024-10-11 06:12:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583559161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:12:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006238653] [2024-10-11 06:12:06,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:06,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 06:12:06,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:06,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 06:12:06,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 06:12:06,534 INFO L87 Difference]: Start difference. First operand 188 states and 277 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:06,555 INFO L93 Difference]: Finished difference Result 337 states and 496 transitions. [2024-10-11 06:12:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 06:12:06,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 06:12:06,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:06,557 INFO L225 Difference]: With dead ends: 337 [2024-10-11 06:12:06,557 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 06:12:06,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 06:12:06,559 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 2 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:06,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 454 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 06:12:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 06:12:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4720496894409938) internal successors, (237), 161 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2024-10-11 06:12:06,573 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 37 [2024-10-11 06:12:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:06,574 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2024-10-11 06:12:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-10-11 06:12:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 06:12:06,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:06,577 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] [2024-10-11 06:12:06,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:12:06,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:06,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash 505715024, now seen corresponding path program 1 times [2024-10-11 06:12:06,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:06,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015200220] [2024-10-11 06:12:06,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:06,917 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 06:12:06,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015200220] [2024-10-11 06:12:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015200220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:06,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:12:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216348240] [2024-10-11 06:12:06,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:06,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:12:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:06,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:12:06,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:12:06,923 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:06,971 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2024-10-11 06:12:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 06:12:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:06,975 INFO L225 Difference]: With dead ends: 315 [2024-10-11 06:12:06,975 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 06:12:06,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:12:06,977 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 212 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:06,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 678 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 06:12:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2024-10-11 06:12:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4634146341463414) internal successors, (240), 164 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 240 transitions. [2024-10-11 06:12:06,992 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 240 transitions. Word has length 37 [2024-10-11 06:12:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:06,993 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 240 transitions. [2024-10-11 06:12:06,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 240 transitions. [2024-10-11 06:12:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 06:12:06,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:06,997 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] [2024-10-11 06:12:06,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:12:06,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:06,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 61841856, now seen corresponding path program 1 times [2024-10-11 06:12:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136473434] [2024-10-11 06:12:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:07,663 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 06:12:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:07,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136473434] [2024-10-11 06:12:07,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136473434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:07,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:07,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 06:12:07,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092668060] [2024-10-11 06:12:07,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:07,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 06:12:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 06:12:07,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:07,667 INFO L87 Difference]: Start difference. First operand 165 states and 240 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:07,889 INFO L93 Difference]: Finished difference Result 354 states and 516 transitions. [2024-10-11 06:12:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 06:12:07,890 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-11 06:12:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:07,891 INFO L225 Difference]: With dead ends: 354 [2024-10-11 06:12:07,892 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 06:12:07,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:07,896 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 39 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:07,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2301 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 06:12:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 183. [2024-10-11 06:12:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.456043956043956) internal successors, (265), 182 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2024-10-11 06:12:07,911 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 265 transitions. Word has length 38 [2024-10-11 06:12:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:07,913 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 265 transitions. [2024-10-11 06:12:07,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 265 transitions. [2024-10-11 06:12:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 06:12:07,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:07,915 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] [2024-10-11 06:12:07,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:12:07,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:07,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash -593816444, now seen corresponding path program 1 times [2024-10-11 06:12:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:07,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936531347] [2024-10-11 06:12:07,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:08,341 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 06:12:08,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:08,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936531347] [2024-10-11 06:12:08,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936531347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:08,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:08,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:12:08,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971031738] [2024-10-11 06:12:08,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:08,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:12:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:08,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:12:08,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:12:08,344 INFO L87 Difference]: Start difference. First operand 183 states and 265 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:08,413 INFO L93 Difference]: Finished difference Result 369 states and 535 transitions. [2024-10-11 06:12:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:12:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-11 06:12:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:08,416 INFO L225 Difference]: With dead ends: 369 [2024-10-11 06:12:08,416 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 06:12:08,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:12:08,418 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 10 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:08,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1103 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 06:12:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2024-10-11 06:12:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4479166666666667) internal successors, (278), 192 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 278 transitions. [2024-10-11 06:12:08,426 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 278 transitions. Word has length 38 [2024-10-11 06:12:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:08,427 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 278 transitions. [2024-10-11 06:12:08,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 278 transitions. [2024-10-11 06:12:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 06:12:08,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:08,431 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] [2024-10-11 06:12:08,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:12:08,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:08,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash -114247191, now seen corresponding path program 1 times [2024-10-11 06:12:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239519516] [2024-10-11 06:12:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:09,217 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 06:12:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:09,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239519516] [2024-10-11 06:12:09,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239519516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:09,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:09,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 06:12:09,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437419603] [2024-10-11 06:12:09,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:09,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 06:12:09,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:09,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 06:12:09,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 06:12:09,223 INFO L87 Difference]: Start difference. First operand 193 states and 278 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:09,478 INFO L93 Difference]: Finished difference Result 394 states and 567 transitions. [2024-10-11 06:12:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 06:12:09,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-11 06:12:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:09,480 INFO L225 Difference]: With dead ends: 394 [2024-10-11 06:12:09,480 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 06:12:09,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 06:12:09,484 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 39 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:09,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2127 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 06:12:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2024-10-11 06:12:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.4461538461538461) internal successors, (282), 195 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 282 transitions. [2024-10-11 06:12:09,492 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 282 transitions. Word has length 39 [2024-10-11 06:12:09,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:09,492 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 282 transitions. [2024-10-11 06:12:09,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 282 transitions. [2024-10-11 06:12:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 06:12:09,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:09,495 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] [2024-10-11 06:12:09,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:12:09,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1035003888, now seen corresponding path program 1 times [2024-10-11 06:12:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:09,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804053955] [2024-10-11 06:12:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:10,266 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 06:12:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804053955] [2024-10-11 06:12:10,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804053955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:10,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:10,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 06:12:10,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806245385] [2024-10-11 06:12:10,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:10,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 06:12:10,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:10,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 06:12:10,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:10,270 INFO L87 Difference]: Start difference. First operand 196 states and 282 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:10,504 INFO L93 Difference]: Finished difference Result 398 states and 573 transitions. [2024-10-11 06:12:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 06:12:10,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-11 06:12:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:10,507 INFO L225 Difference]: With dead ends: 398 [2024-10-11 06:12:10,507 INFO L226 Difference]: Without dead ends: 215 [2024-10-11 06:12:10,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:10,508 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 17 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:10,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2243 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-11 06:12:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-10-11 06:12:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4476190476190476) internal successors, (304), 210 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2024-10-11 06:12:10,518 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 39 [2024-10-11 06:12:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:10,518 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2024-10-11 06:12:10,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2024-10-11 06:12:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 06:12:10,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:10,521 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] [2024-10-11 06:12:10,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 06:12:10,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash 379345588, now seen corresponding path program 1 times [2024-10-11 06:12:10,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738920711] [2024-10-11 06:12:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:10,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:10,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:10,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738920711] [2024-10-11 06:12:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738920711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:10,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:10,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 06:12:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4717006] [2024-10-11 06:12:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:10,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 06:12:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 06:12:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:12:10,999 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:11,290 INFO L93 Difference]: Finished difference Result 421 states and 605 transitions. [2024-10-11 06:12:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 06:12:11,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-11 06:12:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:11,292 INFO L225 Difference]: With dead ends: 421 [2024-10-11 06:12:11,293 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 06:12:11,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-11 06:12:11,294 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 33 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:11,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2301 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 06:12:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2024-10-11 06:12:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.441860465116279) internal successors, (310), 215 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 310 transitions. [2024-10-11 06:12:11,301 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 310 transitions. Word has length 39 [2024-10-11 06:12:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:11,301 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 310 transitions. [2024-10-11 06:12:11,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 310 transitions. [2024-10-11 06:12:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 06:12:11,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:11,303 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] [2024-10-11 06:12:11,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 06:12:11,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:11,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:11,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1072650856, now seen corresponding path program 1 times [2024-10-11 06:12:11,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:11,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763132977] [2024-10-11 06:12:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:11,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:11,969 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 06:12:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763132977] [2024-10-11 06:12:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763132977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:11,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:11,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383734194] [2024-10-11 06:12:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:11,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:11,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:11,971 INFO L87 Difference]: Start difference. First operand 216 states and 310 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:12,032 INFO L93 Difference]: Finished difference Result 504 states and 718 transitions. [2024-10-11 06:12:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:12,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 06:12:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:12,035 INFO L225 Difference]: With dead ends: 504 [2024-10-11 06:12:12,035 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 06:12:12,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:12:12,036 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 352 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:12,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 663 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 06:12:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 243. [2024-10-11 06:12:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.4297520661157024) internal successors, (346), 242 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 346 transitions. [2024-10-11 06:12:12,046 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 346 transitions. Word has length 40 [2024-10-11 06:12:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:12,046 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 346 transitions. [2024-10-11 06:12:12,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 346 transitions. [2024-10-11 06:12:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 06:12:12,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:12,047 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] [2024-10-11 06:12:12,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 06:12:12,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash -805842179, now seen corresponding path program 1 times [2024-10-11 06:12:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:12,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229763150] [2024-10-11 06:12:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:12,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:12:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229763150] [2024-10-11 06:12:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229763150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:12:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706119518] [2024-10-11 06:12:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:12,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:12:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:12:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:12:12,484 INFO L87 Difference]: Start difference. First operand 243 states and 346 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:12,570 INFO L93 Difference]: Finished difference Result 449 states and 644 transitions. [2024-10-11 06:12:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:12:12,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 06:12:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:12,572 INFO L225 Difference]: With dead ends: 449 [2024-10-11 06:12:12,572 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 06:12:12,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:12:12,573 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 13 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:12,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1075 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 06:12:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 234. [2024-10-11 06:12:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4291845493562232) internal successors, (333), 233 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 333 transitions. [2024-10-11 06:12:12,581 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 333 transitions. Word has length 40 [2024-10-11 06:12:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:12,581 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 333 transitions. [2024-10-11 06:12:12,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 333 transitions. [2024-10-11 06:12:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 06:12:12,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:12,582 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] [2024-10-11 06:12:12,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 06:12:12,582 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:12,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash -10995271, now seen corresponding path program 1 times [2024-10-11 06:12:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:12,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060053044] [2024-10-11 06:12:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:13,293 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 06:12:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:13,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060053044] [2024-10-11 06:12:13,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060053044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:13,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:12:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467212091] [2024-10-11 06:12:13,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:13,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:12:13,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:13,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:12:13,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:12:13,298 INFO L87 Difference]: Start difference. First operand 234 states and 333 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:13,556 INFO L93 Difference]: Finished difference Result 500 states and 707 transitions. [2024-10-11 06:12:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:12:13,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-11 06:12:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:13,558 INFO L225 Difference]: With dead ends: 500 [2024-10-11 06:12:13,558 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 06:12:13,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 06:12:13,560 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 322 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:13,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1705 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 06:12:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 242. [2024-10-11 06:12:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4273858921161826) internal successors, (344), 241 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 344 transitions. [2024-10-11 06:12:13,567 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 344 transitions. Word has length 40 [2024-10-11 06:12:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:13,568 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 344 transitions. [2024-10-11 06:12:13,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 344 transitions. [2024-10-11 06:12:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 06:12:13,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:13,569 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] [2024-10-11 06:12:13,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 06:12:13,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:13,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1950314320, now seen corresponding path program 1 times [2024-10-11 06:12:13,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:13,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041335362] [2024-10-11 06:12:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:13,972 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 06:12:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041335362] [2024-10-11 06:12:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041335362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:12:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700279318] [2024-10-11 06:12:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:12:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:12:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:12:13,975 INFO L87 Difference]: Start difference. First operand 242 states and 344 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:14,082 INFO L93 Difference]: Finished difference Result 520 states and 740 transitions. [2024-10-11 06:12:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:12:14,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-11 06:12:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:14,085 INFO L225 Difference]: With dead ends: 520 [2024-10-11 06:12:14,085 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 06:12:14,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:12:14,086 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 324 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:14,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1086 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 06:12:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 263. [2024-10-11 06:12:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4236641221374047) internal successors, (373), 262 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 373 transitions. [2024-10-11 06:12:14,094 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 373 transitions. Word has length 41 [2024-10-11 06:12:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:14,094 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 373 transitions. [2024-10-11 06:12:14,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 373 transitions. [2024-10-11 06:12:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 06:12:14,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:14,095 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] [2024-10-11 06:12:14,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 06:12:14,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:14,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1219844444, now seen corresponding path program 1 times [2024-10-11 06:12:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254392111] [2024-10-11 06:12:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:15,328 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 06:12:15,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254392111] [2024-10-11 06:12:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254392111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:15,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:15,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 06:12:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627329441] [2024-10-11 06:12:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:15,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 06:12:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:15,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 06:12:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-10-11 06:12:15,331 INFO L87 Difference]: Start difference. First operand 263 states and 373 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:15,843 INFO L93 Difference]: Finished difference Result 493 states and 697 transitions. [2024-10-11 06:12:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 06:12:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-11 06:12:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:15,845 INFO L225 Difference]: With dead ends: 493 [2024-10-11 06:12:15,846 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 06:12:15,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-10-11 06:12:15,847 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 55 mSDsluCounter, 2800 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:15,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 2999 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:12:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 06:12:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 282. [2024-10-11 06:12:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4199288256227758) internal successors, (399), 281 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 399 transitions. [2024-10-11 06:12:15,854 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 399 transitions. Word has length 42 [2024-10-11 06:12:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:15,855 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 399 transitions. [2024-10-11 06:12:15,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 399 transitions. [2024-10-11 06:12:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 06:12:15,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:15,856 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] [2024-10-11 06:12:15,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 06:12:15,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:15,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash 564186144, now seen corresponding path program 1 times [2024-10-11 06:12:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:15,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740786469] [2024-10-11 06:12:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:15,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:16,574 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 06:12:16,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:16,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740786469] [2024-10-11 06:12:16,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740786469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:16,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:16,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:16,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692096699] [2024-10-11 06:12:16,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:16,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:16,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:16,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:16,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:16,576 INFO L87 Difference]: Start difference. First operand 282 states and 399 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:16,637 INFO L93 Difference]: Finished difference Result 536 states and 755 transitions. [2024-10-11 06:12:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:16,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-11 06:12:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:16,639 INFO L225 Difference]: With dead ends: 536 [2024-10-11 06:12:16,639 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 06:12:16,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:12:16,640 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 294 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:16,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 666 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 06:12:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 253. [2024-10-11 06:12:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4206349206349207) internal successors, (358), 252 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 358 transitions. [2024-10-11 06:12:16,648 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 358 transitions. Word has length 42 [2024-10-11 06:12:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:16,648 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 358 transitions. [2024-10-11 06:12:16,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 358 transitions. [2024-10-11 06:12:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 06:12:16,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:16,649 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] [2024-10-11 06:12:16,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 06:12:16,649 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:16,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1981385616, now seen corresponding path program 1 times [2024-10-11 06:12:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:16,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016352549] [2024-10-11 06:12:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:18,048 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 06:12:18,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:18,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016352549] [2024-10-11 06:12:18,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016352549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:18,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:18,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-11 06:12:18,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207603423] [2024-10-11 06:12:18,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:18,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 06:12:18,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:18,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 06:12:18,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-10-11 06:12:18,052 INFO L87 Difference]: Start difference. First operand 253 states and 358 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:18,882 INFO L93 Difference]: Finished difference Result 532 states and 751 transitions. [2024-10-11 06:12:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 06:12:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 06:12:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:18,884 INFO L225 Difference]: With dead ends: 532 [2024-10-11 06:12:18,884 INFO L226 Difference]: Without dead ends: 328 [2024-10-11 06:12:18,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 06:12:18,886 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 380 mSDsluCounter, 3084 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:18,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 3280 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:12:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-11 06:12:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 266. [2024-10-11 06:12:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4150943396226414) internal successors, (375), 265 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 375 transitions. [2024-10-11 06:12:18,892 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 375 transitions. Word has length 43 [2024-10-11 06:12:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:18,893 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 375 transitions. [2024-10-11 06:12:18,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 375 transitions. [2024-10-11 06:12:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 06:12:18,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:18,894 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] [2024-10-11 06:12:18,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 06:12:18,894 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:18,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1325727316, now seen corresponding path program 1 times [2024-10-11 06:12:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934531880] [2024-10-11 06:12:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:19,417 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 06:12:19,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:19,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934531880] [2024-10-11 06:12:19,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934531880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:19,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:19,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:19,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924676327] [2024-10-11 06:12:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:19,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:12:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:12:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:19,420 INFO L87 Difference]: Start difference. First operand 266 states and 375 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:19,463 INFO L93 Difference]: Finished difference Result 505 states and 711 transitions. [2024-10-11 06:12:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:19,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 06:12:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:19,465 INFO L225 Difference]: With dead ends: 505 [2024-10-11 06:12:19,465 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 06:12:19,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:12:19,466 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 224 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:19,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 664 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 06:12:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2024-10-11 06:12:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.4089219330855018) internal successors, (379), 269 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2024-10-11 06:12:19,475 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 379 transitions. Word has length 43 [2024-10-11 06:12:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:19,476 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 379 transitions. [2024-10-11 06:12:19,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 379 transitions. [2024-10-11 06:12:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 06:12:19,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:19,477 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] [2024-10-11 06:12:19,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 06:12:19,477 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:19,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1796757200, now seen corresponding path program 1 times [2024-10-11 06:12:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885415643] [2024-10-11 06:12:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:21,011 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 06:12:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885415643] [2024-10-11 06:12:21,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885415643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:21,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:21,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 06:12:21,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909171813] [2024-10-11 06:12:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:21,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 06:12:21,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 06:12:21,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-10-11 06:12:21,015 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:21,743 INFO L93 Difference]: Finished difference Result 567 states and 794 transitions. [2024-10-11 06:12:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 06:12:21,744 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 06:12:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:21,746 INFO L225 Difference]: With dead ends: 567 [2024-10-11 06:12:21,746 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 06:12:21,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 06:12:21,747 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 366 mSDsluCounter, 3171 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:21,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 3369 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:12:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 06:12:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 270. [2024-10-11 06:12:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.4052044609665428) internal successors, (378), 269 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 378 transitions. [2024-10-11 06:12:21,754 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 378 transitions. Word has length 43 [2024-10-11 06:12:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:21,754 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 378 transitions. [2024-10-11 06:12:21,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 378 transitions. [2024-10-11 06:12:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 06:12:21,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:21,755 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] [2024-10-11 06:12:21,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 06:12:21,756 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:21,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:21,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1842551796, now seen corresponding path program 1 times [2024-10-11 06:12:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:21,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830829066] [2024-10-11 06:12:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:22,623 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 06:12:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830829066] [2024-10-11 06:12:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830829066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:22,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:22,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 06:12:22,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135734771] [2024-10-11 06:12:22,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:22,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 06:12:22,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:22,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 06:12:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:12:22,625 INFO L87 Difference]: Start difference. First operand 270 states and 378 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:23,031 INFO L93 Difference]: Finished difference Result 548 states and 765 transitions. [2024-10-11 06:12:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 06:12:23,032 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 06:12:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:23,034 INFO L225 Difference]: With dead ends: 548 [2024-10-11 06:12:23,034 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 06:12:23,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2024-10-11 06:12:23,035 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 350 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:23,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 2287 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 06:12:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 305. [2024-10-11 06:12:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.394736842105263) internal successors, (424), 304 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 424 transitions. [2024-10-11 06:12:23,043 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 424 transitions. Word has length 43 [2024-10-11 06:12:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:23,043 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 424 transitions. [2024-10-11 06:12:23,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 424 transitions. [2024-10-11 06:12:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 06:12:23,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:23,045 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] [2024-10-11 06:12:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 06:12:23,045 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash -708587632, now seen corresponding path program 1 times [2024-10-11 06:12:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560612362] [2024-10-11 06:12:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:23,385 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 06:12:23,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560612362] [2024-10-11 06:12:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560612362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:23,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695330622] [2024-10-11 06:12:23,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:23,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:23,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:23,388 INFO L87 Difference]: Start difference. First operand 305 states and 424 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:23,407 INFO L93 Difference]: Finished difference Result 513 states and 722 transitions. [2024-10-11 06:12:23,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:23,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 06:12:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:23,409 INFO L225 Difference]: With dead ends: 513 [2024-10-11 06:12:23,409 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 06:12:23,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:23,410 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:23,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 06:12:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-10-11 06:12:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 406 transitions. [2024-10-11 06:12:23,417 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 406 transitions. Word has length 43 [2024-10-11 06:12:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 406 transitions. [2024-10-11 06:12:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 406 transitions. [2024-10-11 06:12:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 06:12:23,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:23,418 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] [2024-10-11 06:12:23,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 06:12:23,419 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:23,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1445891172, now seen corresponding path program 1 times [2024-10-11 06:12:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819423373] [2024-10-11 06:12:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:24,501 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 06:12:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819423373] [2024-10-11 06:12:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819423373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 06:12:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997877008] [2024-10-11 06:12:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:24,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 06:12:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 06:12:24,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-10-11 06:12:24,505 INFO L87 Difference]: Start difference. First operand 296 states and 406 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:24,803 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2024-10-11 06:12:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 06:12:24,804 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 06:12:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:24,808 INFO L225 Difference]: With dead ends: 535 [2024-10-11 06:12:24,808 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 06:12:24,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-10-11 06:12:24,809 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 228 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 2668 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:24,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 2668 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:12:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 06:12:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 321. [2024-10-11 06:12:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.378125) internal successors, (441), 320 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 441 transitions. [2024-10-11 06:12:24,817 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 441 transitions. Word has length 44 [2024-10-11 06:12:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:24,818 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 441 transitions. [2024-10-11 06:12:24,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 441 transitions. [2024-10-11 06:12:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 06:12:24,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:24,818 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] [2024-10-11 06:12:24,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 06:12:24,819 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:24,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:24,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1926192873, now seen corresponding path program 1 times [2024-10-11 06:12:24,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:24,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597656485] [2024-10-11 06:12:24,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:24,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:25,167 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 06:12:25,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597656485] [2024-10-11 06:12:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597656485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:25,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:12:25,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426631721] [2024-10-11 06:12:25,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:25,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:25,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:25,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:25,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:25,170 INFO L87 Difference]: Start difference. First operand 321 states and 441 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:25,192 INFO L93 Difference]: Finished difference Result 547 states and 761 transitions. [2024-10-11 06:12:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:12:25,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 06:12:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:25,194 INFO L225 Difference]: With dead ends: 547 [2024-10-11 06:12:25,194 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 06:12:25,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:25,195 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:25,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 668 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 06:12:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-11 06:12:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.3673469387755102) internal successors, (402), 294 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 402 transitions. [2024-10-11 06:12:25,202 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 402 transitions. Word has length 44 [2024-10-11 06:12:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 402 transitions. [2024-10-11 06:12:25,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 402 transitions. [2024-10-11 06:12:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 06:12:25,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:25,203 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] [2024-10-11 06:12:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 06:12:25,204 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:25,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -172582791, now seen corresponding path program 1 times [2024-10-11 06:12:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10525239] [2024-10-11 06:12:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:25,380 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 06:12:25,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:25,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10525239] [2024-10-11 06:12:25,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10525239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:25,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:25,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:12:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190085074] [2024-10-11 06:12:25,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:25,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:12:25,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:25,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:12:25,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:12:25,386 INFO L87 Difference]: Start difference. First operand 295 states and 402 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:25,419 INFO L93 Difference]: Finished difference Result 570 states and 777 transitions. [2024-10-11 06:12:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:25,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 06:12:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:25,421 INFO L225 Difference]: With dead ends: 570 [2024-10-11 06:12:25,421 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 06:12:25,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:12:25,423 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 64 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:25,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 866 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 06:12:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 274. [2024-10-11 06:12:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.3772893772893773) internal successors, (376), 273 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2024-10-11 06:12:25,429 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 44 [2024-10-11 06:12:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:25,430 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2024-10-11 06:12:25,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2024-10-11 06:12:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 06:12:25,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:25,430 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] [2024-10-11 06:12:25,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 06:12:25,431 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:25,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:25,431 INFO L85 PathProgramCache]: Analyzing trace with hash -254865677, now seen corresponding path program 1 times [2024-10-11 06:12:25,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:25,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620894125] [2024-10-11 06:12:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:25,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:26,276 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 06:12:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:12:26,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620894125] [2024-10-11 06:12:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620894125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:26,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:26,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:12:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984595834] [2024-10-11 06:12:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:26,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:12:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:12:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:12:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:12:26,279 INFO L87 Difference]: Start difference. First operand 274 states and 376 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:26,487 INFO L93 Difference]: Finished difference Result 514 states and 711 transitions. [2024-10-11 06:12:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:12:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-11 06:12:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:26,489 INFO L225 Difference]: With dead ends: 514 [2024-10-11 06:12:26,489 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 06:12:26,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-10-11 06:12:26,490 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 282 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:26,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1683 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:12:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 06:12:26,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 257. [2024-10-11 06:12:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.390625) internal successors, (356), 256 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 356 transitions. [2024-10-11 06:12:26,499 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 356 transitions. Word has length 45 [2024-10-11 06:12:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:26,499 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 356 transitions. [2024-10-11 06:12:26,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 356 transitions. [2024-10-11 06:12:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 06:12:26,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:26,500 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] [2024-10-11 06:12:26,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 06:12:26,501 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:26,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1525906067, now seen corresponding path program 1 times [2024-10-11 06:12:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:12:26,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692030264] [2024-10-11 06:12:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:12:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:12:26,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:12:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:12:26,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:12:26,660 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:12:26,661 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:12:26,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 06:12:26,679 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-11 06:12:26,773 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:12:26,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:12:26 BoogieIcfgContainer [2024-10-11 06:12:26,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:12:26,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:12:26,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:12:26,780 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:12:26,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:03" (3/4) ... [2024-10-11 06:12:26,785 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:12:26,786 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:12:26,787 INFO L158 Benchmark]: Toolchain (without parser) took 25155.57ms. Allocated memory was 161.5MB in the beginning and 645.9MB in the end (delta: 484.4MB). Free memory was 133.7MB in the beginning and 277.0MB in the end (delta: -143.3MB). Peak memory consumption was 340.6MB. Max. memory is 16.1GB. [2024-10-11 06:12:26,787 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:12:26,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.96ms. Allocated memory is still 161.5MB. Free memory was 133.5MB in the beginning and 114.0MB in the end (delta: 19.5MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-11 06:12:26,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.28ms. Allocated memory is still 161.5MB. Free memory was 114.0MB in the beginning and 102.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 06:12:26,788 INFO L158 Benchmark]: Boogie Preprocessor took 143.00ms. Allocated memory is still 161.5MB. Free memory was 102.5MB in the beginning and 95.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 06:12:26,788 INFO L158 Benchmark]: RCFGBuilder took 1164.41ms. Allocated memory is still 161.5MB. Free memory was 95.1MB in the beginning and 98.0MB in the end (delta: -2.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-11 06:12:26,788 INFO L158 Benchmark]: TraceAbstraction took 23275.86ms. Allocated memory was 161.5MB in the beginning and 645.9MB in the end (delta: 484.4MB). Free memory was 98.0MB in the beginning and 277.0MB in the end (delta: -179.0MB). Peak memory consumption was 308.4MB. Max. memory is 16.1GB. [2024-10-11 06:12:26,789 INFO L158 Benchmark]: Witness Printer took 6.14ms. Allocated memory is still 645.9MB. Free memory is still 277.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:12:26,790 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.96ms. Allocated memory is still 161.5MB. Free memory was 133.5MB in the beginning and 114.0MB in the end (delta: 19.5MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.28ms. Allocated memory is still 161.5MB. Free memory was 114.0MB in the beginning and 102.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.00ms. Allocated memory is still 161.5MB. Free memory was 102.5MB in the beginning and 95.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1164.41ms. Allocated memory is still 161.5MB. Free memory was 95.1MB in the beginning and 98.0MB in the end (delta: -2.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23275.86ms. Allocated memory was 161.5MB in the beginning and 645.9MB in the end (delta: 484.4MB). Free memory was 98.0MB in the beginning and 277.0MB in the end (delta: -179.0MB). Peak memory consumption was 308.4MB. Max. memory is 16.1GB. * Witness Printer took 6.14ms. Allocated memory is still 645.9MB. Free memory is still 277.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 153, overapproximation of bitwiseAnd at line 161. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 31); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (31 - 1); [L38] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 30); [L39] const SORT_57 msb_SORT_57 = (SORT_57)1 << (30 - 1); [L41] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 29); [L42] const SORT_59 msb_SORT_59 = (SORT_59)1 << (29 - 1); [L44] const SORT_65 mask_SORT_65 = (SORT_65)-1 >> (sizeof(SORT_65) * 8 - 2); [L45] const SORT_65 msb_SORT_65 = (SORT_65)1 << (2 - 1); [L47] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 28); [L48] const SORT_71 msb_SORT_71 = (SORT_71)1 << (28 - 1); [L50] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 26); [L51] const SORT_73 msb_SORT_73 = (SORT_73)1 << (26 - 1); [L53] const SORT_79 mask_SORT_79 = (SORT_79)-1 >> (sizeof(SORT_79) * 8 - 4); [L54] const SORT_79 msb_SORT_79 = (SORT_79)1 << (4 - 1); [L56] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 24); [L57] const SORT_85 msb_SORT_85 = (SORT_85)1 << (24 - 1); [L59] const SORT_87 mask_SORT_87 = (SORT_87)-1 >> (sizeof(SORT_87) * 8 - 20); [L60] const SORT_87 msb_SORT_87 = (SORT_87)1 << (20 - 1); [L62] const SORT_93 mask_SORT_93 = (SORT_93)-1 >> (sizeof(SORT_93) * 8 - 8); [L63] const SORT_93 msb_SORT_93 = (SORT_93)1 << (8 - 1); [L65] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 16); [L66] const SORT_99 msb_SORT_99 = (SORT_99)1 << (16 - 1); [L68] const SORT_5 var_8 = 0; [L69] const SORT_3 var_19 = 0; [L70] const SORT_3 var_40 = 1; [L72] SORT_1 input_2; [L73] SORT_3 input_4; [L74] SORT_5 input_6; [L75] SORT_3 input_7; [L77] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L77] SORT_5 state_9 = __VERIFIER_nondet_uint() & mask_SORT_5; [L78] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L78] SORT_5 state_13 = __VERIFIER_nondet_uint() & mask_SORT_5; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L79] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_5 init_10_arg_1 = var_8; [L82] state_9 = init_10_arg_1 [L83] SORT_5 init_14_arg_1 = var_8; [L84] state_13 = init_14_arg_1 [L85] SORT_3 init_21_arg_1 = var_19; [L86] state_20 = init_21_arg_1 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L89] input_2 = __VERIFIER_nondet_uchar() [L90] input_4 = __VERIFIER_nondet_uchar() [L91] input_6 = __VERIFIER_nondet_uint() [L92] input_7 = __VERIFIER_nondet_uchar() [L93] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L93] input_7 = input_7 & mask_SORT_3 [L96] SORT_5 var_11_arg_0 = state_9; [L97] SORT_5 var_11_arg_1 = var_8; [L98] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L99] SORT_3 var_12_arg_0 = var_11; [L100] SORT_3 var_12 = ~var_12_arg_0; [L101] SORT_5 var_15_arg_0 = state_13; [L102] SORT_5 var_15_arg_1 = var_8; [L103] SORT_3 var_15 = var_15_arg_0 == var_15_arg_1; [L104] SORT_3 var_16_arg_0 = var_15; [L105] SORT_3 var_16 = ~var_16_arg_0; [L106] SORT_3 var_17_arg_0 = var_12; [L107] SORT_3 var_17_arg_1 = var_16; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_17_arg_0=-2, var_17_arg_1=-2, var_40=1, var_8=0] [L108] EXPR var_17_arg_0 & var_17_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L108] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L109] SORT_3 var_18_arg_0 = var_17; [L110] SORT_3 var_18 = ~var_18_arg_0; [L111] SORT_3 var_22_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_22_arg_0=0, var_40=1, var_8=0] [L112] EXPR var_22_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L112] var_22_arg_0 = var_22_arg_0 & mask_SORT_3 [L113] SORT_5 var_22 = var_22_arg_0; [L114] SORT_5 var_23_arg_0 = var_22; [L115] SORT_5 var_23_arg_1 = var_8; [L116] SORT_3 var_23 = var_23_arg_0 == var_23_arg_1; [L117] SORT_5 var_24_arg_0 = state_9; [L118] SORT_5 var_24_arg_1 = var_8; [L119] SORT_3 var_24 = var_24_arg_0 == var_24_arg_1; [L120] SORT_3 var_25_arg_0 = var_24; [L121] SORT_3 var_25 = ~var_25_arg_0; [L122] SORT_3 var_26_arg_0 = var_23; [L123] SORT_3 var_26_arg_1 = var_25; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_26_arg_0=1, var_26_arg_1=-2, var_40=1, var_8=0] [L124] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L124] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L125] SORT_3 var_27_arg_0 = var_18; [L126] SORT_3 var_27_arg_1 = var_26; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27_arg_0=-255, var_27_arg_1=255, var_40=1, var_8=0] [L127] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L127] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L128] SORT_5 var_28_arg_0 = state_9; [L129] SORT_5 var_28_arg_1 = var_8; [L130] SORT_3 var_28 = var_28_arg_0 == var_28_arg_1; [L131] SORT_5 var_29_arg_0 = state_13; [L132] SORT_5 var_29_arg_1 = var_8; [L133] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L134] SORT_3 var_30_arg_0 = var_28; [L135] SORT_3 var_30_arg_1 = var_29; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_30_arg_0=1, var_30_arg_1=1, var_40=1, var_8=0] [L136] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L136] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L137] SORT_3 var_31_arg_0 = var_30; [L138] SORT_3 var_31 = ~var_31_arg_0; [L139] SORT_3 var_32_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_32_arg_0=0, var_40=1, var_8=0] [L140] EXPR var_32_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L140] var_32_arg_0 = var_32_arg_0 & mask_SORT_3 [L141] SORT_5 var_32 = var_32_arg_0; [L142] SORT_5 var_33_arg_0 = var_32; [L143] SORT_5 var_33_arg_1 = var_8; [L144] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L145] SORT_5 var_34_arg_0 = state_9; [L146] SORT_5 var_34_arg_1 = var_8; [L147] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L148] SORT_3 var_35_arg_0 = var_33; [L149] SORT_3 var_35_arg_1 = var_34; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_35_arg_0=1, var_35_arg_1=1, var_40=1, var_8=0] [L150] EXPR var_35_arg_0 | var_35_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L150] SORT_3 var_35 = var_35_arg_0 | var_35_arg_1; [L151] SORT_3 var_36_arg_0 = var_31; [L152] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_36_arg_0=-2, var_36_arg_1=1, var_40=1, var_8=0] [L153] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L153] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L154] SORT_3 var_37_arg_0 = var_27; [L155] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_37_arg_0=256, var_37_arg_1=254, var_40=1, var_8=0] [L156] EXPR var_37_arg_0 & var_37_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L156] SORT_3 var_37 = var_37_arg_0 & var_37_arg_1; [L157] SORT_3 var_41_arg_0 = var_37; [L158] SORT_3 var_41 = ~var_41_arg_0; [L159] SORT_3 var_42_arg_0 = var_40; [L160] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_42_arg_0=1, var_42_arg_1=-1, var_8=0] [L161] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L161] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L162] EXPR var_42 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L162] var_42 = var_42 & mask_SORT_3 [L163] SORT_3 bad_43_arg_0 = var_42; [L164] CALL __VERIFIER_assert(!(bad_43_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 159 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3651 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3651 mSDsluCounter, 39289 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33901 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4467 IncrementalHoareTripleChecker+Invalid, 4497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 5388 mSDtfsCounter, 4467 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=22, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 553 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 6024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 06:12:26,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:12:29,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:12:29,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:12:29,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:12:29,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:12:29,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:12:29,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:12:29,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:12:29,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:12:29,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:12:29,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:12:29,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:12:29,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:12:29,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:12:29,275 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:12:29,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:12:29,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:12:29,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:12:29,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:12:29,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:12:29,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:12:29,281 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:12:29,281 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:12:29,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:12:29,282 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:12:29,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:12:29,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:12:29,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:12:29,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:12:29,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:12:29,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:12:29,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:12:29,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:12:29,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:12:29,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:12:29,286 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:12:29,286 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:12:29,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:12:29,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:12:29,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:12:29,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:12:29,288 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:12:29,288 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2024-10-11 06:12:29,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:12:29,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:12:29,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:12:29,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:12:29,689 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:12:29,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-10-11 06:12:31,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:12:31,629 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:12:31,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-10-11 06:12:31,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f95d3b33a/5a5f517cdd5c43a2901dd261a4f4bc01/FLAG8cd81a3f5 [2024-10-11 06:12:31,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f95d3b33a/5a5f517cdd5c43a2901dd261a4f4bc01 [2024-10-11 06:12:31,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:12:31,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:12:31,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:12:31,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:12:31,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:12:31,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:31" (1/1) ... [2024-10-11 06:12:31,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61457387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:31, skipping insertion in model container [2024-10-11 06:12:31,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:31" (1/1) ... [2024-10-11 06:12:31,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:12:31,881 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/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-10-11 06:12:31,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:12:32,005 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:12:32,020 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/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-10-11 06:12:32,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:12:32,106 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:12:32,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32 WrapperNode [2024-10-11 06:12:32,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:12:32,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:12:32,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:12:32,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:12:32,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,179 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 286 [2024-10-11 06:12:32,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:12:32,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:12:32,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:12:32,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:12:32,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,249 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 06:12:32,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:12:32,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:12:32,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:12:32,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:12:32,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (1/1) ... [2024-10-11 06:12:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:12:32,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:12:32,345 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 06:12:32,352 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 06:12:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:12:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:12:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:12:32,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:12:32,562 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:12:32,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:12:33,017 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-11 06:12:33,017 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:12:33,075 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:12:33,076 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:12:33,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:33 BoogieIcfgContainer [2024-10-11 06:12:33,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:12:33,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:12:33,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:12:33,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:12:33,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:12:31" (1/3) ... [2024-10-11 06:12:33,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fa670b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:33, skipping insertion in model container [2024-10-11 06:12:33,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:32" (2/3) ... [2024-10-11 06:12:33,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fa670b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:33, skipping insertion in model container [2024-10-11 06:12:33,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:33" (3/3) ... [2024-10-11 06:12:33,088 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2024-10-11 06:12:33,105 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:12:33,105 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:12:33,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:12:33,170 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;@35413986, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:12:33,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:12:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:12:33,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:12:33,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:12:33,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:12:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:12:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:12:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:12:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079939011] [2024-10-11 06:12:33,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:12:33,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:12:33,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:12:33,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:12:33,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:12:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:12:33,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 06:12:33,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:12:33,749 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 06:12:33,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:12:33,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:12:33,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079939011] [2024-10-11 06:12:33,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079939011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:12:33,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:12:33,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:12:33,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634744139] [2024-10-11 06:12:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:12:33,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:12:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:12:33,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:12:33,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:12:33,791 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:12:33,879 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2024-10-11 06:12:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:12:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:12:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:12:33,890 INFO L225 Difference]: With dead ends: 13 [2024-10-11 06:12:33,890 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 06:12:33,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:12:33,898 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:12:33,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:12:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 06:12:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 06:12:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 06:12:33,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2024-10-11 06:12:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:12:33,924 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 06:12:33,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:12:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 06:12:33,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 06:12:33,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:12:33,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 06:12:34,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:12:34,137 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-11 06:12:34,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 06:12:34,148 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:12:34,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:12:34 BoogieIcfgContainer [2024-10-11 06:12:34,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:12:34,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:12:34,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:12:34,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:12:34,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:33" (3/4) ... [2024-10-11 06:12:34,160 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 06:12:34,175 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 06:12:34,176 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 06:12:34,176 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 06:12:34,177 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 06:12:34,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 06:12:34,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 06:12:34,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:12:34,315 INFO L158 Benchmark]: Toolchain (without parser) took 2659.28ms. Allocated memory was 73.4MB in the beginning and 138.4MB in the end (delta: 65.0MB). Free memory was 35.4MB in the beginning and 67.0MB in the end (delta: -31.6MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-10-11 06:12:34,315 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:12:34,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.52ms. Allocated memory is still 73.4MB. Free memory was 35.2MB in the beginning and 36.9MB in the end (delta: -1.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-11 06:12:34,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.70ms. Allocated memory is still 73.4MB. Free memory was 36.9MB in the beginning and 33.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 06:12:34,317 INFO L158 Benchmark]: Boogie Preprocessor took 110.88ms. Allocated memory was 73.4MB in the beginning and 138.4MB in the end (delta: 65.0MB). Free memory was 33.8MB in the beginning and 116.3MB in the end (delta: -82.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 06:12:34,317 INFO L158 Benchmark]: RCFGBuilder took 784.88ms. Allocated memory is still 138.4MB. Free memory was 116.3MB in the beginning and 112.5MB in the end (delta: 3.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-10-11 06:12:34,317 INFO L158 Benchmark]: TraceAbstraction took 1076.40ms. Allocated memory is still 138.4MB. Free memory was 111.7MB in the beginning and 74.3MB in the end (delta: 37.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-10-11 06:12:34,318 INFO L158 Benchmark]: Witness Printer took 156.90ms. Allocated memory is still 138.4MB. Free memory was 74.3MB in the beginning and 67.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 06:12:34,319 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.52ms. Allocated memory is still 73.4MB. Free memory was 35.2MB in the beginning and 36.9MB in the end (delta: -1.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.70ms. Allocated memory is still 73.4MB. Free memory was 36.9MB in the beginning and 33.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.88ms. Allocated memory was 73.4MB in the beginning and 138.4MB in the end (delta: 65.0MB). Free memory was 33.8MB in the beginning and 116.3MB in the end (delta: -82.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 784.88ms. Allocated memory is still 138.4MB. Free memory was 116.3MB in the beginning and 112.5MB in the end (delta: 3.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1076.40ms. Allocated memory is still 138.4MB. Free memory was 111.7MB in the beginning and 74.3MB in the end (delta: 37.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 156.90ms. Allocated memory is still 138.4MB. Free memory was 74.3MB in the beginning and 67.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 4 NumberOfNonLiveVariables, 96 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-11 06:12:34,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE