./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label17.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:49:22,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:49:22,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:49:22,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:49:22,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:49:22,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:49:22,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:49:22,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:49:22,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:49:22,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:49:22,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:49:22,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:49:22,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:49:22,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:49:22,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:49:22,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:49:22,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:49:22,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:49:22,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:49:22,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:49:22,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:49:22,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:49:22,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:49:22,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:49:22,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:49:22,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:49:22,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:49:22,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:49:22,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:49:22,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:49:22,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:49:22,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:49:22,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:49:22,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:49:22,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:49:22,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:49:22,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:49:22,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:49:22,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:49:22,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:49:22,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:49:22,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:49:22,983 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/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/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 -> a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd [2024-11-16 03:49:23,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:49:23,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:49:23,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:49:23,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:49:23,261 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:49:23,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2024-11-16 03:49:24,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:49:25,016 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:49:25,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2024-11-16 03:49:25,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5bb2f876/25ab4d4eba124720b40fccd16609f09c/FLAG19fc601eb [2024-11-16 03:49:25,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5bb2f876/25ab4d4eba124720b40fccd16609f09c [2024-11-16 03:49:25,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:49:25,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:49:25,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:49:25,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:49:25,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:49:25,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:25,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0489c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25, skipping insertion in model container [2024-11-16 03:49:25,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:25,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:49:25,640 WARN L250 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/Problem11_label17.c[5541,5554] [2024-11-16 03:49:25,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:49:25,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:49:25,862 WARN L250 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/Problem11_label17.c[5541,5554] [2024-11-16 03:49:25,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:49:25,990 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:49:25,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25 WrapperNode [2024-11-16 03:49:25,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:49:25,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:49:25,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:49:25,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:49:25,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,126 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-16 03:49:26,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:49:26,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:49:26,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:49:26,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:49:26,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,188 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-11-16 03:49:26,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:49:26,310 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:49:26,310 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:49:26,310 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:49:26,311 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (1/1) ... [2024-11-16 03:49:26,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:49:26,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:49:26,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:49:26,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:49:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:49:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:49:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:49:26,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:49:26,518 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:49:26,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:49:27,925 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-16 03:49:27,925 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:49:27,953 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:49:27,953 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:49:27,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:49:27 BoogieIcfgContainer [2024-11-16 03:49:27,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:49:27,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:49:27,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:49:27,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:49:27,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:49:25" (1/3) ... [2024-11-16 03:49:27,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a508fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:49:27, skipping insertion in model container [2024-11-16 03:49:27,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:25" (2/3) ... [2024-11-16 03:49:27,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a508fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:49:27, skipping insertion in model container [2024-11-16 03:49:27,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:49:27" (3/3) ... [2024-11-16 03:49:27,964 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label17.c [2024-11-16 03:49:27,980 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:49:27,981 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:49:28,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:49:28,092 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;@b60bbac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:49:28,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:49:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 1.7077464788732395) internal successors, (485), 285 states have internal predecessors, (485), 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-11-16 03:49:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 03:49:28,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:28,110 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-11-16 03:49:28,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:28,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash -128896568, now seen corresponding path program 1 times [2024-11-16 03:49:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047770943] [2024-11-16 03:49:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:49:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047770943] [2024-11-16 03:49:28,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047770943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:28,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:28,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:49:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165270750] [2024-11-16 03:49:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:28,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:28,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:28,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:28,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:28,513 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 1.7077464788732395) internal successors, (485), 285 states have internal predecessors, (485), 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 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-11-16 03:49:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:29,570 INFO L93 Difference]: Finished difference Result 775 states and 1366 transitions. [2024-11-16 03:49:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:29,573 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-11-16 03:49:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:29,590 INFO L225 Difference]: With dead ends: 775 [2024-11-16 03:49:29,591 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:49:29,594 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-11-16 03:49:29,597 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 202 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:29,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 168 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 03:49:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:49:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 415. [2024-11-16 03:49:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.5193236714975846) internal successors, (629), 414 states have internal predecessors, (629), 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-11-16 03:49:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 629 transitions. [2024-11-16 03:49:29,655 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 629 transitions. Word has length 40 [2024-11-16 03:49:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:29,656 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 629 transitions. [2024-11-16 03:49:29,656 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-11-16 03:49:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 629 transitions. [2024-11-16 03:49:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 03:49:29,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:29,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 03:49:29,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:49:29,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:29,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash -460210371, now seen corresponding path program 1 times [2024-11-16 03:49:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069393554] [2024-11-16 03:49:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:49:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:29,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069393554] [2024-11-16 03:49:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069393554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:29,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:29,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:49:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896773596] [2024-11-16 03:49:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:29,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:29,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:29,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:29,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:29,900 INFO L87 Difference]: Start difference. First operand 415 states and 629 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-11-16 03:49:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:30,592 INFO L93 Difference]: Finished difference Result 1207 states and 1837 transitions. [2024-11-16 03:49:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:30,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2024-11-16 03:49:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:30,597 INFO L225 Difference]: With dead ends: 1207 [2024-11-16 03:49:30,597 INFO L226 Difference]: Without dead ends: 794 [2024-11-16 03:49:30,599 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-11-16 03:49:30,600 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:30,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 180 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:49:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-16 03:49:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2024-11-16 03:49:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.3720050441361917) internal successors, (1088), 793 states have internal predecessors, (1088), 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-11-16 03:49:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1088 transitions. [2024-11-16 03:49:30,645 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1088 transitions. Word has length 107 [2024-11-16 03:49:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1088 transitions. [2024-11-16 03:49:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-11-16 03:49:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1088 transitions. [2024-11-16 03:49:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 03:49:30,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:30,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 03:49:30,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:49:30,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:30,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1249874637, now seen corresponding path program 1 times [2024-11-16 03:49:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440854212] [2024-11-16 03:49:30,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:49:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440854212] [2024-11-16 03:49:30,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440854212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:49:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022790702] [2024-11-16 03:49:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:30,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:30,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:30,995 INFO L87 Difference]: Start difference. First operand 794 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-11-16 03:49:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:31,683 INFO L93 Difference]: Finished difference Result 2328 states and 3195 transitions. [2024-11-16 03:49:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:31,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111 [2024-11-16 03:49:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:31,690 INFO L225 Difference]: With dead ends: 2328 [2024-11-16 03:49:31,691 INFO L226 Difference]: Without dead ends: 1536 [2024-11-16 03:49:31,692 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-11-16 03:49:31,693 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 119 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:31,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 197 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:49:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-16 03:49:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1535. [2024-11-16 03:49:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.2157757496740547) internal successors, (1865), 1534 states have internal predecessors, (1865), 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-11-16 03:49:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1865 transitions. [2024-11-16 03:49:31,721 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 1865 transitions. Word has length 111 [2024-11-16 03:49:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:31,721 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 1865 transitions. [2024-11-16 03:49:31,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-11-16 03:49:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1865 transitions. [2024-11-16 03:49:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 03:49:31,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:31,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 03:49:31,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:49:31,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1880317328, now seen corresponding path program 1 times [2024-11-16 03:49:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945277192] [2024-11-16 03:49:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:49:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945277192] [2024-11-16 03:49:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945277192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736682667] [2024-11-16 03:49:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:32,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:32,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:32,035 INFO L87 Difference]: Start difference. First operand 1535 states and 1865 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-11-16 03:49:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:32,790 INFO L93 Difference]: Finished difference Result 3276 states and 4142 transitions. [2024-11-16 03:49:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:32,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 168 [2024-11-16 03:49:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:32,798 INFO L225 Difference]: With dead ends: 3276 [2024-11-16 03:49:32,798 INFO L226 Difference]: Without dead ends: 1928 [2024-11-16 03:49:32,800 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-11-16 03:49:32,801 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 197 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:32,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 327 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:49:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-11-16 03:49:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1925. [2024-11-16 03:49:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.2448024948024947) internal successors, (2395), 1924 states have internal predecessors, (2395), 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-11-16 03:49:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2395 transitions. [2024-11-16 03:49:32,872 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2395 transitions. Word has length 168 [2024-11-16 03:49:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:32,874 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2395 transitions. [2024-11-16 03:49:32,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-11-16 03:49:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2395 transitions. [2024-11-16 03:49:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 03:49:32,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:32,879 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:49:32,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:49:32,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:32,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:32,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1455737733, now seen corresponding path program 1 times [2024-11-16 03:49:32,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:32,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556272119] [2024-11-16 03:49:32,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-16 03:49:33,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:33,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556272119] [2024-11-16 03:49:33,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556272119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:33,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:33,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:33,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372000458] [2024-11-16 03:49:33,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:33,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:33,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:33,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:33,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:33,157 INFO L87 Difference]: Start difference. First operand 1925 states and 2395 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-11-16 03:49:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:34,029 INFO L93 Difference]: Finished difference Result 4414 states and 5615 transitions. [2024-11-16 03:49:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:34,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 224 [2024-11-16 03:49:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:34,039 INFO L225 Difference]: With dead ends: 4414 [2024-11-16 03:49:34,039 INFO L226 Difference]: Without dead ends: 2676 [2024-11-16 03:49:34,041 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-11-16 03:49:34,042 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 159 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:34,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 397 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:49:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-16 03:49:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2481. [2024-11-16 03:49:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.2334677419354838) internal successors, (3059), 2480 states have internal predecessors, (3059), 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-11-16 03:49:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3059 transitions. [2024-11-16 03:49:34,086 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3059 transitions. Word has length 224 [2024-11-16 03:49:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:34,087 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3059 transitions. [2024-11-16 03:49:34,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-11-16 03:49:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3059 transitions. [2024-11-16 03:49:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-16 03:49:34,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:34,091 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:49:34,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:49:34,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:34,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1778947436, now seen corresponding path program 1 times [2024-11-16 03:49:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:34,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433324581] [2024-11-16 03:49:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-16 03:49:34,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:34,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433324581] [2024-11-16 03:49:34,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433324581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:34,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:34,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208060418] [2024-11-16 03:49:34,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:34,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:34,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:34,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:34,352 INFO L87 Difference]: Start difference. First operand 2481 states and 3059 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-11-16 03:49:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:35,131 INFO L93 Difference]: Finished difference Result 5895 states and 7330 transitions. [2024-11-16 03:49:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:35,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 230 [2024-11-16 03:49:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:35,145 INFO L225 Difference]: With dead ends: 5895 [2024-11-16 03:49:35,146 INFO L226 Difference]: Without dead ends: 3416 [2024-11-16 03:49:35,149 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-11-16 03:49:35,150 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 158 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:35,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 395 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:49:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2024-11-16 03:49:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3407. [2024-11-16 03:49:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3407 states, 3406 states have (on average 1.2066940692894892) internal successors, (4110), 3406 states have internal predecessors, (4110), 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-11-16 03:49:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 4110 transitions. [2024-11-16 03:49:35,206 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 4110 transitions. Word has length 230 [2024-11-16 03:49:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:35,206 INFO L471 AbstractCegarLoop]: Abstraction has 3407 states and 4110 transitions. [2024-11-16 03:49:35,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-11-16 03:49:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 4110 transitions. [2024-11-16 03:49:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-16 03:49:35,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:35,213 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 03:49:35,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:49:35,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:35,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1200668071, now seen corresponding path program 1 times [2024-11-16 03:49:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763163848] [2024-11-16 03:49:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-16 03:49:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:35,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763163848] [2024-11-16 03:49:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763163848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:35,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139882863] [2024-11-16 03:49:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:35,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:35,520 INFO L87 Difference]: Start difference. First operand 3407 states and 4110 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-11-16 03:49:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:36,290 INFO L93 Difference]: Finished difference Result 6826 states and 8243 transitions. [2024-11-16 03:49:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:36,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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 302 [2024-11-16 03:49:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:36,303 INFO L225 Difference]: With dead ends: 6826 [2024-11-16 03:49:36,303 INFO L226 Difference]: Without dead ends: 3421 [2024-11-16 03:49:36,307 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-11-16 03:49:36,308 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:36,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 340 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:49:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2024-11-16 03:49:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3037. [2024-11-16 03:49:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3036 states have (on average 1.1805006587615283) internal successors, (3584), 3036 states have internal predecessors, (3584), 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-11-16 03:49:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 3584 transitions. [2024-11-16 03:49:36,369 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 3584 transitions. Word has length 302 [2024-11-16 03:49:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:36,369 INFO L471 AbstractCegarLoop]: Abstraction has 3037 states and 3584 transitions. [2024-11-16 03:49:36,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-11-16 03:49:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 3584 transitions. [2024-11-16 03:49:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-16 03:49:36,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:36,377 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, 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] [2024-11-16 03:49:36,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:49:36,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:36,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:36,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1527518229, now seen corresponding path program 1 times [2024-11-16 03:49:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:36,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656612437] [2024-11-16 03:49:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-16 03:49:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:36,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656612437] [2024-11-16 03:49:36,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656612437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:36,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:36,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:36,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505939826] [2024-11-16 03:49:36,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:36,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:36,642 INFO L87 Difference]: Start difference. First operand 3037 states and 3584 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-11-16 03:49:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:37,313 INFO L93 Difference]: Finished difference Result 6049 states and 7133 transitions. [2024-11-16 03:49:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:37,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 303 [2024-11-16 03:49:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:37,321 INFO L225 Difference]: With dead ends: 6049 [2024-11-16 03:49:37,321 INFO L226 Difference]: Without dead ends: 3014 [2024-11-16 03:49:37,325 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-11-16 03:49:37,325 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 162 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:37,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 152 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:49:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2024-11-16 03:49:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2024-11-16 03:49:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3011 states have (on average 1.132181999335769) internal successors, (3409), 3011 states have internal predecessors, (3409), 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-11-16 03:49:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3409 transitions. [2024-11-16 03:49:37,408 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3409 transitions. Word has length 303 [2024-11-16 03:49:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:37,408 INFO L471 AbstractCegarLoop]: Abstraction has 3012 states and 3409 transitions. [2024-11-16 03:49:37,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-11-16 03:49:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3409 transitions. [2024-11-16 03:49:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-16 03:49:37,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:37,414 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 03:49:37,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:49:37,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:37,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:37,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2102503030, now seen corresponding path program 1 times [2024-11-16 03:49:37,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:37,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164299092] [2024-11-16 03:49:37,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:37,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-16 03:49:37,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:37,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164299092] [2024-11-16 03:49:37,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164299092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:37,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:37,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:37,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534738108] [2024-11-16 03:49:37,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:37,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:37,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:37,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:37,629 INFO L87 Difference]: Start difference. First operand 3012 states and 3409 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-11-16 03:49:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:38,438 INFO L93 Difference]: Finished difference Result 8060 states and 9193 transitions. [2024-11-16 03:49:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 308 [2024-11-16 03:49:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:38,456 INFO L225 Difference]: With dead ends: 8060 [2024-11-16 03:49:38,457 INFO L226 Difference]: Without dead ends: 5050 [2024-11-16 03:49:38,462 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-11-16 03:49:38,463 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 195 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:38,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 75 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:49:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5050 states. [2024-11-16 03:49:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5050 to 5047. [2024-11-16 03:49:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5047 states, 5046 states have (on average 1.1359492667459374) internal successors, (5732), 5046 states have internal predecessors, (5732), 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-11-16 03:49:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 5732 transitions. [2024-11-16 03:49:38,567 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 5732 transitions. Word has length 308 [2024-11-16 03:49:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:38,568 INFO L471 AbstractCegarLoop]: Abstraction has 5047 states and 5732 transitions. [2024-11-16 03:49:38,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-11-16 03:49:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 5732 transitions. [2024-11-16 03:49:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-16 03:49:38,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:38,576 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:49:38,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:49:38,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:38,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:38,577 INFO L85 PathProgramCache]: Analyzing trace with hash -167100110, now seen corresponding path program 1 times [2024-11-16 03:49:38,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:38,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118847797] [2024-11-16 03:49:38,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:49:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118847797] [2024-11-16 03:49:39,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118847797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:39,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:39,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:49:39,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176052609] [2024-11-16 03:49:39,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:39,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:49:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:49:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:49:39,013 INFO L87 Difference]: Start difference. First operand 5047 states and 5732 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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-11-16 03:49:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:40,219 INFO L93 Difference]: Finished difference Result 12686 states and 14408 transitions. [2024-11-16 03:49:40,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:49:40,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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 347 [2024-11-16 03:49:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:40,249 INFO L225 Difference]: With dead ends: 12686 [2024-11-16 03:49:40,250 INFO L226 Difference]: Without dead ends: 7641 [2024-11-16 03:49:40,256 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-11-16 03:49:40,257 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:40,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 71 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 03:49:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2024-11-16 03:49:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 6344. [2024-11-16 03:49:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6344 states, 6343 states have (on average 1.126280939618477) internal successors, (7144), 6343 states have internal predecessors, (7144), 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-11-16 03:49:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6344 states to 6344 states and 7144 transitions. [2024-11-16 03:49:40,354 INFO L78 Accepts]: Start accepts. Automaton has 6344 states and 7144 transitions. Word has length 347 [2024-11-16 03:49:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:40,355 INFO L471 AbstractCegarLoop]: Abstraction has 6344 states and 7144 transitions. [2024-11-16 03:49:40,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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-11-16 03:49:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 6344 states and 7144 transitions. [2024-11-16 03:49:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2024-11-16 03:49:40,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:40,369 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 03:49:40,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:49:40,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:40,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -783286907, now seen corresponding path program 1 times [2024-11-16 03:49:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:40,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557393381] [2024-11-16 03:49:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-16 03:49:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557393381] [2024-11-16 03:49:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557393381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:40,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:40,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:49:40,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6191624] [2024-11-16 03:49:40,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:40,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:49:40,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:40,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:49:40,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:49:40,916 INFO L87 Difference]: Start difference. First operand 6344 states and 7144 transitions. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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-11-16 03:49:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:41,979 INFO L93 Difference]: Finished difference Result 13983 states and 15729 transitions. [2024-11-16 03:49:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:49:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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 422 [2024-11-16 03:49:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:41,992 INFO L225 Difference]: With dead ends: 13983 [2024-11-16 03:49:41,993 INFO L226 Difference]: Without dead ends: 7641 [2024-11-16 03:49:41,998 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-11-16 03:49:41,999 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:42,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 71 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 03:49:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2024-11-16 03:49:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 5974. [2024-11-16 03:49:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5974 states, 5973 states have (on average 1.125062782521346) internal successors, (6720), 5973 states have internal predecessors, (6720), 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-11-16 03:49:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5974 states to 5974 states and 6720 transitions. [2024-11-16 03:49:42,072 INFO L78 Accepts]: Start accepts. Automaton has 5974 states and 6720 transitions. Word has length 422 [2024-11-16 03:49:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 5974 states and 6720 transitions. [2024-11-16 03:49:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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-11-16 03:49:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5974 states and 6720 transitions. [2024-11-16 03:49:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2024-11-16 03:49:42,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:42,086 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, 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, 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, 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-11-16 03:49:42,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:49:42,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:42,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash 404467755, now seen corresponding path program 1 times [2024-11-16 03:49:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784308265] [2024-11-16 03:49:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:42,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 853 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-16 03:49:42,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784308265] [2024-11-16 03:49:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784308265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:42,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:42,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343035718] [2024-11-16 03:49:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:49:42,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:49:42,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:49:42,625 INFO L87 Difference]: Start difference. First operand 5974 states and 6720 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 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-11-16 03:49:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:43,617 INFO L93 Difference]: Finished difference Result 17701 states and 19939 transitions. [2024-11-16 03:49:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:49:43,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 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 675 [2024-11-16 03:49:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:43,635 INFO L225 Difference]: With dead ends: 17701 [2024-11-16 03:49:43,636 INFO L226 Difference]: Without dead ends: 11729 [2024-11-16 03:49:43,643 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-11-16 03:49:43,644 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 210 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:43,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 83 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 03:49:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11729 states. [2024-11-16 03:49:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11729 to 11542. [2024-11-16 03:49:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11542 states, 11541 states have (on average 1.1172342084741358) internal successors, (12894), 11541 states have internal predecessors, (12894), 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-11-16 03:49:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11542 states to 11542 states and 12894 transitions. [2024-11-16 03:49:43,811 INFO L78 Accepts]: Start accepts. Automaton has 11542 states and 12894 transitions. Word has length 675 [2024-11-16 03:49:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:43,812 INFO L471 AbstractCegarLoop]: Abstraction has 11542 states and 12894 transitions. [2024-11-16 03:49:43,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 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-11-16 03:49:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 11542 states and 12894 transitions. [2024-11-16 03:49:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 745 [2024-11-16 03:49:43,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:43,834 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2024-11-16 03:49:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:49:43,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:43,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash -16498668, now seen corresponding path program 1 times [2024-11-16 03:49:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433301691] [2024-11-16 03:49:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 973 proven. 0 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2024-11-16 03:49:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433301691] [2024-11-16 03:49:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433301691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:44,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:44,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036083274] [2024-11-16 03:49:44,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:44,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:44,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:44,333 INFO L87 Difference]: Start difference. First operand 11542 states and 12894 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-11-16 03:49:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:44,995 INFO L93 Difference]: Finished difference Result 23448 states and 26217 transitions. [2024-11-16 03:49:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 744 [2024-11-16 03:49:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:45,016 INFO L225 Difference]: With dead ends: 23448 [2024-11-16 03:49:45,016 INFO L226 Difference]: Without dead ends: 12095 [2024-11-16 03:49:45,028 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-11-16 03:49:45,029 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:45,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 354 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:49:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12095 states. [2024-11-16 03:49:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12095 to 12095. [2024-11-16 03:49:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12095 states, 12094 states have (on average 1.0993881263436416) internal successors, (13296), 12094 states have internal predecessors, (13296), 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-11-16 03:49:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12095 states to 12095 states and 13296 transitions. [2024-11-16 03:49:45,175 INFO L78 Accepts]: Start accepts. Automaton has 12095 states and 13296 transitions. Word has length 744 [2024-11-16 03:49:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:45,176 INFO L471 AbstractCegarLoop]: Abstraction has 12095 states and 13296 transitions. [2024-11-16 03:49:45,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-11-16 03:49:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 12095 states and 13296 transitions. [2024-11-16 03:49:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2024-11-16 03:49:45,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:45,196 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-11-16 03:49:45,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:49:45,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:45,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:45,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1288483462, now seen corresponding path program 1 times [2024-11-16 03:49:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334076882] [2024-11-16 03:49:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 1460 proven. 0 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-11-16 03:49:45,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:45,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334076882] [2024-11-16 03:49:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334076882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:49:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884226780] [2024-11-16 03:49:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:45,684 INFO L87 Difference]: Start difference. First operand 12095 states and 13296 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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-11-16 03:49:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:46,246 INFO L93 Difference]: Finished difference Result 23625 states and 25929 transitions. [2024-11-16 03:49:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:46,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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 844 [2024-11-16 03:49:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:46,248 INFO L225 Difference]: With dead ends: 23625 [2024-11-16 03:49:46,248 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:49:46,261 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-11-16 03:49:46,262 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 61 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:49:46,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 319 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:49:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:49:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:49:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:49:46,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:49:46,263 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 844 [2024-11-16 03:49:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:46,263 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:49:46,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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-11-16 03:49:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:49:46,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:49:46,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:49:46,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 03:49:46,269 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:49:46,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:49:47,581 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:49:47,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:49:47 BoogieIcfgContainer [2024-11-16 03:49:47,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:49:47,592 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:49:47,592 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:49:47,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:49:47,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:49:27" (3/4) ... [2024-11-16 03:49:47,595 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:49:47,611 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:49:47,613 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:49:47,614 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:49:47,615 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:49:47,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:49:47,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:49:47,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:49:47,793 INFO L158 Benchmark]: Toolchain (without parser) took 22489.36ms. Allocated memory was 144.7MB in the beginning and 583.0MB in the end (delta: 438.3MB). Free memory was 90.3MB in the beginning and 220.1MB in the end (delta: -129.8MB). Peak memory consumption was 308.4MB. Max. memory is 16.1GB. [2024-11-16 03:49:47,793 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 64.5MB in the beginning and 64.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:49:47,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.74ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 81.7MB in the end (delta: 8.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-16 03:49:47,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.12ms. Allocated memory is still 144.7MB. Free memory was 81.7MB in the beginning and 63.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 03:49:47,795 INFO L158 Benchmark]: Boogie Preprocessor took 182.01ms. Allocated memory is still 144.7MB. Free memory was 63.9MB in the beginning and 99.4MB in the end (delta: -35.5MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-16 03:49:47,795 INFO L158 Benchmark]: IcfgBuilder took 1644.61ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 99.4MB in the beginning and 79.7MB in the end (delta: 19.7MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2024-11-16 03:49:47,795 INFO L158 Benchmark]: TraceAbstraction took 19635.72ms. Allocated memory was 180.4MB in the beginning and 583.0MB in the end (delta: 402.7MB). Free memory was 78.6MB in the beginning and 237.9MB in the end (delta: -159.3MB). Peak memory consumption was 314.1MB. Max. memory is 16.1GB. [2024-11-16 03:49:47,796 INFO L158 Benchmark]: Witness Printer took 200.25ms. Allocated memory is still 583.0MB. Free memory was 237.9MB in the beginning and 220.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 03:49:47,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 64.5MB in the beginning and 64.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 685.74ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 81.7MB in the end (delta: 8.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.12ms. Allocated memory is still 144.7MB. Free memory was 81.7MB in the beginning and 63.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 182.01ms. Allocated memory is still 144.7MB. Free memory was 63.9MB in the beginning and 99.4MB in the end (delta: -35.5MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * IcfgBuilder took 1644.61ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 99.4MB in the beginning and 79.7MB in the end (delta: 19.7MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19635.72ms. Allocated memory was 180.4MB in the beginning and 583.0MB in the end (delta: 402.7MB). Free memory was 78.6MB in the beginning and 237.9MB in the end (delta: -159.3MB). Peak memory consumption was 314.1MB. Max. memory is 16.1GB. * Witness Printer took 200.25ms. Allocated memory is still 583.0MB. Free memory was 237.9MB in the beginning and 220.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 130]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2446 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2446 mSDsluCounter, 3129 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 1758 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9166 IncrementalHoareTripleChecker+Invalid, 10924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1758 mSolverCounterUnsat, 2755 mSDtfsCounter, 9166 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12095occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 3758 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 4825 NumberOfCodeBlocks, 4825 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4811 ConstructedInterpolants, 0 QuantifiedInterpolants, 8347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6938/6938 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:49:47,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE