./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/Problem03_label36.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 62e9241ba979767c8bca2756b2edfc882f7b20aa81fc6f783856c8cd54d80552 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:30:57,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:30:57,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:30:57,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:30:57,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:30:58,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:30:58,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:30:58,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:30:58,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:30:58,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:30:58,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:30:58,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:30:58,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:30:58,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:30:58,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:30:58,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:30:58,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:30:58,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:30:58,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:30:58,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:30:58,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:30:58,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:30:58,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:30:58,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:30:58,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:30:58,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:30:58,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:30:58,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:30:58,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:30:58,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:30:58,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:30:58,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:30:58,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:30:58,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:30:58,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:30:58,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:30:58,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:30:58,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:30:58,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:30:58,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:30:58,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:30:58,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:30:58,055 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 -> 62e9241ba979767c8bca2756b2edfc882f7b20aa81fc6f783856c8cd54d80552 [2024-11-08 10:30:58,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:30:58,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:30:58,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:30:58,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:30:58,358 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:30:58,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label36.c [2024-11-08 10:30:59,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:31:00,223 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:31:00,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label36.c [2024-11-08 10:31:00,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f0a80ca/cf0b3f95425b4a11b34c3ef3e33f8116/FLAGfe706dcb0 [2024-11-08 10:31:00,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f0a80ca/cf0b3f95425b4a11b34c3ef3e33f8116 [2024-11-08 10:31:00,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:31:00,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:31:00,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:31:00,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:31:00,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:31:00,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:31:00" (1/1) ... [2024-11-08 10:31:00,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e24c328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:00, skipping insertion in model container [2024-11-08 10:31:00,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:31:00" (1/1) ... [2024-11-08 10:31:00,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:31:01,143 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/Problem03_label36.c[58393,58406] [2024-11-08 10:31:01,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:31:01,201 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:31:01,386 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/Problem03_label36.c[58393,58406] [2024-11-08 10:31:01,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:31:01,423 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:31:01,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01 WrapperNode [2024-11-08 10:31:01,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:31:01,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:31:01,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:31:01,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:31:01,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,655 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:31:01,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:31:01,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:31:01,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:31:01,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:31:01,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,741 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-08 10:31:01,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:31:01,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:31:01,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:31:01,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:31:01,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (1/1) ... [2024-11-08 10:31:01,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:31:01,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:01,899 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-08 10:31:01,905 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-08 10:31:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:31:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:31:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:31:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:31:02,031 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:31:02,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:31:03,923 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:31:03,923 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:31:03,958 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:31:03,959 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:31:03,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:31:03 BoogieIcfgContainer [2024-11-08 10:31:03,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:31:03,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:31:03,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:31:03,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:31:03,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:31:00" (1/3) ... [2024-11-08 10:31:03,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718bb57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:31:03, skipping insertion in model container [2024-11-08 10:31:03,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:01" (2/3) ... [2024-11-08 10:31:03,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718bb57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:31:03, skipping insertion in model container [2024-11-08 10:31:03,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:31:03" (3/3) ... [2024-11-08 10:31:03,972 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label36.c [2024-11-08 10:31:03,990 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:31:03,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:31:04,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:31:04,081 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;@26dbb189, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:31:04,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:31:04,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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-08 10:31:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 10:31:04,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:04,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:04,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:04,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:04,118 INFO L85 PathProgramCache]: Analyzing trace with hash -946453597, now seen corresponding path program 1 times [2024-11-08 10:31:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220721157] [2024-11-08 10:31:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:05,049 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-08 10:31:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220721157] [2024-11-08 10:31:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220721157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725942390] [2024-11-08 10:31:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:05,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:05,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:05,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:05,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:05,096 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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-08 10:31:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:06,261 INFO L93 Difference]: Finished difference Result 857 states and 1498 transitions. [2024-11-08 10:31:06,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:06,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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 179 [2024-11-08 10:31:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:06,278 INFO L225 Difference]: With dead ends: 857 [2024-11-08 10:31:06,278 INFO L226 Difference]: Without dead ends: 462 [2024-11-08 10:31:06,283 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-08 10:31:06,287 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 109 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:06,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 10:31:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-08 10:31:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2024-11-08 10:31:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 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-08 10:31:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2024-11-08 10:31:06,356 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 179 [2024-11-08 10:31:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:06,357 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2024-11-08 10:31:06,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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-08 10:31:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2024-11-08 10:31:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 10:31:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:06,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:31:06,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1056624732, now seen corresponding path program 1 times [2024-11-08 10:31:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916991330] [2024-11-08 10:31:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:06,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:06,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:06,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916991330] [2024-11-08 10:31:06,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916991330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:06,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:06,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942657620] [2024-11-08 10:31:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:06,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:06,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:06,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:06,638 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-08 10:31:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:07,446 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2024-11-08 10:31:07,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:07,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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 187 [2024-11-08 10:31:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:07,450 INFO L225 Difference]: With dead ends: 1344 [2024-11-08 10:31:07,450 INFO L226 Difference]: Without dead ends: 886 [2024-11-08 10:31:07,452 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-08 10:31:07,453 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:07,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:31:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-08 10:31:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2024-11-08 10:31:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5132336018411967) internal successors, (1315), 869 states have internal predecessors, (1315), 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-08 10:31:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1315 transitions. [2024-11-08 10:31:07,502 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1315 transitions. Word has length 187 [2024-11-08 10:31:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:07,503 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1315 transitions. [2024-11-08 10:31:07,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-08 10:31:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1315 transitions. [2024-11-08 10:31:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 10:31:07,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:07,511 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:07,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:31:07,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:07,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:07,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1503064601, now seen corresponding path program 1 times [2024-11-08 10:31:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:07,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83939540] [2024-11-08 10:31:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83939540] [2024-11-08 10:31:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83939540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:08,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:08,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:08,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700459794] [2024-11-08 10:31:08,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:08,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:31:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:31:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:31:08,389 INFO L87 Difference]: Start difference. First operand 870 states and 1315 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 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-08 10:31:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:09,351 INFO L93 Difference]: Finished difference Result 1884 states and 2886 transitions. [2024-11-08 10:31:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:31:09,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 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 194 [2024-11-08 10:31:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:09,356 INFO L225 Difference]: With dead ends: 1884 [2024-11-08 10:31:09,356 INFO L226 Difference]: Without dead ends: 842 [2024-11-08 10:31:09,358 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-08 10:31:09,359 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 299 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:09,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 47 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:31:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-08 10:31:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2024-11-08 10:31:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.3650416171224733) internal successors, (1148), 841 states have internal predecessors, (1148), 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-08 10:31:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1148 transitions. [2024-11-08 10:31:09,379 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1148 transitions. Word has length 194 [2024-11-08 10:31:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:09,379 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1148 transitions. [2024-11-08 10:31:09,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 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-08 10:31:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1148 transitions. [2024-11-08 10:31:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 10:31:09,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:09,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:09,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:31:09,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:09,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1846501408, now seen corresponding path program 1 times [2024-11-08 10:31:09,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:09,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515906264] [2024-11-08 10:31:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:09,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:09,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515906264] [2024-11-08 10:31:09,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515906264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:09,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22400491] [2024-11-08 10:31:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:09,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:09,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:09,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:09,608 INFO L87 Difference]: Start difference. First operand 842 states and 1148 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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-08 10:31:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:10,306 INFO L93 Difference]: Finished difference Result 2504 states and 3420 transitions. [2024-11-08 10:31:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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 202 [2024-11-08 10:31:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:10,312 INFO L225 Difference]: With dead ends: 2504 [2024-11-08 10:31:10,312 INFO L226 Difference]: Without dead ends: 1664 [2024-11-08 10:31:10,317 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-08 10:31:10,320 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 227 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:10,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 72 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:31:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-11-08 10:31:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1663. [2024-11-08 10:31:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 1.3243080625752106) internal successors, (2201), 1662 states have internal predecessors, (2201), 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-08 10:31:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2201 transitions. [2024-11-08 10:31:10,356 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2201 transitions. Word has length 202 [2024-11-08 10:31:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:10,356 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2201 transitions. [2024-11-08 10:31:10,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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-08 10:31:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2201 transitions. [2024-11-08 10:31:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 10:31:10,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:10,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:10,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:31:10,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1042422668, now seen corresponding path program 1 times [2024-11-08 10:31:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:10,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240010828] [2024-11-08 10:31:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:10,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240010828] [2024-11-08 10:31:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240010828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:11,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:11,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488207756] [2024-11-08 10:31:11,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:11,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:31:11,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:11,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:31:11,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:31:11,038 INFO L87 Difference]: Start difference. First operand 1663 states and 2201 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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-08 10:31:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:12,267 INFO L93 Difference]: Finished difference Result 4323 states and 5738 transitions. [2024-11-08 10:31:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:31:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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 210 [2024-11-08 10:31:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:12,277 INFO L225 Difference]: With dead ends: 4323 [2024-11-08 10:31:12,277 INFO L226 Difference]: Without dead ends: 2488 [2024-11-08 10:31:12,279 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-08 10:31:12,280 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 193 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:12,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 100 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 10:31:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2024-11-08 10:31:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2487. [2024-11-08 10:31:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.3073209975864843) internal successors, (3250), 2486 states have internal predecessors, (3250), 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-08 10:31:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3250 transitions. [2024-11-08 10:31:12,321 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3250 transitions. Word has length 210 [2024-11-08 10:31:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:12,321 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3250 transitions. [2024-11-08 10:31:12,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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-08 10:31:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3250 transitions. [2024-11-08 10:31:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 10:31:12,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:12,326 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:12,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:31:12,327 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:12,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash 356438585, now seen corresponding path program 1 times [2024-11-08 10:31:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:12,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103414151] [2024-11-08 10:31:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:31:12,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103414151] [2024-11-08 10:31:12,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103414151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:12,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063373037] [2024-11-08 10:31:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:12,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:12,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:12,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:12,562 INFO L87 Difference]: Start difference. First operand 2487 states and 3250 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-08 10:31:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:13,325 INFO L93 Difference]: Finished difference Result 6628 states and 8636 transitions. [2024-11-08 10:31:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:13,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 212 [2024-11-08 10:31:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:13,343 INFO L225 Difference]: With dead ends: 6628 [2024-11-08 10:31:13,344 INFO L226 Difference]: Without dead ends: 4143 [2024-11-08 10:31:13,348 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-08 10:31:13,350 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 202 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:13,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 117 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:31:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2024-11-08 10:31:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4140. [2024-11-08 10:31:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4140 states, 4139 states have (on average 1.296206813239913) internal successors, (5365), 4139 states have internal predecessors, (5365), 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-08 10:31:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5365 transitions. [2024-11-08 10:31:13,428 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5365 transitions. Word has length 212 [2024-11-08 10:31:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:13,429 INFO L471 AbstractCegarLoop]: Abstraction has 4140 states and 5365 transitions. [2024-11-08 10:31:13,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-08 10:31:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5365 transitions. [2024-11-08 10:31:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 10:31:13,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:13,438 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:13,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:31:13,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:13,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1898458719, now seen corresponding path program 1 times [2024-11-08 10:31:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:13,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359936950] [2024-11-08 10:31:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:13,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:13,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359936950] [2024-11-08 10:31:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359936950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:13,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117035928] [2024-11-08 10:31:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:13,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:13,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:13,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:13,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:31:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:14,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:14,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 10:31:14,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:14,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117035928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:14,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:14,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:14,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319012395] [2024-11-08 10:31:14,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:14,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:14,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:14,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:14,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:14,352 INFO L87 Difference]: Start difference. First operand 4140 states and 5365 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-08 10:31:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:15,055 INFO L93 Difference]: Finished difference Result 8287 states and 10744 transitions. [2024-11-08 10:31:15,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:15,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 217 [2024-11-08 10:31:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:15,070 INFO L225 Difference]: With dead ends: 8287 [2024-11-08 10:31:15,071 INFO L226 Difference]: Without dead ends: 4149 [2024-11-08 10:31:15,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:15,077 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:15,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 320 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:31:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2024-11-08 10:31:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 4140. [2024-11-08 10:31:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4140 states, 4139 states have (on average 1.285817830393815) internal successors, (5322), 4139 states have internal predecessors, (5322), 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-08 10:31:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5322 transitions. [2024-11-08 10:31:15,189 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5322 transitions. Word has length 217 [2024-11-08 10:31:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:15,189 INFO L471 AbstractCegarLoop]: Abstraction has 4140 states and 5322 transitions. [2024-11-08 10:31:15,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-08 10:31:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5322 transitions. [2024-11-08 10:31:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 10:31:15,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:15,198 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:15,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:15,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:15,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:15,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash 206794107, now seen corresponding path program 1 times [2024-11-08 10:31:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048176913] [2024-11-08 10:31:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048176913] [2024-11-08 10:31:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048176913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818476073] [2024-11-08 10:31:15,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:15,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:15,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:15,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:31:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:16,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:16,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:31:16,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818476073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585701796] [2024-11-08 10:31:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:16,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:16,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:16,251 INFO L87 Difference]: Start difference. First operand 4140 states and 5322 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-08 10:31:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:16,832 INFO L93 Difference]: Finished difference Result 12344 states and 15868 transitions. [2024-11-08 10:31:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:16,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 223 [2024-11-08 10:31:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:16,862 INFO L225 Difference]: With dead ends: 12344 [2024-11-08 10:31:16,862 INFO L226 Difference]: Without dead ends: 8206 [2024-11-08 10:31:16,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:16,871 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 40 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:16,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 343 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8206 states. [2024-11-08 10:31:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8206 to 8200. [2024-11-08 10:31:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8200 states, 8199 states have (on average 1.1763629710940358) internal successors, (9645), 8199 states have internal predecessors, (9645), 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-08 10:31:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 9645 transitions. [2024-11-08 10:31:17,013 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 9645 transitions. Word has length 223 [2024-11-08 10:31:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:17,014 INFO L471 AbstractCegarLoop]: Abstraction has 8200 states and 9645 transitions. [2024-11-08 10:31:17,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-08 10:31:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 9645 transitions. [2024-11-08 10:31:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 10:31:17,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:17,034 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:17,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:17,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 10:31:17,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:17,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash -782148101, now seen corresponding path program 1 times [2024-11-08 10:31:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123248349] [2024-11-08 10:31:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:17,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:17,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123248349] [2024-11-08 10:31:17,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123248349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:17,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:17,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:17,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086563167] [2024-11-08 10:31:17,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:17,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:17,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:17,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:17,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:17,550 INFO L87 Difference]: Start difference. First operand 8200 states and 9645 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-08 10:31:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:18,205 INFO L93 Difference]: Finished difference Result 20458 states and 24504 transitions. [2024-11-08 10:31:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:18,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 233 [2024-11-08 10:31:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:18,242 INFO L225 Difference]: With dead ends: 20458 [2024-11-08 10:31:18,242 INFO L226 Difference]: Without dead ends: 12260 [2024-11-08 10:31:18,253 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-08 10:31:18,254 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 211 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:18,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 126 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:31:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12260 states. [2024-11-08 10:31:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12260 to 12260. [2024-11-08 10:31:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12260 states, 12259 states have (on average 1.1418549637001387) internal successors, (13998), 12259 states have internal predecessors, (13998), 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-08 10:31:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12260 states to 12260 states and 13998 transitions. [2024-11-08 10:31:18,436 INFO L78 Accepts]: Start accepts. Automaton has 12260 states and 13998 transitions. Word has length 233 [2024-11-08 10:31:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:18,436 INFO L471 AbstractCegarLoop]: Abstraction has 12260 states and 13998 transitions. [2024-11-08 10:31:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-08 10:31:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12260 states and 13998 transitions. [2024-11-08 10:31:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 10:31:18,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:18,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:18,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:31:18,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:18,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2131521666, now seen corresponding path program 1 times [2024-11-08 10:31:18,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:18,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776136408] [2024-11-08 10:31:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:18,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:18,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776136408] [2024-11-08 10:31:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776136408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:18,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:18,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116656829] [2024-11-08 10:31:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:18,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:18,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:18,725 INFO L87 Difference]: Start difference. First operand 12260 states and 13998 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 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-08 10:31:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:19,375 INFO L93 Difference]: Finished difference Result 35312 states and 40338 transitions. [2024-11-08 10:31:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:19,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 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 254 [2024-11-08 10:31:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:19,419 INFO L225 Difference]: With dead ends: 35312 [2024-11-08 10:31:19,420 INFO L226 Difference]: Without dead ends: 23054 [2024-11-08 10:31:19,436 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-08 10:31:19,437 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:19,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 109 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23054 states. [2024-11-08 10:31:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23054 to 18965. [2024-11-08 10:31:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18965 states, 18964 states have (on average 1.1543450748787176) internal successors, (21891), 18964 states have internal predecessors, (21891), 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-08 10:31:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18965 states to 18965 states and 21891 transitions. [2024-11-08 10:31:19,785 INFO L78 Accepts]: Start accepts. Automaton has 18965 states and 21891 transitions. Word has length 254 [2024-11-08 10:31:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:19,785 INFO L471 AbstractCegarLoop]: Abstraction has 18965 states and 21891 transitions. [2024-11-08 10:31:19,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 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-08 10:31:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 18965 states and 21891 transitions. [2024-11-08 10:31:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-08 10:31:19,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:19,813 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:31:19,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:31:19,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:19,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1057336978, now seen corresponding path program 1 times [2024-11-08 10:31:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:19,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718936623] [2024-11-08 10:31:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718936623] [2024-11-08 10:31:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718936623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:20,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060569548] [2024-11-08 10:31:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:20,060 INFO L87 Difference]: Start difference. First operand 18965 states and 21891 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-08 10:31:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:20,805 INFO L93 Difference]: Finished difference Result 49526 states and 57347 transitions. [2024-11-08 10:31:20,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:20,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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 275 [2024-11-08 10:31:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:20,866 INFO L225 Difference]: With dead ends: 49526 [2024-11-08 10:31:20,866 INFO L226 Difference]: Without dead ends: 30563 [2024-11-08 10:31:20,892 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-08 10:31:20,892 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 57 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:20,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 310 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:31:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30563 states. [2024-11-08 10:31:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30563 to 30554. [2024-11-08 10:31:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30554 states, 30553 states have (on average 1.1402808234870552) internal successors, (34839), 30553 states have internal predecessors, (34839), 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-08 10:31:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30554 states to 30554 states and 34839 transitions. [2024-11-08 10:31:21,379 INFO L78 Accepts]: Start accepts. Automaton has 30554 states and 34839 transitions. Word has length 275 [2024-11-08 10:31:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:21,379 INFO L471 AbstractCegarLoop]: Abstraction has 30554 states and 34839 transitions. [2024-11-08 10:31:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-08 10:31:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30554 states and 34839 transitions. [2024-11-08 10:31:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-08 10:31:21,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:21,413 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:21,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:31:21,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:21,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash 69326496, now seen corresponding path program 1 times [2024-11-08 10:31:21,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:21,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803240458] [2024-11-08 10:31:21,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:21,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-08 10:31:21,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:21,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803240458] [2024-11-08 10:31:21,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803240458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:21,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374369354] [2024-11-08 10:31:21,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:21,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:21,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:21,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:21,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:31:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:22,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:22,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 10:31:22,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374369354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:22,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903433485] [2024-11-08 10:31:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:22,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:22,235 INFO L87 Difference]: Start difference. First operand 30554 states and 34839 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-08 10:31:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:22,894 INFO L93 Difference]: Finished difference Result 60909 states and 69479 transitions. [2024-11-08 10:31:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:22,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 287 [2024-11-08 10:31:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:22,938 INFO L225 Difference]: With dead ends: 60909 [2024-11-08 10:31:22,939 INFO L226 Difference]: Without dead ends: 30357 [2024-11-08 10:31:23,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:23,074 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 84 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:23,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 277 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30357 states. [2024-11-08 10:31:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30357 to 30148. [2024-11-08 10:31:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30148 states, 30147 states have (on average 1.1327826981125817) internal successors, (34150), 30147 states have internal predecessors, (34150), 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-08 10:31:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30148 states to 30148 states and 34150 transitions. [2024-11-08 10:31:23,416 INFO L78 Accepts]: Start accepts. Automaton has 30148 states and 34150 transitions. Word has length 287 [2024-11-08 10:31:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 30148 states and 34150 transitions. [2024-11-08 10:31:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-08 10:31:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 30148 states and 34150 transitions. [2024-11-08 10:31:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-08 10:31:23,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:23,448 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:23,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:31:23,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:23,650 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:23,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:23,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1764230915, now seen corresponding path program 1 times [2024-11-08 10:31:23,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:23,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966012548] [2024-11-08 10:31:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:23,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-08 10:31:24,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:24,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966012548] [2024-11-08 10:31:24,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966012548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:24,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482758792] [2024-11-08 10:31:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:24,118 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:24,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:31:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:24,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:31:24,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 10:31:24,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:24,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482758792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:24,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163957735] [2024-11-08 10:31:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:24,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:24,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:24,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:24,361 INFO L87 Difference]: Start difference. First operand 30148 states and 34150 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-08 10:31:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:25,141 INFO L93 Difference]: Finished difference Result 57629 states and 65145 transitions. [2024-11-08 10:31:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:25,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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 329 [2024-11-08 10:31:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:25,172 INFO L225 Difference]: With dead ends: 57629 [2024-11-08 10:31:25,173 INFO L226 Difference]: Without dead ends: 27483 [2024-11-08 10:31:25,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:25,192 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 200 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:25,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 312 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:31:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27483 states. [2024-11-08 10:31:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27483 to 27480. [2024-11-08 10:31:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27480 states, 27479 states have (on average 1.1034608246297173) internal successors, (30322), 27479 states have internal predecessors, (30322), 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-08 10:31:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27480 states to 27480 states and 30322 transitions. [2024-11-08 10:31:25,608 INFO L78 Accepts]: Start accepts. Automaton has 27480 states and 30322 transitions. Word has length 329 [2024-11-08 10:31:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:25,609 INFO L471 AbstractCegarLoop]: Abstraction has 27480 states and 30322 transitions. [2024-11-08 10:31:25,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-08 10:31:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 27480 states and 30322 transitions. [2024-11-08 10:31:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-08 10:31:25,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:25,644 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:31:25,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:31:25,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:25,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:25,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1515580499, now seen corresponding path program 1 times [2024-11-08 10:31:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:25,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442419532] [2024-11-08 10:31:25,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:25,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-08 10:31:26,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:26,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442419532] [2024-11-08 10:31:26,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442419532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855260592] [2024-11-08 10:31:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:26,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:26,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:26,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:26,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:31:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:26,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:31:26,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:26,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:26,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855260592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:26,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:26,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:26,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243981203] [2024-11-08 10:31:26,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:26,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:26,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:26,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:26,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:26,832 INFO L87 Difference]: Start difference. First operand 27480 states and 30322 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-08 10:31:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:27,595 INFO L93 Difference]: Finished difference Result 54552 states and 60193 transitions. [2024-11-08 10:31:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:27,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-08 10:31:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:27,629 INFO L225 Difference]: With dead ends: 54552 [2024-11-08 10:31:27,629 INFO L226 Difference]: Without dead ends: 27074 [2024-11-08 10:31:27,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:27,650 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:27,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 290 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:31:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27074 states. [2024-11-08 10:31:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27074 to 22603. [2024-11-08 10:31:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22603 states, 22602 states have (on average 1.0819838952305105) internal successors, (24455), 22602 states have internal predecessors, (24455), 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-08 10:31:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22603 states to 22603 states and 24455 transitions. [2024-11-08 10:31:27,913 INFO L78 Accepts]: Start accepts. Automaton has 22603 states and 24455 transitions. Word has length 347 [2024-11-08 10:31:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:27,913 INFO L471 AbstractCegarLoop]: Abstraction has 22603 states and 24455 transitions. [2024-11-08 10:31:27,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-08 10:31:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22603 states and 24455 transitions. [2024-11-08 10:31:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-08 10:31:27,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:27,936 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:27,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:28,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 10:31:28,137 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:28,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1540798708, now seen corresponding path program 1 times [2024-11-08 10:31:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:28,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183435632] [2024-11-08 10:31:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:28,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-08 10:31:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183435632] [2024-11-08 10:31:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183435632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:28,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522365463] [2024-11-08 10:31:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:28,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:28,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:28,416 INFO L87 Difference]: Start difference. First operand 22603 states and 24455 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 2 states have internal predecessors, (305), 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-08 10:31:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:28,716 INFO L93 Difference]: Finished difference Result 67803 states and 73359 transitions. [2024-11-08 10:31:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 2 states have internal predecessors, (305), 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 397 [2024-11-08 10:31:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:28,760 INFO L225 Difference]: With dead ends: 67803 [2024-11-08 10:31:28,760 INFO L226 Difference]: Without dead ends: 45202 [2024-11-08 10:31:28,778 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-08 10:31:28,779 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 185 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:28,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 485 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:31:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45202 states. [2024-11-08 10:31:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45202 to 45199. [2024-11-08 10:31:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45199 states, 45198 states have (on average 1.0816850303110757) internal successors, (48890), 45198 states have internal predecessors, (48890), 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-08 10:31:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45199 states to 45199 states and 48890 transitions. [2024-11-08 10:31:29,271 INFO L78 Accepts]: Start accepts. Automaton has 45199 states and 48890 transitions. Word has length 397 [2024-11-08 10:31:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:29,271 INFO L471 AbstractCegarLoop]: Abstraction has 45199 states and 48890 transitions. [2024-11-08 10:31:29,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 2 states have internal predecessors, (305), 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-08 10:31:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 45199 states and 48890 transitions. [2024-11-08 10:31:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-08 10:31:29,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:29,304 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:29,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:31:29,304 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:29,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2020423567, now seen corresponding path program 1 times [2024-11-08 10:31:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:29,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044328667] [2024-11-08 10:31:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-08 10:31:29,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044328667] [2024-11-08 10:31:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044328667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516060831] [2024-11-08 10:31:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:29,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:29,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:29,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:29,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:31:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:30,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:31:30,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-08 10:31:30,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516060831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:30,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145213162] [2024-11-08 10:31:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:30,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:30,296 INFO L87 Difference]: Start difference. First operand 45199 states and 48890 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-08 10:31:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:30,943 INFO L93 Difference]: Finished difference Result 103627 states and 112088 transitions. [2024-11-08 10:31:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 401 [2024-11-08 10:31:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:30,945 INFO L225 Difference]: With dead ends: 103627 [2024-11-08 10:31:30,945 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:31:30,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:30,982 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 51 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:30,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 319 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:31:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:31:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:31:30,982 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-08 10:31:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:31:30,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 401 [2024-11-08 10:31:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:30,983 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:31:30,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-08 10:31:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:31:30,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:31:30,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:31:31,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:31,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:31:31,191 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:31,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:31:36,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:31:36,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:31:36 BoogieIcfgContainer [2024-11-08 10:31:36,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:31:36,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:31:36,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:31:36,459 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:31:36,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:31:03" (3/4) ... [2024-11-08 10:31:36,462 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:31:36,498 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:31:36,500 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:31:36,502 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:31:36,504 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:31:36,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:31:36,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:31:36,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:31:36,716 INFO L158 Benchmark]: Toolchain (without parser) took 36248.85ms. Allocated memory was 180.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 124.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-08 10:31:36,716 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 180.4MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:31:36,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 955.80ms. Allocated memory is still 180.4MB. Free memory was 124.2MB in the beginning and 58.5MB in the end (delta: 65.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-08 10:31:36,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 230.55ms. Allocated memory is still 180.4MB. Free memory was 58.5MB in the beginning and 137.0MB in the end (delta: -78.5MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-08 10:31:36,717 INFO L158 Benchmark]: Boogie Preprocessor took 197.44ms. Allocated memory is still 180.4MB. Free memory was 137.0MB in the beginning and 124.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:31:36,718 INFO L158 Benchmark]: RCFGBuilder took 2105.51ms. Allocated memory was 180.4MB in the beginning and 281.0MB in the end (delta: 100.7MB). Free memory was 124.4MB in the beginning and 162.5MB in the end (delta: -38.1MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2024-11-08 10:31:36,718 INFO L158 Benchmark]: TraceAbstraction took 32495.93ms. Allocated memory was 281.0MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 162.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-08 10:31:36,718 INFO L158 Benchmark]: Witness Printer took 256.17ms. Allocated memory is still 2.4GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 10:31:36,720 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.26ms. Allocated memory is still 180.4MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 955.80ms. Allocated memory is still 180.4MB. Free memory was 124.2MB in the beginning and 58.5MB in the end (delta: 65.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 230.55ms. Allocated memory is still 180.4MB. Free memory was 58.5MB in the beginning and 137.0MB in the end (delta: -78.5MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 197.44ms. Allocated memory is still 180.4MB. Free memory was 137.0MB in the beginning and 124.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2105.51ms. Allocated memory was 180.4MB in the beginning and 281.0MB in the end (delta: 100.7MB). Free memory was 124.4MB in the beginning and 162.5MB in the end (delta: -38.1MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32495.93ms. Allocated memory was 281.0MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 162.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 256.17ms. Allocated memory is still 2.4GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 1582]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.1s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2419 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2419 mSDsluCounter, 3504 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 527 mSDsCounter, 1416 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9125 IncrementalHoareTripleChecker+Invalid, 10541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1416 mSolverCounterUnsat, 2977 mSDtfsCounter, 9125 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1840 GetRequests, 1810 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45199occurred in iteration=15, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 8822 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 5951 NumberOfCodeBlocks, 5951 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5929 ConstructedInterpolants, 0 QuantifiedInterpolants, 19358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3244 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 2785/2821 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: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0)) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a3 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((((a7 <= 0) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a15 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:31:36,758 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