./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_label33.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 2175eebe64ea8c44232439b071a8f90dfd26c4ea62c7d488d233e915c25d2276 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:40:47,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:40:47,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:40:47,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:40:47,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:40:47,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:40:47,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:40:47,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:40:47,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:40:47,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:40:47,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:40:47,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:40:47,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:40:47,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:40:47,967 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:40:47,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:40:47,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:40:47,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:40:47,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:40:47,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:40:47,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:40:47,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:40:47,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:40:47,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:40:47,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:40:47,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:40:47,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:40:47,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:40:47,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:40:47,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:40:47,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:40:47,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:40:47,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:40:47,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:40:47,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:40:47,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:40:47,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:40:47,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:40:47,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:40:47,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:40:47,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:40:47,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:40:47,976 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 -> 2175eebe64ea8c44232439b071a8f90dfd26c4ea62c7d488d233e915c25d2276 [2024-11-09 18:40:48,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:40:48,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:40:48,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:40:48,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:40:48,271 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:40:48,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label33.c [2024-11-09 18:40:49,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:40:49,825 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:40:49,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label33.c [2024-11-09 18:40:49,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b36b1213/eb68910cb0db402a953116611d3ecf89/FLAG2b40f77db [2024-11-09 18:40:50,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b36b1213/eb68910cb0db402a953116611d3ecf89 [2024-11-09 18:40:50,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:40:50,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:40:50,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:40:50,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:40:50,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:40:50,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:50,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5936d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50, skipping insertion in model container [2024-11-09 18:40:50,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:50,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:40:50,590 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_label33.c[55678,55691] [2024-11-09 18:40:50,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:40:50,637 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:40:50,773 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_label33.c[55678,55691] [2024-11-09 18:40:50,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:40:50,802 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:40:50,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50 WrapperNode [2024-11-09 18:40:50,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:40:50,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:40:50,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:40:50,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:40:50,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:50,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:50,904 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1771 [2024-11-09 18:40:50,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:40:50,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:40:50,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:40:50,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:40:50,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:50,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:50,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:50,970 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-09 18:40:50,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:50,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:51,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:51,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:51,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:51,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:51,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:40:51,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:40:51,031 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:40:51,031 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:40:51,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (1/1) ... [2024-11-09 18:40:51,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:40:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:40:51,096 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-09 18:40:51,099 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-09 18:40:51,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:40:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:40:51,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:40:51,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:40:51,241 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:40:51,243 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:40:52,771 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-09 18:40:52,771 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:40:52,792 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:40:52,795 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:40:52,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:40:52 BoogieIcfgContainer [2024-11-09 18:40:52,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:40:52,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:40:52,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:40:52,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:40:52,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:40:50" (1/3) ... [2024-11-09 18:40:52,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13df1573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:40:52, skipping insertion in model container [2024-11-09 18:40:52,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:50" (2/3) ... [2024-11-09 18:40:52,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13df1573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:40:52, skipping insertion in model container [2024-11-09 18:40:52,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:40:52" (3/3) ... [2024-11-09 18:40:52,803 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label33.c [2024-11-09 18:40:52,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:40:52,817 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:40:52,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:40:52,882 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;@4d33b367, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:40:52,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:40:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 303 states have (on average 1.7227722772277227) internal successors, (522), 304 states have internal predecessors, (522), 0 states have call successors, (0), 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-09 18:40:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 18:40:52,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:40:52,903 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] [2024-11-09 18:40:52,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:40:52,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:40:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -948171541, now seen corresponding path program 1 times [2024-11-09 18:40:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:40:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030199520] [2024-11-09 18:40:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:52,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:40:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:53,558 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-09 18:40:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:40:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030199520] [2024-11-09 18:40:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030199520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:40:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:40:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:40:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317163327] [2024-11-09 18:40:53,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:40:53,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:40:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:40:53,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:40:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:40:53,587 INFO L87 Difference]: Start difference. First operand has 305 states, 303 states have (on average 1.7227722772277227) internal successors, (522), 304 states have internal predecessors, (522), 0 states have call successors, (0), 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 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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-09 18:40:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:40:54,499 INFO L93 Difference]: Finished difference Result 863 states and 1504 transitions. [2024-11-09 18:40:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:40:54,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-11-09 18:40:54,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:40:54,511 INFO L225 Difference]: With dead ends: 863 [2024-11-09 18:40:54,511 INFO L226 Difference]: Without dead ends: 465 [2024-11-09 18:40:54,514 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-09 18:40:54,517 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 129 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 18:40:54,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 191 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 18:40:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-09 18:40:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2024-11-09 18:40:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.5346320346320346) internal successors, (709), 462 states have internal predecessors, (709), 0 states have call successors, (0), 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-09 18:40:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 709 transitions. [2024-11-09 18:40:54,562 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 709 transitions. Word has length 161 [2024-11-09 18:40:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:40:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 709 transitions. [2024-11-09 18:40:54,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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-09 18:40:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 709 transitions. [2024-11-09 18:40:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 18:40:54,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:40:54,566 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 18:40:54,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:40:54,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:40:54,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:40:54,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1835034971, now seen corresponding path program 1 times [2024-11-09 18:40:54,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:40:54,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069059300] [2024-11-09 18:40:54,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:54,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:40:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:40:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:40:54,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069059300] [2024-11-09 18:40:54,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069059300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:40:54,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:40:54,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:40:54,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854736726] [2024-11-09 18:40:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:40:54,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:40:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:40:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:40:54,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:40:54,748 INFO L87 Difference]: Start difference. First operand 463 states and 709 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 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-09 18:40:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:40:55,401 INFO L93 Difference]: Finished difference Result 1352 states and 2087 transitions. [2024-11-09 18:40:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:40:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2024-11-09 18:40:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:40:55,404 INFO L225 Difference]: With dead ends: 1352 [2024-11-09 18:40:55,404 INFO L226 Difference]: Without dead ends: 891 [2024-11-09 18:40:55,406 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-09 18:40:55,407 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 247 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 97 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:40:55,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 97 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:40:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-09 18:40:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 875. [2024-11-09 18:40:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.5091533180778032) internal successors, (1319), 874 states have internal predecessors, (1319), 0 states have call successors, (0), 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-09 18:40:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1319 transitions. [2024-11-09 18:40:55,438 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1319 transitions. Word has length 170 [2024-11-09 18:40:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:40:55,438 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1319 transitions. [2024-11-09 18:40:55,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 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-09 18:40:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1319 transitions. [2024-11-09 18:40:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 18:40:55,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:40:55,442 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:40:55,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:40:55,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:40:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:40:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash -596229568, now seen corresponding path program 1 times [2024-11-09 18:40:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:40:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374077221] [2024-11-09 18:40:55,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:40:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:40:55,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:40:55,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374077221] [2024-11-09 18:40:55,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374077221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:40:55,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558147793] [2024-11-09 18:40:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:55,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:40:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:40:55,720 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-09 18:40:55,722 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-09 18:40:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:55,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:40:55,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:40:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 18:40:55,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:40:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558147793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:40:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:40:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 18:40:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223630736] [2024-11-09 18:40:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:40:55,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:40:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:40:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:40:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:40:55,926 INFO L87 Difference]: Start difference. First operand 875 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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-09 18:40:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:40:56,144 INFO L93 Difference]: Finished difference Result 2616 states and 3948 transitions. [2024-11-09 18:40:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:40:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 184 [2024-11-09 18:40:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:40:56,149 INFO L225 Difference]: With dead ends: 2616 [2024-11-09 18:40:56,150 INFO L226 Difference]: Without dead ends: 1743 [2024-11-09 18:40:56,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 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-09 18:40:56,152 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 361 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:40:56,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 605 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:40:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-11-09 18:40:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1738. [2024-11-09 18:40:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 1.5100748416810592) internal successors, (2623), 1737 states have internal predecessors, (2623), 0 states have call successors, (0), 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-09 18:40:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2623 transitions. [2024-11-09 18:40:56,186 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2623 transitions. Word has length 184 [2024-11-09 18:40:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:40:56,187 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2623 transitions. [2024-11-09 18:40:56,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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-09 18:40:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2623 transitions. [2024-11-09 18:40:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-09 18:40:56,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:40:56,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:40:56,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 18:40:56,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:40:56,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:40:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:40:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash -233808990, now seen corresponding path program 1 times [2024-11-09 18:40:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:40:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642897800] [2024-11-09 18:40:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:40:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:40:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:40:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642897800] [2024-11-09 18:40:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642897800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:40:56,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:40:56,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:40:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992386342] [2024-11-09 18:40:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:40:56,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:40:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:40:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:40:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:40:56,607 INFO L87 Difference]: Start difference. First operand 1738 states and 2623 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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-09 18:40:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:40:57,279 INFO L93 Difference]: Finished difference Result 5133 states and 7765 transitions. [2024-11-09 18:40:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:40:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2024-11-09 18:40:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:40:57,289 INFO L225 Difference]: With dead ends: 5133 [2024-11-09 18:40:57,290 INFO L226 Difference]: Without dead ends: 3397 [2024-11-09 18:40:57,294 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-09 18:40:57,297 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 239 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:40:57,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 177 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:40:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2024-11-09 18:40:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3395. [2024-11-09 18:40:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3395 states, 3394 states have (on average 1.4354743665291692) internal successors, (4872), 3394 states have internal predecessors, (4872), 0 states have call successors, (0), 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-09 18:40:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 4872 transitions. [2024-11-09 18:40:57,352 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 4872 transitions. Word has length 185 [2024-11-09 18:40:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:40:57,352 INFO L471 AbstractCegarLoop]: Abstraction has 3395 states and 4872 transitions. [2024-11-09 18:40:57,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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-09 18:40:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 4872 transitions. [2024-11-09 18:40:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 18:40:57,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:40:57,358 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2024-11-09 18:40:57,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:40:57,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:40:57,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:40:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1310343099, now seen corresponding path program 1 times [2024-11-09 18:40:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:40:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456114953] [2024-11-09 18:40:57,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:40:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:40:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:40:57,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456114953] [2024-11-09 18:40:57,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456114953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:40:57,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829110511] [2024-11-09 18:40:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:57,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:40:57,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:40:57,683 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-09 18:40:57,684 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-09 18:40:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:57,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:40:57,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:40:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:40:57,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:40:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829110511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:40:57,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:40:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 18:40:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821507285] [2024-11-09 18:40:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:40:57,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:40:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:40:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:40:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:40:57,835 INFO L87 Difference]: Start difference. First operand 3395 states and 4872 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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-09 18:40:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:40:58,526 INFO L93 Difference]: Finished difference Result 10058 states and 14446 transitions. [2024-11-09 18:40:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:40:58,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 186 [2024-11-09 18:40:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:40:58,543 INFO L225 Difference]: With dead ends: 10058 [2024-11-09 18:40:58,544 INFO L226 Difference]: Without dead ends: 6665 [2024-11-09 18:40:58,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:40:58,548 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 232 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:40:58,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 417 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:40:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2024-11-09 18:40:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6659. [2024-11-09 18:40:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6659 states, 6658 states have (on average 1.2826674677080205) internal successors, (8540), 6658 states have internal predecessors, (8540), 0 states have call successors, (0), 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-09 18:40:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6659 states to 6659 states and 8540 transitions. [2024-11-09 18:40:58,655 INFO L78 Accepts]: Start accepts. Automaton has 6659 states and 8540 transitions. Word has length 186 [2024-11-09 18:40:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:40:58,656 INFO L471 AbstractCegarLoop]: Abstraction has 6659 states and 8540 transitions. [2024-11-09 18:40:58,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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-09 18:40:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6659 states and 8540 transitions. [2024-11-09 18:40:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 18:40:58,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:40:58,664 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:40:58,677 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-09 18:40:58,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:40:58,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:40:58,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:40:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1377591571, now seen corresponding path program 1 times [2024-11-09 18:40:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:40:58,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193344215] [2024-11-09 18:40:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:58,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:40:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 18:40:58,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:40:58,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193344215] [2024-11-09 18:40:58,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193344215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:40:58,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:40:58,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:40:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314208514] [2024-11-09 18:40:58,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:40:58,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:40:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:40:58,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:40:58,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:40:58,983 INFO L87 Difference]: Start difference. First operand 6659 states and 8540 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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-09 18:40:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:40:59,356 INFO L93 Difference]: Finished difference Result 13252 states and 16992 transitions. [2024-11-09 18:40:59,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:40:59,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 199 [2024-11-09 18:40:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:40:59,374 INFO L225 Difference]: With dead ends: 13252 [2024-11-09 18:40:59,375 INFO L226 Difference]: Without dead ends: 6595 [2024-11-09 18:40:59,382 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-09 18:40:59,383 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:40:59,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 33 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:40:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6595 states. [2024-11-09 18:40:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6595 to 6595. [2024-11-09 18:40:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6595 states, 6594 states have (on average 1.254170457992114) internal successors, (8270), 6594 states have internal predecessors, (8270), 0 states have call successors, (0), 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-09 18:40:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6595 states to 6595 states and 8270 transitions. [2024-11-09 18:40:59,516 INFO L78 Accepts]: Start accepts. Automaton has 6595 states and 8270 transitions. Word has length 199 [2024-11-09 18:40:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:40:59,517 INFO L471 AbstractCegarLoop]: Abstraction has 6595 states and 8270 transitions. [2024-11-09 18:40:59,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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-09 18:40:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6595 states and 8270 transitions. [2024-11-09 18:40:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-09 18:40:59,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:40:59,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:40:59,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:40:59,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:40:59,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:40:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2131691534, now seen corresponding path program 1 times [2024-11-09 18:40:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:40:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208472587] [2024-11-09 18:40:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:40:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:40:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:40:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:40:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:40:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208472587] [2024-11-09 18:40:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208472587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:40:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:40:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:40:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051180152] [2024-11-09 18:40:59,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:40:59,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:40:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:40:59,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:40:59,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:40:59,756 INFO L87 Difference]: Start difference. First operand 6595 states and 8270 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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-09 18:41:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:00,465 INFO L93 Difference]: Finished difference Result 16476 states and 20602 transitions. [2024-11-09 18:41:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:00,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-11-09 18:41:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:00,492 INFO L225 Difference]: With dead ends: 16476 [2024-11-09 18:41:00,492 INFO L226 Difference]: Without dead ends: 9883 [2024-11-09 18:41:00,504 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-09 18:41:00,504 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 196 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:00,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 110 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:41:00,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9883 states. [2024-11-09 18:41:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9883 to 9881. [2024-11-09 18:41:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9881 states, 9880 states have (on average 1.238259109311741) internal successors, (12234), 9880 states have internal predecessors, (12234), 0 states have call successors, (0), 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-09 18:41:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9881 states to 9881 states and 12234 transitions. [2024-11-09 18:41:00,650 INFO L78 Accepts]: Start accepts. Automaton has 9881 states and 12234 transitions. Word has length 203 [2024-11-09 18:41:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:00,651 INFO L471 AbstractCegarLoop]: Abstraction has 9881 states and 12234 transitions. [2024-11-09 18:41:00,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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-09 18:41:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 9881 states and 12234 transitions. [2024-11-09 18:41:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 18:41:00,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:00,662 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:41:00,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:41:00,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:00,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1880601599, now seen corresponding path program 1 times [2024-11-09 18:41:00,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551310732] [2024-11-09 18:41:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:41:01,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551310732] [2024-11-09 18:41:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551310732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:41:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429450330] [2024-11-09 18:41:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:01,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:41:01,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:41:01,098 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-09 18:41:01,099 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-09 18:41:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:01,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:41:01,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:41:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:41:01,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:41:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429450330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:01,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:41:01,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 18:41:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061424381] [2024-11-09 18:41:01,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:01,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:41:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:01,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:41:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:41:01,388 INFO L87 Difference]: Start difference. First operand 9881 states and 12234 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-09 18:41:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:02,095 INFO L93 Difference]: Finished difference Result 29592 states and 36650 transitions. [2024-11-09 18:41:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:02,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 211 [2024-11-09 18:41:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:02,135 INFO L225 Difference]: With dead ends: 29592 [2024-11-09 18:41:02,136 INFO L226 Difference]: Without dead ends: 19713 [2024-11-09 18:41:02,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:41:02,149 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 72 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:02,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 121 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:41:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2024-11-09 18:41:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 16013. [2024-11-09 18:41:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16013 states, 16012 states have (on average 1.266674993754684) internal successors, (20282), 16012 states have internal predecessors, (20282), 0 states have call successors, (0), 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-09 18:41:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16013 states to 16013 states and 20282 transitions. [2024-11-09 18:41:02,373 INFO L78 Accepts]: Start accepts. Automaton has 16013 states and 20282 transitions. Word has length 211 [2024-11-09 18:41:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:02,374 INFO L471 AbstractCegarLoop]: Abstraction has 16013 states and 20282 transitions. [2024-11-09 18:41:02,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-09 18:41:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16013 states and 20282 transitions. [2024-11-09 18:41:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 18:41:02,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:02,390 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 18:41:02,405 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-09 18:41:02,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:41:02,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash 269180091, now seen corresponding path program 1 times [2024-11-09 18:41:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:02,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440455504] [2024-11-09 18:41:02,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 18:41:02,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:02,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440455504] [2024-11-09 18:41:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440455504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:02,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:41:02,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:41:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380392963] [2024-11-09 18:41:02,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:02,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:41:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:02,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:41:02,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:41:02,806 INFO L87 Difference]: Start difference. First operand 16013 states and 20282 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 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-09 18:41:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:03,439 INFO L93 Difference]: Finished difference Result 41408 states and 53516 transitions. [2024-11-09 18:41:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-11-09 18:41:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:03,474 INFO L225 Difference]: With dead ends: 41408 [2024-11-09 18:41:03,474 INFO L226 Difference]: Without dead ends: 25397 [2024-11-09 18:41:03,493 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-09 18:41:03,495 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 175 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:03,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 152 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:41:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25397 states. [2024-11-09 18:41:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25397 to 25397. [2024-11-09 18:41:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25397 states, 25396 states have (on average 1.205544180185856) internal successors, (30616), 25396 states have internal predecessors, (30616), 0 states have call successors, (0), 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-09 18:41:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25397 states to 25397 states and 30616 transitions. [2024-11-09 18:41:03,873 INFO L78 Accepts]: Start accepts. Automaton has 25397 states and 30616 transitions. Word has length 230 [2024-11-09 18:41:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:03,873 INFO L471 AbstractCegarLoop]: Abstraction has 25397 states and 30616 transitions. [2024-11-09 18:41:03,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 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-09 18:41:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 25397 states and 30616 transitions. [2024-11-09 18:41:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-09 18:41:03,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:03,895 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:41:03,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:41:03,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:03,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 906388832, now seen corresponding path program 1 times [2024-11-09 18:41:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131234428] [2024-11-09 18:41:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:41:04,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:04,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131234428] [2024-11-09 18:41:04,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131234428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:04,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:41:04,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:41:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921444813] [2024-11-09 18:41:04,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:41:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:41:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:41:04,243 INFO L87 Difference]: Start difference. First operand 25397 states and 30616 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:41:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:05,362 INFO L93 Difference]: Finished difference Result 60210 states and 72712 transitions. [2024-11-09 18:41:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:41:05,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2024-11-09 18:41:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:05,416 INFO L225 Difference]: With dead ends: 60210 [2024-11-09 18:41:05,416 INFO L226 Difference]: Without dead ends: 34815 [2024-11-09 18:41:05,441 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-09 18:41:05,442 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 325 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:05,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 92 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 18:41:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34815 states. [2024-11-09 18:41:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34815 to 34389. [2024-11-09 18:41:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34389 states, 34388 states have (on average 1.1863149936024195) internal successors, (40795), 34388 states have internal predecessors, (40795), 0 states have call successors, (0), 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-09 18:41:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34389 states to 34389 states and 40795 transitions. [2024-11-09 18:41:05,916 INFO L78 Accepts]: Start accepts. Automaton has 34389 states and 40795 transitions. Word has length 278 [2024-11-09 18:41:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:05,917 INFO L471 AbstractCegarLoop]: Abstraction has 34389 states and 40795 transitions. [2024-11-09 18:41:05,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:41:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 34389 states and 40795 transitions. [2024-11-09 18:41:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-09 18:41:05,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:05,942 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:41:05,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:41:05,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:05,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash -810794558, now seen corresponding path program 1 times [2024-11-09 18:41:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:05,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031195702] [2024-11-09 18:41:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:05,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 87 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 18:41:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:06,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031195702] [2024-11-09 18:41:06,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031195702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:41:06,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901688677] [2024-11-09 18:41:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:06,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:41:06,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:41:06,277 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-09 18:41:06,278 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-09 18:41:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:06,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:41:06,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:41:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 18:41:06,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:41:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901688677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:41:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 18:41:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680284442] [2024-11-09 18:41:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:06,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:41:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:41:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:41:06,649 INFO L87 Difference]: Start difference. First operand 34389 states and 40795 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-09 18:41:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:07,429 INFO L93 Difference]: Finished difference Result 90675 states and 107969 transitions. [2024-11-09 18:41:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:07,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 280 [2024-11-09 18:41:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:07,502 INFO L225 Difference]: With dead ends: 90675 [2024-11-09 18:41:07,502 INFO L226 Difference]: Without dead ends: 56288 [2024-11-09 18:41:07,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 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-09 18:41:07,533 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 97 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:07,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 121 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:41:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56288 states. [2024-11-09 18:41:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56288 to 56278. [2024-11-09 18:41:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56278 states, 56277 states have (on average 1.174796097873021) internal successors, (66114), 56277 states have internal predecessors, (66114), 0 states have call successors, (0), 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-09 18:41:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56278 states to 56278 states and 66114 transitions. [2024-11-09 18:41:08,309 INFO L78 Accepts]: Start accepts. Automaton has 56278 states and 66114 transitions. Word has length 280 [2024-11-09 18:41:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:08,309 INFO L471 AbstractCegarLoop]: Abstraction has 56278 states and 66114 transitions. [2024-11-09 18:41:08,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-09 18:41:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 56278 states and 66114 transitions. [2024-11-09 18:41:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-09 18:41:08,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:08,339 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 18:41:08,353 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-09 18:41:08,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:41:08,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:08,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:08,541 INFO L85 PathProgramCache]: Analyzing trace with hash -430123837, now seen corresponding path program 1 times [2024-11-09 18:41:08,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:08,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754506032] [2024-11-09 18:41:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:08,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 18:41:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754506032] [2024-11-09 18:41:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754506032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:08,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:41:08,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:41:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347634276] [2024-11-09 18:41:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:08,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:41:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:41:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:41:08,838 INFO L87 Difference]: Start difference. First operand 56278 states and 66114 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:41:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:09,671 INFO L93 Difference]: Finished difference Result 105770 states and 123983 transitions. [2024-11-09 18:41:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:09,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2024-11-09 18:41:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:09,744 INFO L225 Difference]: With dead ends: 105770 [2024-11-09 18:41:09,744 INFO L226 Difference]: Without dead ends: 49494 [2024-11-09 18:41:09,783 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-09 18:41:09,784 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 247 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:09,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 334 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:41:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49494 states. [2024-11-09 18:41:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49494 to 49491. [2024-11-09 18:41:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49491 states, 49490 states have (on average 1.1305718326934735) internal successors, (55952), 49490 states have internal predecessors, (55952), 0 states have call successors, (0), 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-09 18:41:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49491 states to 49491 states and 55952 transitions. [2024-11-09 18:41:10,721 INFO L78 Accepts]: Start accepts. Automaton has 49491 states and 55952 transitions. Word has length 297 [2024-11-09 18:41:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:10,722 INFO L471 AbstractCegarLoop]: Abstraction has 49491 states and 55952 transitions. [2024-11-09 18:41:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:41:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 49491 states and 55952 transitions. [2024-11-09 18:41:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-09 18:41:10,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:10,761 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:41:10,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 18:41:10,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:10,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1760072738, now seen corresponding path program 1 times [2024-11-09 18:41:10,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:10,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495691771] [2024-11-09 18:41:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-09 18:41:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495691771] [2024-11-09 18:41:11,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495691771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:11,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:41:11,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:41:11,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682763441] [2024-11-09 18:41:11,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:11,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:41:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:41:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:41:11,040 INFO L87 Difference]: Start difference. First operand 49491 states and 55952 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-09 18:41:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:11,832 INFO L93 Difference]: Finished difference Result 95911 states and 108408 transitions. [2024-11-09 18:41:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 325 [2024-11-09 18:41:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:11,885 INFO L225 Difference]: With dead ends: 95911 [2024-11-09 18:41:11,885 INFO L226 Difference]: Without dead ends: 46422 [2024-11-09 18:41:11,900 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-09 18:41:11,901 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 225 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:11,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 312 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:41:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46422 states. [2024-11-09 18:41:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46422 to 37641. [2024-11-09 18:41:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37641 states, 37640 states have (on average 1.106163655685441) internal successors, (41636), 37640 states have internal predecessors, (41636), 0 states have call successors, (0), 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-09 18:41:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37641 states to 37641 states and 41636 transitions. [2024-11-09 18:41:12,540 INFO L78 Accepts]: Start accepts. Automaton has 37641 states and 41636 transitions. Word has length 325 [2024-11-09 18:41:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:12,540 INFO L471 AbstractCegarLoop]: Abstraction has 37641 states and 41636 transitions. [2024-11-09 18:41:12,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-09 18:41:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 37641 states and 41636 transitions. [2024-11-09 18:41:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-09 18:41:12,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:12,574 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:41:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 18:41:12,574 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:12,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash -144199890, now seen corresponding path program 1 times [2024-11-09 18:41:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705959681] [2024-11-09 18:41:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-09 18:41:12,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705959681] [2024-11-09 18:41:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705959681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:41:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:41:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849634861] [2024-11-09 18:41:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:41:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:41:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:41:12,872 INFO L87 Difference]: Start difference. First operand 37641 states and 41636 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 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-09 18:41:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:13,428 INFO L93 Difference]: Finished difference Result 104519 states and 115367 transitions. [2024-11-09 18:41:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 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 360 [2024-11-09 18:41:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:13,506 INFO L225 Difference]: With dead ends: 104519 [2024-11-09 18:41:13,506 INFO L226 Difference]: Without dead ends: 66880 [2024-11-09 18:41:13,536 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-09 18:41:13,536 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 205 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:13,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 456 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:41:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66880 states. [2024-11-09 18:41:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66880 to 66877. [2024-11-09 18:41:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66877 states, 66876 states have (on average 1.1017853938632693) internal successors, (73683), 66876 states have internal predecessors, (73683), 0 states have call successors, (0), 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-09 18:41:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66877 states to 66877 states and 73683 transitions. [2024-11-09 18:41:14,446 INFO L78 Accepts]: Start accepts. Automaton has 66877 states and 73683 transitions. Word has length 360 [2024-11-09 18:41:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:14,447 INFO L471 AbstractCegarLoop]: Abstraction has 66877 states and 73683 transitions. [2024-11-09 18:41:14,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 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-09 18:41:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 66877 states and 73683 transitions. [2024-11-09 18:41:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-11-09 18:41:14,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:14,473 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:41:14,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 18:41:14,473 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:14,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash 823622449, now seen corresponding path program 1 times [2024-11-09 18:41:14,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:14,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564747293] [2024-11-09 18:41:14,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:14,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2024-11-09 18:41:15,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:15,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564747293] [2024-11-09 18:41:15,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564747293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:41:15,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623645079] [2024-11-09 18:41:15,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:15,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:41:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:41:15,195 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-09 18:41:15,195 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-09 18:41:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:15,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:41:15,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:41:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-11-09 18:41:15,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:41:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623645079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:41:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 18:41:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683360848] [2024-11-09 18:41:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:15,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:41:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:41:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:41:15,516 INFO L87 Difference]: Start difference. First operand 66877 states and 73683 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-09 18:41:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:16,121 INFO L93 Difference]: Finished difference Result 176875 states and 194722 transitions. [2024-11-09 18:41:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 396 [2024-11-09 18:41:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:16,264 INFO L225 Difference]: With dead ends: 176875 [2024-11-09 18:41:16,264 INFO L226 Difference]: Without dead ends: 110000 [2024-11-09 18:41:16,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 395 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-09 18:41:16,320 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 286 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:16,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 814 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:41:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110000 states. [2024-11-09 18:41:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110000 to 109997. [2024-11-09 18:41:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109997 states, 109996 states have (on average 1.091348776319139) internal successors, (120044), 109996 states have internal predecessors, (120044), 0 states have call successors, (0), 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-09 18:41:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109997 states to 109997 states and 120044 transitions. [2024-11-09 18:41:18,131 INFO L78 Accepts]: Start accepts. Automaton has 109997 states and 120044 transitions. Word has length 396 [2024-11-09 18:41:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:18,132 INFO L471 AbstractCegarLoop]: Abstraction has 109997 states and 120044 transitions. [2024-11-09 18:41:18,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-09 18:41:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 109997 states and 120044 transitions. [2024-11-09 18:41:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-11-09 18:41:18,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:41:18,180 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:41:18,195 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-09 18:41:18,380 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,SelfDestructingSolverStorable14 [2024-11-09 18:41:18,381 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:41:18,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:41:18,382 INFO L85 PathProgramCache]: Analyzing trace with hash -224790291, now seen corresponding path program 1 times [2024-11-09 18:41:18,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:41:18,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268315897] [2024-11-09 18:41:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:41:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:41:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:41:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 18:41:18,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:41:18,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268315897] [2024-11-09 18:41:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268315897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:41:18,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:41:18,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:41:18,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634119486] [2024-11-09 18:41:18,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:41:18,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:41:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:41:18,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:41:18,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:41:18,946 INFO L87 Difference]: Start difference. First operand 109997 states and 120044 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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-09 18:41:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:41:19,779 INFO L93 Difference]: Finished difference Result 191180 states and 207986 transitions. [2024-11-09 18:41:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:41:19,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 414 [2024-11-09 18:41:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:41:19,782 INFO L225 Difference]: With dead ends: 191180 [2024-11-09 18:41:19,782 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:41:19,849 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-09 18:41:19,850 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 116 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:41:19,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 341 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:41:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:41:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:41:19,851 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-09 18:41:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:41:19,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 414 [2024-11-09 18:41:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:41:19,852 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:41:19,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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-09 18:41:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:41:19,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:41:19,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:41:19,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 18:41:19,858 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:41:19,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:41:27,101 WARN L286 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 446 DAG size of output: 440 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 18:41:30,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:41:30,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:41:30 BoogieIcfgContainer [2024-11-09 18:41:30,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:41:30,196 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:41:30,196 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:41:30,196 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:41:30,196 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:40:52" (3/4) ... [2024-11-09 18:41:30,198 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:41:30,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:41:30,221 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:41:30,223 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:41:30,225 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:41:30,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:41:30,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:41:30,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:41:30,403 INFO L158 Benchmark]: Toolchain (without parser) took 40279.44ms. Allocated memory was 176.2MB in the beginning and 11.9GB in the end (delta: 11.7GB). Free memory was 138.9MB in the beginning and 7.2GB in the end (delta: -7.0GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2024-11-09 18:41:30,404 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:41:30,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.15ms. Allocated memory is still 176.2MB. Free memory was 138.5MB in the beginning and 73.5MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-09 18:41:30,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.28ms. Allocated memory is still 176.2MB. Free memory was 73.5MB in the beginning and 57.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 18:41:30,405 INFO L158 Benchmark]: Boogie Preprocessor took 125.44ms. Allocated memory is still 176.2MB. Free memory was 57.8MB in the beginning and 46.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 18:41:30,405 INFO L158 Benchmark]: IcfgBuilder took 1764.68ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 46.3MB in the beginning and 191.1MB in the end (delta: -144.8MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-09 18:41:30,405 INFO L158 Benchmark]: TraceAbstraction took 37397.80ms. Allocated memory was 247.5MB in the beginning and 11.9GB in the end (delta: 11.7GB). Free memory was 191.1MB in the beginning and 7.2GB in the end (delta: -7.0GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2024-11-09 18:41:30,405 INFO L158 Benchmark]: Witness Printer took 207.03ms. Allocated memory is still 11.9GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 18:41:30,408 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.09ms. Allocated memory is still 109.1MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.15ms. Allocated memory is still 176.2MB. Free memory was 138.5MB in the beginning and 73.5MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.28ms. Allocated memory is still 176.2MB. Free memory was 73.5MB in the beginning and 57.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.44ms. Allocated memory is still 176.2MB. Free memory was 57.8MB in the beginning and 46.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 1764.68ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 46.3MB in the beginning and 191.1MB in the end (delta: -144.8MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 37397.80ms. Allocated memory was 247.5MB in the beginning and 11.9GB in the end (delta: 11.7GB). Free memory was 191.1MB in the beginning and 7.2GB in the end (delta: -7.0GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. * Witness Printer took 207.03ms. Allocated memory is still 11.9GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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: 1522]: 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, 305 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.0s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3474 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3474 mSDsluCounter, 4373 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1030 mSDsCounter, 1631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8354 IncrementalHoareTripleChecker+Invalid, 9985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1631 mSolverCounterUnsat, 3343 mSDtfsCounter, 8354 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1294 GetRequests, 1267 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109997occurred in iteration=15, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 12959 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 5336 NumberOfCodeBlocks, 5336 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5315 ConstructedInterpolants, 0 QuantifiedInterpolants, 8636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2632 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 3547/3594 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]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:41:30,441 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