./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label27.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f2d01fae317b054ddf6fc311dfbe1142cfd4012ffbce2b7f37ce8e1b21b188d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:46:29,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:46:29,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:46:29,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:46:29,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:46:29,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:46:29,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:46:29,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:46:29,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:46:29,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:46:29,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:46:29,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:46:29,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:46:29,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:46:29,924 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:46:29,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:46:29,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:46:29,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:46:29,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:46:29,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:46:29,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:46:29,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:46:29,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:46:29,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:46:29,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:46:29,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:46:29,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:46:29,929 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:46:29,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:46:29,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:46:29,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:46:29,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:46:29,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:46:29,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:46:29,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:46:29,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:46:29,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:46:29,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:46:29,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:46:29,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:46:29,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:46:29,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:46:29,934 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f2d01fae317b054ddf6fc311dfbe1142cfd4012ffbce2b7f37ce8e1b21b188d [2024-10-10 23:46:30,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:46:30,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:46:30,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:46:30,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:46:30,240 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:46:30,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label27.c [2024-10-10 23:46:31,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:46:32,129 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:46:32,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label27.c [2024-10-10 23:46:32,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a2d199711/d01be31b47464c6d996ae01a9ce36de1/FLAG0a5fdb1e8 [2024-10-10 23:46:32,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a2d199711/d01be31b47464c6d996ae01a9ce36de1 [2024-10-10 23:46:32,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:46:32,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:46:32,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:46:32,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:46:32,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:46:32,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:46:32" (1/1) ... [2024-10-10 23:46:32,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fb002d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:32, skipping insertion in model container [2024-10-10 23:46:32,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:46:32" (1/1) ... [2024-10-10 23:46:32,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:46:32,529 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/eca-rers2012/Problem17_label27.c[6203,6216] [2024-10-10 23:46:33,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:46:33,106 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:46:33,133 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/eca-rers2012/Problem17_label27.c[6203,6216] [2024-10-10 23:46:33,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:46:33,415 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:46:33,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33 WrapperNode [2024-10-10 23:46:33,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:46:33,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:46:33,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:46:33,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:46:33,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:33,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:33,891 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:46:33,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:46:33,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:46:33,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:46:33,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:46:33,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:33,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,129 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-10 23:46:34,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:46:34,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:46:34,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:46:34,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:46:34,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (1/1) ... [2024-10-10 23:46:34,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:46:34,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:34,397 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-10 23:46:34,402 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-10 23:46:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:46:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:46:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:46:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:46:34,506 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:46:34,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:46:37,717 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:46:37,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:46:37,776 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:46:37,783 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:46:37,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:46:37 BoogieIcfgContainer [2024-10-10 23:46:37,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:46:37,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:46:37,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:46:37,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:46:37,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:46:32" (1/3) ... [2024-10-10 23:46:37,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a23b3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:46:37, skipping insertion in model container [2024-10-10 23:46:37,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:33" (2/3) ... [2024-10-10 23:46:37,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a23b3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:46:37, skipping insertion in model container [2024-10-10 23:46:37,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:46:37" (3/3) ... [2024-10-10 23:46:37,798 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label27.c [2024-10-10 23:46:37,813 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:46:37,814 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:46:37,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:46:37,894 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;@1987f31f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:46:37,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:46:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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-10 23:46:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 23:46:37,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:37,909 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-10 23:46:37,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:37,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2135968835, now seen corresponding path program 1 times [2024-10-10 23:46:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:37,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478156869] [2024-10-10 23:46:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:38,112 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-10 23:46:38,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478156869] [2024-10-10 23:46:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478156869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:38,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678656539] [2024-10-10 23:46:38,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:38,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:46:38,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:38,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:46:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:46:38,148 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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 2 states, 2 states have (on average 20.0) internal successors, (40), 2 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-10 23:46:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:38,231 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:46:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:46:38,237 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 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-10 23:46:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:38,254 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:46:38,254 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:46:38,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:46:38,262 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:38,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:46:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:46:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:46:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 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-10 23:46:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:46:38,325 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 40 [2024-10-10 23:46:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:38,325 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:46:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 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-10 23:46:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:46:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 23:46:38,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:38,327 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-10 23:46:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:46:38,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -271214799, now seen corresponding path program 1 times [2024-10-10 23:46:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139761133] [2024-10-10 23:46:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:38,508 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-10 23:46:38,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139761133] [2024-10-10 23:46:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139761133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:38,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064274565] [2024-10-10 23:46:38,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:38,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:38,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:38,513 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 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-10 23:46:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:40,775 INFO L93 Difference]: Finished difference Result 1535 states and 2741 transitions. [2024-10-10 23:46:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:40,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 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-10 23:46:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:40,782 INFO L225 Difference]: With dead ends: 1535 [2024-10-10 23:46:40,782 INFO L226 Difference]: Without dead ends: 1010 [2024-10-10 23:46:40,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:46:40,786 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 492 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:40,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 197 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:46:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-10-10 23:46:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 995. [2024-10-10 23:46:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.7364185110663983) internal successors, (1726), 994 states have internal predecessors, (1726), 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-10 23:46:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1726 transitions. [2024-10-10 23:46:40,820 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1726 transitions. Word has length 40 [2024-10-10 23:46:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:40,820 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1726 transitions. [2024-10-10 23:46:40,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 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-10 23:46:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1726 transitions. [2024-10-10 23:46:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-10 23:46:40,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:40,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:40,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:46:40,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1397875995, now seen corresponding path program 1 times [2024-10-10 23:46:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042329309] [2024-10-10 23:46:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:41,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042329309] [2024-10-10 23:46:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042329309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:41,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802176599] [2024-10-10 23:46:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:41,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:41,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:41,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:41,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:41,046 INFO L87 Difference]: Start difference. First operand 995 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-10 23:46:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:43,215 INFO L93 Difference]: Finished difference Result 2870 states and 5024 transitions. [2024-10-10 23:46:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:43,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-10-10 23:46:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:43,224 INFO L225 Difference]: With dead ends: 2870 [2024-10-10 23:46:43,225 INFO L226 Difference]: Without dead ends: 1876 [2024-10-10 23:46:43,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:46:43,228 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:43,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 518 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:46:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2024-10-10 23:46:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1869. [2024-10-10 23:46:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1868 states have (on average 1.4721627408993576) internal successors, (2750), 1868 states have internal predecessors, (2750), 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-10 23:46:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2750 transitions. [2024-10-10 23:46:43,276 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2750 transitions. Word has length 105 [2024-10-10 23:46:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:43,277 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2750 transitions. [2024-10-10 23:46:43,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-10 23:46:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2750 transitions. [2024-10-10 23:46:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-10 23:46:43,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:43,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:43,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:46:43,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:43,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1371657092, now seen corresponding path program 1 times [2024-10-10 23:46:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:43,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106853758] [2024-10-10 23:46:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:43,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106853758] [2024-10-10 23:46:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106853758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:43,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:43,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510636948] [2024-10-10 23:46:43,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:43,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:43,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:43,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:43,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:43,539 INFO L87 Difference]: Start difference. First operand 1869 states and 2750 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-10 23:46:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:45,965 INFO L93 Difference]: Finished difference Result 5453 states and 8038 transitions. [2024-10-10 23:46:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:45,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 110 [2024-10-10 23:46:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:45,978 INFO L225 Difference]: With dead ends: 5453 [2024-10-10 23:46:45,979 INFO L226 Difference]: Without dead ends: 3585 [2024-10-10 23:46:45,982 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-10 23:46:45,983 INFO L432 NwaCegarLoop]: 844 mSDtfsCounter, 453 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:45,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 911 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:46:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2024-10-10 23:46:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3582. [2024-10-10 23:46:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 3581 states have (on average 1.3356604300474728) internal successors, (4783), 3581 states have internal predecessors, (4783), 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-10 23:46:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4783 transitions. [2024-10-10 23:46:46,049 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4783 transitions. Word has length 110 [2024-10-10 23:46:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:46,051 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 4783 transitions. [2024-10-10 23:46:46,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-10 23:46:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4783 transitions. [2024-10-10 23:46:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-10 23:46:46,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:46,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:46,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:46:46,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:46,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1389949983, now seen corresponding path program 1 times [2024-10-10 23:46:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:46,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160373292] [2024-10-10 23:46:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:46,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160373292] [2024-10-10 23:46:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160373292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:46,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:46,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:46,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570371273] [2024-10-10 23:46:46,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:46,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:46,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:46,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:46,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:46,287 INFO L87 Difference]: Start difference. First operand 3582 states and 4783 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-10 23:46:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:48,125 INFO L93 Difference]: Finished difference Result 10570 states and 14107 transitions. [2024-10-10 23:46:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:48,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 151 [2024-10-10 23:46:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:48,145 INFO L225 Difference]: With dead ends: 10570 [2024-10-10 23:46:48,145 INFO L226 Difference]: Without dead ends: 5285 [2024-10-10 23:46:48,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 23:46:48,154 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:48,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:46:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2024-10-10 23:46:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 4433. [2024-10-10 23:46:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4433 states, 4432 states have (on average 1.2091606498194947) internal successors, (5359), 4432 states have internal predecessors, (5359), 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-10 23:46:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 5359 transitions. [2024-10-10 23:46:48,235 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 5359 transitions. Word has length 151 [2024-10-10 23:46:48,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:48,236 INFO L471 AbstractCegarLoop]: Abstraction has 4433 states and 5359 transitions. [2024-10-10 23:46:48,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-10 23:46:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 5359 transitions. [2024-10-10 23:46:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-10 23:46:48,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:48,239 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:48,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:46:48,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash -52093746, now seen corresponding path program 1 times [2024-10-10 23:46:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:48,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945154995] [2024-10-10 23:46:48,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:48,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945154995] [2024-10-10 23:46:48,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945154995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:48,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:48,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:48,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324051677] [2024-10-10 23:46:48,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:48,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:48,518 INFO L87 Difference]: Start difference. First operand 4433 states and 5359 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-10 23:46:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:50,000 INFO L93 Difference]: Finished difference Result 11413 states and 14014 transitions. [2024-10-10 23:46:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:50,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 192 [2024-10-10 23:46:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:50,027 INFO L225 Difference]: With dead ends: 11413 [2024-10-10 23:46:50,027 INFO L226 Difference]: Without dead ends: 6981 [2024-10-10 23:46:50,035 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-10 23:46:50,038 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:50,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:46:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2024-10-10 23:46:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 6981. [2024-10-10 23:46:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6981 states, 6980 states have (on average 1.1835243553008596) internal successors, (8261), 6980 states have internal predecessors, (8261), 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-10 23:46:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 8261 transitions. [2024-10-10 23:46:50,162 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 8261 transitions. Word has length 192 [2024-10-10 23:46:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:50,162 INFO L471 AbstractCegarLoop]: Abstraction has 6981 states and 8261 transitions. [2024-10-10 23:46:50,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-10 23:46:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 8261 transitions. [2024-10-10 23:46:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-10 23:46:50,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:50,169 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:50,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:46:50,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:50,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1338633553, now seen corresponding path program 1 times [2024-10-10 23:46:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:50,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797033183] [2024-10-10 23:46:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-10 23:46:50,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:50,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797033183] [2024-10-10 23:46:50,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797033183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:50,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:50,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:50,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714114906] [2024-10-10 23:46:50,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:50,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:50,373 INFO L87 Difference]: Start difference. First operand 6981 states and 8261 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-10 23:46:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:51,913 INFO L93 Difference]: Finished difference Result 17787 states and 21272 transitions. [2024-10-10 23:46:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:51,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 272 [2024-10-10 23:46:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:51,949 INFO L225 Difference]: With dead ends: 17787 [2024-10-10 23:46:51,950 INFO L226 Difference]: Without dead ends: 9957 [2024-10-10 23:46:51,960 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-10 23:46:51,961 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 384 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:51,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 855 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:46:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2024-10-10 23:46:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 9957. [2024-10-10 23:46:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9957 states, 9956 states have (on average 1.1449377259943752) internal successors, (11399), 9956 states have internal predecessors, (11399), 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-10 23:46:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9957 states to 9957 states and 11399 transitions. [2024-10-10 23:46:52,125 INFO L78 Accepts]: Start accepts. Automaton has 9957 states and 11399 transitions. Word has length 272 [2024-10-10 23:46:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:52,125 INFO L471 AbstractCegarLoop]: Abstraction has 9957 states and 11399 transitions. [2024-10-10 23:46:52,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-10 23:46:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 9957 states and 11399 transitions. [2024-10-10 23:46:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-10-10 23:46:52,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:52,131 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:52,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:46:52,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:52,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2006967892, now seen corresponding path program 1 times [2024-10-10 23:46:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311922556] [2024-10-10 23:46:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:46:52,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:52,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311922556] [2024-10-10 23:46:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311922556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:52,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:52,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209615261] [2024-10-10 23:46:52,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:52,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:52,338 INFO L87 Difference]: Start difference. First operand 9957 states and 11399 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-10 23:46:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:53,883 INFO L93 Difference]: Finished difference Result 24167 states and 28008 transitions. [2024-10-10 23:46:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 312 [2024-10-10 23:46:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:53,911 INFO L225 Difference]: With dead ends: 24167 [2024-10-10 23:46:53,911 INFO L226 Difference]: Without dead ends: 14211 [2024-10-10 23:46:53,924 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-10 23:46:53,924 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 446 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:53,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 369 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:46:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14211 states. [2024-10-10 23:46:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14211 to 13350. [2024-10-10 23:46:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13350 states, 13349 states have (on average 1.1481758933253428) internal successors, (15327), 13349 states have internal predecessors, (15327), 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-10 23:46:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 15327 transitions. [2024-10-10 23:46:54,192 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 15327 transitions. Word has length 312 [2024-10-10 23:46:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:54,192 INFO L471 AbstractCegarLoop]: Abstraction has 13350 states and 15327 transitions. [2024-10-10 23:46:54,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-10 23:46:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 15327 transitions. [2024-10-10 23:46:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-10-10 23:46:54,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:54,205 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:46:54,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:46:54,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:54,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash 907737516, now seen corresponding path program 1 times [2024-10-10 23:46:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:54,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60923190] [2024-10-10 23:46:54,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:54,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:54,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:54,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60923190] [2024-10-10 23:46:54,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60923190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:54,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:54,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:54,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439332571] [2024-10-10 23:46:54,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:54,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:54,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:54,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:46:54,690 INFO L87 Difference]: Start difference. First operand 13350 states and 15327 transitions. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 3 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-10 23:46:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:57,159 INFO L93 Difference]: Finished difference Result 33116 states and 38116 transitions. [2024-10-10 23:46:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 3 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) Word has length 379 [2024-10-10 23:46:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:57,202 INFO L225 Difference]: With dead ends: 33116 [2024-10-10 23:46:57,202 INFO L226 Difference]: Without dead ends: 19342 [2024-10-10 23:46:57,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10 23:46:57,223 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 635 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:57,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 233 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:46:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19342 states. [2024-10-10 23:46:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19342 to 19338. [2024-10-10 23:46:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19338 states, 19337 states have (on average 1.1557635620830533) internal successors, (22349), 19337 states have internal predecessors, (22349), 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-10 23:46:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19338 states to 19338 states and 22349 transitions. [2024-10-10 23:46:57,643 INFO L78 Accepts]: Start accepts. Automaton has 19338 states and 22349 transitions. Word has length 379 [2024-10-10 23:46:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:57,644 INFO L471 AbstractCegarLoop]: Abstraction has 19338 states and 22349 transitions. [2024-10-10 23:46:57,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 3 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-10 23:46:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19338 states and 22349 transitions. [2024-10-10 23:46:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-10-10 23:46:57,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:57,658 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:57,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:46:57,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:57,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash -149965086, now seen corresponding path program 1 times [2024-10-10 23:46:57,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:57,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406014645] [2024-10-10 23:46:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-10 23:46:57,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:57,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406014645] [2024-10-10 23:46:57,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406014645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:57,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024667641] [2024-10-10 23:46:57,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:57,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:57,978 INFO L87 Difference]: Start difference. First operand 19338 states and 22349 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 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-10 23:46:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:59,770 INFO L93 Difference]: Finished difference Result 50179 states and 57999 transitions. [2024-10-10 23:46:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 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) Word has length 401 [2024-10-10 23:46:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:59,819 INFO L225 Difference]: With dead ends: 50179 [2024-10-10 23:46:59,819 INFO L226 Difference]: Without dead ends: 30842 [2024-10-10 23:46:59,843 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-10 23:46:59,844 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 503 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:59,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 268 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:46:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30842 states. [2024-10-10 23:47:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30842 to 30823. [2024-10-10 23:47:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30823 states, 30822 states have (on average 1.1411005126208553) internal successors, (35171), 30822 states have internal predecessors, (35171), 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-10 23:47:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30823 states to 30823 states and 35171 transitions. [2024-10-10 23:47:00,326 INFO L78 Accepts]: Start accepts. Automaton has 30823 states and 35171 transitions. Word has length 401 [2024-10-10 23:47:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:00,327 INFO L471 AbstractCegarLoop]: Abstraction has 30823 states and 35171 transitions. [2024-10-10 23:47:00,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 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-10 23:47:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 30823 states and 35171 transitions. [2024-10-10 23:47:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-10-10 23:47:00,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:00,341 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:47:00,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:47:00,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:00,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1842428963, now seen corresponding path program 1 times [2024-10-10 23:47:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207451376] [2024-10-10 23:47:00,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 222 proven. 82 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-10 23:47:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207451376] [2024-10-10 23:47:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207451376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:47:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392381551] [2024-10-10 23:47:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:47:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:47:00,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:47:00,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:47:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:01,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:47:01,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:47:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 222 proven. 82 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-10 23:47:01,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:47:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-10 23:47:02,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392381551] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:47:02,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:47:02,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:47:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574140155] [2024-10-10 23:47:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:02,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:02,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:02,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:02,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:47:02,031 INFO L87 Difference]: Start difference. First operand 30823 states and 35171 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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-10 23:47:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:04,823 INFO L93 Difference]: Finished difference Result 88938 states and 101083 transitions. [2024-10-10 23:47:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:04,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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 408 [2024-10-10 23:47:04,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:04,902 INFO L225 Difference]: With dead ends: 88938 [2024-10-10 23:47:04,902 INFO L226 Difference]: Without dead ends: 56412 [2024-10-10 23:47:04,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:47:04,937 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 769 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:04,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 192 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:47:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56412 states. [2024-10-10 23:47:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56412 to 52152. [2024-10-10 23:47:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52152 states, 52151 states have (on average 1.1363156986443212) internal successors, (59260), 52151 states have internal predecessors, (59260), 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-10 23:47:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52152 states to 52152 states and 59260 transitions. [2024-10-10 23:47:05,900 INFO L78 Accepts]: Start accepts. Automaton has 52152 states and 59260 transitions. Word has length 408 [2024-10-10 23:47:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:05,902 INFO L471 AbstractCegarLoop]: Abstraction has 52152 states and 59260 transitions. [2024-10-10 23:47:05,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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-10 23:47:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52152 states and 59260 transitions. [2024-10-10 23:47:05,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-10-10 23:47:05,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:05,921 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:47:05,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:47:06,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:47:06,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:06,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1210717540, now seen corresponding path program 1 times [2024-10-10 23:47:06,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:06,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889534574] [2024-10-10 23:47:06,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:06,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:47:06,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889534574] [2024-10-10 23:47:06,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889534574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:06,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:06,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650439585] [2024-10-10 23:47:06,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:06,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:06,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:06,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:06,377 INFO L87 Difference]: Start difference. First operand 52152 states and 59260 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 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-10 23:47:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:08,345 INFO L93 Difference]: Finished difference Result 118760 states and 135001 transitions. [2024-10-10 23:47:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:08,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 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) Word has length 444 [2024-10-10 23:47:08,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:08,431 INFO L225 Difference]: With dead ends: 118760 [2024-10-10 23:47:08,432 INFO L226 Difference]: Without dead ends: 60214 [2024-10-10 23:47:08,474 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-10 23:47:08,475 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 498 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:08,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 745 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:47:08,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60214 states. [2024-10-10 23:47:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60214 to 60206. [2024-10-10 23:47:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60206 states, 60205 states have (on average 1.120006643966448) internal successors, (67430), 60205 states have internal predecessors, (67430), 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-10 23:47:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60206 states to 60206 states and 67430 transitions. [2024-10-10 23:47:09,373 INFO L78 Accepts]: Start accepts. Automaton has 60206 states and 67430 transitions. Word has length 444 [2024-10-10 23:47:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:09,374 INFO L471 AbstractCegarLoop]: Abstraction has 60206 states and 67430 transitions. [2024-10-10 23:47:09,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 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-10 23:47:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 60206 states and 67430 transitions. [2024-10-10 23:47:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2024-10-10 23:47:09,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:09,386 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:09,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:47:09,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:09,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1072636296, now seen corresponding path program 1 times [2024-10-10 23:47:09,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:09,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143255287] [2024-10-10 23:47:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-10 23:47:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:10,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143255287] [2024-10-10 23:47:10,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143255287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:10,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:47:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426292655] [2024-10-10 23:47:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:10,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:10,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:10,241 INFO L87 Difference]: Start difference. First operand 60206 states and 67430 transitions. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-10 23:47:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:13,243 INFO L93 Difference]: Finished difference Result 157942 states and 176489 transitions. [2024-10-10 23:47:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:13,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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 446 [2024-10-10 23:47:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:13,351 INFO L225 Difference]: With dead ends: 157942 [2024-10-10 23:47:13,351 INFO L226 Difference]: Without dead ends: 97737 [2024-10-10 23:47:13,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10 23:47:13,381 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 768 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:13,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 178 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:47:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97737 states. [2024-10-10 23:47:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97737 to 93050. [2024-10-10 23:47:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93050 states, 93049 states have (on average 1.1130802050532516) internal successors, (103571), 93049 states have internal predecessors, (103571), 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-10 23:47:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93050 states to 93050 states and 103571 transitions. [2024-10-10 23:47:15,031 INFO L78 Accepts]: Start accepts. Automaton has 93050 states and 103571 transitions. Word has length 446 [2024-10-10 23:47:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:15,032 INFO L471 AbstractCegarLoop]: Abstraction has 93050 states and 103571 transitions. [2024-10-10 23:47:15,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-10 23:47:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 93050 states and 103571 transitions. [2024-10-10 23:47:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-10-10 23:47:15,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:15,049 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:47:15,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:47:15,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:15,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:15,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2076442692, now seen corresponding path program 1 times [2024-10-10 23:47:15,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279785185] [2024-10-10 23:47:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:47:15,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:15,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279785185] [2024-10-10 23:47:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279785185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:15,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:15,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:47:15,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128486693] [2024-10-10 23:47:15,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:15,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:15,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:15,554 INFO L87 Difference]: Start difference. First operand 93050 states and 103571 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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-10 23:47:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:18,216 INFO L93 Difference]: Finished difference Result 201069 states and 223015 transitions. [2024-10-10 23:47:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:18,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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 448 [2024-10-10 23:47:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:18,374 INFO L225 Difference]: With dead ends: 201069 [2024-10-10 23:47:18,374 INFO L226 Difference]: Without dead ends: 108020 [2024-10-10 23:47:18,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10 23:47:18,424 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 866 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:18,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 801 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:47:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108020 states. [2024-10-10 23:47:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108020 to 93050. [2024-10-10 23:47:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93050 states, 93049 states have (on average 1.1127148061773904) internal successors, (103537), 93049 states have internal predecessors, (103537), 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-10 23:47:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93050 states to 93050 states and 103537 transitions. [2024-10-10 23:47:19,950 INFO L78 Accepts]: Start accepts. Automaton has 93050 states and 103537 transitions. Word has length 448 [2024-10-10 23:47:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:19,951 INFO L471 AbstractCegarLoop]: Abstraction has 93050 states and 103537 transitions. [2024-10-10 23:47:19,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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-10 23:47:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 93050 states and 103537 transitions. [2024-10-10 23:47:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-10-10 23:47:19,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:19,964 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:19,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:47:19,964 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:19,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1813964162, now seen corresponding path program 1 times [2024-10-10 23:47:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:19,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551962319] [2024-10-10 23:47:19,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:19,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-10 23:47:21,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551962319] [2024-10-10 23:47:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551962319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:21,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784161397] [2024-10-10 23:47:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:21,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:21,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:21,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:21,032 INFO L87 Difference]: Start difference. First operand 93050 states and 103537 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-10 23:47:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:23,074 INFO L93 Difference]: Finished difference Result 193776 states and 215975 transitions. [2024-10-10 23:47:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:23,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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 489 [2024-10-10 23:47:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:23,186 INFO L225 Difference]: With dead ends: 193776 [2024-10-10 23:47:23,186 INFO L226 Difference]: Without dead ends: 100297 [2024-10-10 23:47:23,209 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-10 23:47:23,209 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 336 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:23,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 793 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:47:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100297 states. [2024-10-10 23:47:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100297 to 96886. [2024-10-10 23:47:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96886 states, 96885 states have (on average 1.1097383495897197) internal successors, (107517), 96885 states have internal predecessors, (107517), 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-10 23:47:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96886 states to 96886 states and 107517 transitions. [2024-10-10 23:47:24,577 INFO L78 Accepts]: Start accepts. Automaton has 96886 states and 107517 transitions. Word has length 489 [2024-10-10 23:47:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:24,577 INFO L471 AbstractCegarLoop]: Abstraction has 96886 states and 107517 transitions. [2024-10-10 23:47:24,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-10 23:47:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 96886 states and 107517 transitions. [2024-10-10 23:47:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-10-10 23:47:24,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:24,589 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:47:24,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:47:24,590 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:24,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash 720669314, now seen corresponding path program 1 times [2024-10-10 23:47:24,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:24,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915593799] [2024-10-10 23:47:24,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 307 proven. 82 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-10 23:47:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:26,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915593799] [2024-10-10 23:47:26,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915593799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:47:26,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156321535] [2024-10-10 23:47:26,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:26,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:47:26,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:47:26,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:47:26,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:47:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:26,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:47:26,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:47:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:47:26,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:47:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156321535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:26,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:47:26,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:47:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17179898] [2024-10-10 23:47:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:26,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:47:26,501 INFO L87 Difference]: Start difference. First operand 96886 states and 107517 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-10 23:47:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:28,638 INFO L93 Difference]: Finished difference Result 207844 states and 231024 transitions. [2024-10-10 23:47:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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 502 [2024-10-10 23:47:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:28,773 INFO L225 Difference]: With dead ends: 207844 [2024-10-10 23:47:28,773 INFO L226 Difference]: Without dead ends: 106271 [2024-10-10 23:47:28,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:47:28,836 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 490 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:28,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 666 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:47:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106271 states. [2024-10-10 23:47:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106271 to 106261. [2024-10-10 23:47:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106261 states, 106260 states have (on average 1.1102766798418973) internal successors, (117978), 106260 states have internal predecessors, (117978), 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-10 23:47:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106261 states to 106261 states and 117978 transitions. [2024-10-10 23:47:30,477 INFO L78 Accepts]: Start accepts. Automaton has 106261 states and 117978 transitions. Word has length 502 [2024-10-10 23:47:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 106261 states and 117978 transitions. [2024-10-10 23:47:30,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-10 23:47:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 106261 states and 117978 transitions. [2024-10-10 23:47:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-10-10 23:47:30,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:30,490 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:30,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:47:30,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:47:30,691 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:30,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1945366806, now seen corresponding path program 1 times [2024-10-10 23:47:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:30,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074068470] [2024-10-10 23:47:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-10 23:47:31,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:31,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074068470] [2024-10-10 23:47:31,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074068470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:31,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:31,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:31,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108178095] [2024-10-10 23:47:31,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:31,500 INFO L87 Difference]: Start difference. First operand 106261 states and 117978 transitions. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-10 23:47:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:33,783 INFO L93 Difference]: Finished difference Result 226573 states and 251581 transitions. [2024-10-10 23:47:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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 517 [2024-10-10 23:47:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:33,941 INFO L225 Difference]: With dead ends: 226573 [2024-10-10 23:47:33,941 INFO L226 Difference]: Without dead ends: 120313 [2024-10-10 23:47:33,975 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-10 23:47:33,975 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 345 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:33,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 358 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:47:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120313 states. [2024-10-10 23:47:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120313 to 112217. [2024-10-10 23:47:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112217 states, 112216 states have (on average 1.1095298353176017) internal successors, (124507), 112216 states have internal predecessors, (124507), 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-10 23:47:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112217 states to 112217 states and 124507 transitions. [2024-10-10 23:47:35,580 INFO L78 Accepts]: Start accepts. Automaton has 112217 states and 124507 transitions. Word has length 517 [2024-10-10 23:47:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:35,581 INFO L471 AbstractCegarLoop]: Abstraction has 112217 states and 124507 transitions. [2024-10-10 23:47:35,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-10 23:47:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 112217 states and 124507 transitions. [2024-10-10 23:47:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2024-10-10 23:47:35,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:35,596 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:47:35,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:47:35,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:35,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:35,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1204172692, now seen corresponding path program 1 times [2024-10-10 23:47:35,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:35,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374730302] [2024-10-10 23:47:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-10-10 23:47:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374730302] [2024-10-10 23:47:36,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374730302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:36,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:36,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:36,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249686179] [2024-10-10 23:47:36,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:36,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:36,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:36,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:36,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:36,560 INFO L87 Difference]: Start difference. First operand 112217 states and 124507 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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-10 23:47:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:38,578 INFO L93 Difference]: Finished difference Result 232532 states and 257599 transitions. [2024-10-10 23:47:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 533 [2024-10-10 23:47:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:38,705 INFO L225 Difference]: With dead ends: 232532 [2024-10-10 23:47:38,705 INFO L226 Difference]: Without dead ends: 120316 [2024-10-10 23:47:38,740 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-10 23:47:38,741 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 419 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:38,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 347 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120316 states. [2024-10-10 23:47:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120316 to 112217. [2024-10-10 23:47:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112217 states, 112216 states have (on average 1.109369430384259) internal successors, (124489), 112216 states have internal predecessors, (124489), 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-10 23:47:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112217 states to 112217 states and 124489 transitions. [2024-10-10 23:47:40,379 INFO L78 Accepts]: Start accepts. Automaton has 112217 states and 124489 transitions. Word has length 533 [2024-10-10 23:47:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:40,380 INFO L471 AbstractCegarLoop]: Abstraction has 112217 states and 124489 transitions. [2024-10-10 23:47:40,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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-10 23:47:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 112217 states and 124489 transitions. [2024-10-10 23:47:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2024-10-10 23:47:40,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:40,399 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:40,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:47:40,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1309020069, now seen corresponding path program 1 times [2024-10-10 23:47:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606384873] [2024-10-10 23:47:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-10-10 23:47:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606384873] [2024-10-10 23:47:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606384873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:41,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715377869] [2024-10-10 23:47:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:41,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:41,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:41,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:41,369 INFO L87 Difference]: Start difference. First operand 112217 states and 124489 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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)