./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label53.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 701e1463647edc9b85a4510e73732e8fae9832885edcd79ec0113cacf754e2d5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:09:48,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:09:48,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:09:48,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:09:48,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:09:48,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:09:48,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:09:48,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:09:48,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:09:48,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:09:48,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:09:48,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:09:48,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:09:48,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:09:48,903 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:09:48,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:09:48,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:09:48,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:09:48,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:09:48,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:09:48,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:09:48,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:09:48,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:09:48,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:09:48,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:09:48,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:09:48,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:09:48,907 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:09:48,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:09:48,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:09:48,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:09:48,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:09:48,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:48,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:09:48,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:09:48,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:09:48,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:09:48,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:09:48,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:09:48,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:09:48,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:09:48,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:09:48,912 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 -> 701e1463647edc9b85a4510e73732e8fae9832885edcd79ec0113cacf754e2d5 [2024-11-08 11:09:49,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:09:49,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:09:49,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:09:49,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:09:49,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:09:49,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label53.c [2024-11-08 11:09:50,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:09:50,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:09:50,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label53.c [2024-11-08 11:09:50,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e441240ac/af6f5e60518648b2a73a24f6760d13c5/FLAG7db1c472e [2024-11-08 11:09:50,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e441240ac/af6f5e60518648b2a73a24f6760d13c5 [2024-11-08 11:09:50,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:09:50,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:09:50,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:50,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:09:50,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:09:50,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:50,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e64bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50, skipping insertion in model container [2024-11-08 11:09:50,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:50,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:09:50,732 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/Problem10_label53.c[4908,4921] [2024-11-08 11:09:50,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:50,849 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:09:50,876 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/Problem10_label53.c[4908,4921] [2024-11-08 11:09:50,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:50,976 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:09:50,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50 WrapperNode [2024-11-08 11:09:50,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:50,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:50,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:09:50,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:09:50,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:50,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,038 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-08 11:09:51,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:51,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:09:51,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:09:51,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:09:51,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,116 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:09:51,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:09:51,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:09:51,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:09:51,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:09:51,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (1/1) ... [2024-11-08 11:09:51,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:51,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:51,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:09:51,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:09:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:09:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:09:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:09:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:09:51,283 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:09:51,285 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:09:52,046 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 11:09:52,046 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:09:52,063 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:09:52,064 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:09:52,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:52 BoogieIcfgContainer [2024-11-08 11:09:52,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:09:52,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:09:52,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:09:52,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:09:52,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:09:50" (1/3) ... [2024-11-08 11:09:52,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7999e916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:52, skipping insertion in model container [2024-11-08 11:09:52,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:50" (2/3) ... [2024-11-08 11:09:52,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7999e916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:52, skipping insertion in model container [2024-11-08 11:09:52,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:52" (3/3) ... [2024-11-08 11:09:52,072 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label53.c [2024-11-08 11:09:52,085 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:09:52,085 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:09:52,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:09:52,141 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;@1b449f0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:09:52,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:09:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 11:09:52,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:52,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:52,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:52,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:52,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1824112922, now seen corresponding path program 1 times [2024-11-08 11:09:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:52,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94084886] [2024-11-08 11:09:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94084886] [2024-11-08 11:09:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94084886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:52,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:52,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637495248] [2024-11-08 11:09:52,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:52,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:52,461 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:53,082 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-08 11:09:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-08 11:09:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:53,092 INFO L225 Difference]: With dead ends: 552 [2024-11-08 11:09:53,092 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 11:09:53,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:53,097 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:53,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:09:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 11:09:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-08 11:09:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-08 11:09:53,147 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 42 [2024-11-08 11:09:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:53,147 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-08 11:09:53,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-08 11:09:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 11:09:53,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:53,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:53,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:09:53,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:53,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1321315165, now seen corresponding path program 1 times [2024-11-08 11:09:53,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:53,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938088793] [2024-11-08 11:09:53,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:53,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:53,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938088793] [2024-11-08 11:09:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938088793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:53,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137316138] [2024-11-08 11:09:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:53,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:53,473 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:53,830 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2024-11-08 11:09:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:53,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-08 11:09:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:53,833 INFO L225 Difference]: With dead ends: 701 [2024-11-08 11:09:53,833 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 11:09:53,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:53,836 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:53,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 11:09:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-08 11:09:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-08 11:09:53,862 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 111 [2024-11-08 11:09:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:53,863 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-08 11:09:53,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-08 11:09:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 11:09:53,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:53,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:53,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:09:53,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:53,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1206282540, now seen corresponding path program 1 times [2024-11-08 11:09:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750246578] [2024-11-08 11:09:53,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:54,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750246578] [2024-11-08 11:09:54,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750246578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:09:54,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958852251] [2024-11-08 11:09:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:54,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:09:54,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:54,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:09:54,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:09:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:54,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:09:54,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:09:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:54,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:09:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958852251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:54,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:09:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:09:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799034316] [2024-11-08 11:09:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:54,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:54,237 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:54,638 INFO L93 Difference]: Finished difference Result 979 states and 1465 transitions. [2024-11-08 11:09:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:54,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-08 11:09:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:54,641 INFO L225 Difference]: With dead ends: 979 [2024-11-08 11:09:54,641 INFO L226 Difference]: Without dead ends: 699 [2024-11-08 11:09:54,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:54,643 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:54,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-08 11:09:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 560. [2024-11-08 11:09:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3864042933810377) internal successors, (775), 559 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 775 transitions. [2024-11-08 11:09:54,653 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 775 transitions. Word has length 117 [2024-11-08 11:09:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:54,654 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 775 transitions. [2024-11-08 11:09:54,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 775 transitions. [2024-11-08 11:09:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 11:09:54,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:54,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:54,669 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-08 11:09:54,860 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-08 11:09:54,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:54,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:54,861 INFO L85 PathProgramCache]: Analyzing trace with hash -484371775, now seen corresponding path program 1 times [2024-11-08 11:09:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:54,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443215495] [2024-11-08 11:09:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:54,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:55,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:55,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443215495] [2024-11-08 11:09:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443215495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113257719] [2024-11-08 11:09:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:55,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:09:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:09:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:09:55,133 INFO L87 Difference]: Start difference. First operand 560 states and 775 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:55,559 INFO L93 Difference]: Finished difference Result 1118 states and 1548 transitions. [2024-11-08 11:09:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:09:55,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2024-11-08 11:09:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:55,561 INFO L225 Difference]: With dead ends: 1118 [2024-11-08 11:09:55,562 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:09:55,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:09:55,564 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 73 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:55,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 87 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:09:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-08 11:09:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3595706618962433) internal successors, (760), 559 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 760 transitions. [2024-11-08 11:09:55,577 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 760 transitions. Word has length 174 [2024-11-08 11:09:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:55,578 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 760 transitions. [2024-11-08 11:09:55,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 760 transitions. [2024-11-08 11:09:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 11:09:55,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:55,580 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:55,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:09:55,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:55,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1961519177, now seen corresponding path program 1 times [2024-11-08 11:09:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061832238] [2024-11-08 11:09:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 11:09:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061832238] [2024-11-08 11:09:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061832238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431518952] [2024-11-08 11:09:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:55,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:55,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:55,686 INFO L87 Difference]: Start difference. First operand 560 states and 760 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:56,021 INFO L93 Difference]: Finished difference Result 1118 states and 1558 transitions. [2024-11-08 11:09:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:56,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 177 [2024-11-08 11:09:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:56,024 INFO L225 Difference]: With dead ends: 1118 [2024-11-08 11:09:56,024 INFO L226 Difference]: Without dead ends: 699 [2024-11-08 11:09:56,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:56,025 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:56,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-08 11:09:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-08 11:09:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2449856733524356) internal successors, (869), 698 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 869 transitions. [2024-11-08 11:09:56,034 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 869 transitions. Word has length 177 [2024-11-08 11:09:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:56,034 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 869 transitions. [2024-11-08 11:09:56,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 869 transitions. [2024-11-08 11:09:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 11:09:56,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:56,036 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:56,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:09:56,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:56,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 458854272, now seen corresponding path program 1 times [2024-11-08 11:09:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:56,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288248835] [2024-11-08 11:09:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288248835] [2024-11-08 11:09:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288248835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628144508] [2024-11-08 11:09:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:56,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:56,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:56,168 INFO L87 Difference]: Start difference. First operand 699 states and 869 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:56,519 INFO L93 Difference]: Finished difference Result 1535 states and 1971 transitions. [2024-11-08 11:09:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-08 11:09:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:56,524 INFO L225 Difference]: With dead ends: 1535 [2024-11-08 11:09:56,524 INFO L226 Difference]: Without dead ends: 977 [2024-11-08 11:09:56,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:56,525 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:56,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-08 11:09:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2024-11-08 11:09:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2162485065710873) internal successors, (1018), 837 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1018 transitions. [2024-11-08 11:09:56,536 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1018 transitions. Word has length 194 [2024-11-08 11:09:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:56,537 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1018 transitions. [2024-11-08 11:09:56,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1018 transitions. [2024-11-08 11:09:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 11:09:56,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:56,539 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:56,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:09:56,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:56,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2011014399, now seen corresponding path program 1 times [2024-11-08 11:09:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:56,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054486224] [2024-11-08 11:09:56,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054486224] [2024-11-08 11:09:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054486224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:56,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:09:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866961079] [2024-11-08 11:09:56,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:56,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:09:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:09:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:56,845 INFO L87 Difference]: Start difference. First operand 838 states and 1018 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:57,259 INFO L93 Difference]: Finished difference Result 1590 states and 1945 transitions. [2024-11-08 11:09:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 11:09:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-11-08 11:09:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:57,262 INFO L225 Difference]: With dead ends: 1590 [2024-11-08 11:09:57,262 INFO L226 Difference]: Without dead ends: 838 [2024-11-08 11:09:57,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:57,263 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:57,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 28 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-08 11:09:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-08 11:09:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2102747909199523) internal successors, (1013), 837 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1013 transitions. [2024-11-08 11:09:57,273 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1013 transitions. Word has length 254 [2024-11-08 11:09:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:57,274 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1013 transitions. [2024-11-08 11:09:57,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1013 transitions. [2024-11-08 11:09:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-08 11:09:57,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:57,276 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:57,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:09:57,277 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:57,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -301674855, now seen corresponding path program 1 times [2024-11-08 11:09:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298917570] [2024-11-08 11:09:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 11:09:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298917570] [2024-11-08 11:09:57,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298917570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:57,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:57,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800089228] [2024-11-08 11:09:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:57,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:57,449 INFO L87 Difference]: Start difference. First operand 838 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:57,795 INFO L93 Difference]: Finished difference Result 1813 states and 2258 transitions. [2024-11-08 11:09:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 290 [2024-11-08 11:09:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:57,798 INFO L225 Difference]: With dead ends: 1813 [2024-11-08 11:09:57,798 INFO L226 Difference]: Without dead ends: 1116 [2024-11-08 11:09:57,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:57,800 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 100 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:57,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-08 11:09:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2024-11-08 11:09:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1956967213114753) internal successors, (1167), 976 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1167 transitions. [2024-11-08 11:09:57,812 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1167 transitions. Word has length 290 [2024-11-08 11:09:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:57,812 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1167 transitions. [2024-11-08 11:09:57,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1167 transitions. [2024-11-08 11:09:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-08 11:09:57,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:57,815 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:09:57,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:09:57,816 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:57,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:57,816 INFO L85 PathProgramCache]: Analyzing trace with hash 303542513, now seen corresponding path program 1 times [2024-11-08 11:09:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:57,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089187477] [2024-11-08 11:09:57,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:57,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-08 11:09:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089187477] [2024-11-08 11:09:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089187477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:57,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972479819] [2024-11-08 11:09:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:57,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:57,966 INFO L87 Difference]: Start difference. First operand 977 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:58,315 INFO L93 Difference]: Finished difference Result 2089 states and 2500 transitions. [2024-11-08 11:09:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:58,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 341 [2024-11-08 11:09:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:58,317 INFO L225 Difference]: With dead ends: 2089 [2024-11-08 11:09:58,317 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:09:58,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:58,319 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:58,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 222 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:09:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:09:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:09:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:09:58,321 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 341 [2024-11-08 11:09:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:58,322 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:09:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:09:58,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:09:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:09:58,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:09:58,327 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:58,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:09:58,418 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:09:58,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:09:58 BoogieIcfgContainer [2024-11-08 11:09:58,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:09:58,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:09:58,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:09:58,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:09:58,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:52" (3/4) ... [2024-11-08 11:09:58,442 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:09:58,454 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:09:58,455 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:09:58,455 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:09:58,456 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:09:58,563 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:09:58,563 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:09:58,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:09:58,564 INFO L158 Benchmark]: Toolchain (without parser) took 8037.93ms. Allocated memory was 182.5MB in the beginning and 295.7MB in the end (delta: 113.2MB). Free memory was 108.6MB in the beginning and 122.3MB in the end (delta: -13.6MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2024-11-08 11:09:58,564 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory was 89.5MB in the beginning and 89.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:09:58,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.67ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 78.6MB in the end (delta: 29.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 11:09:58,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.16ms. Allocated memory is still 182.5MB. Free memory was 78.6MB in the beginning and 70.5MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 11:09:58,565 INFO L158 Benchmark]: Boogie Preprocessor took 83.68ms. Allocated memory is still 182.5MB. Free memory was 147.8MB in the beginning and 137.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 11:09:58,565 INFO L158 Benchmark]: RCFGBuilder took 912.74ms. Allocated memory is still 182.5MB. Free memory was 137.6MB in the beginning and 127.3MB in the end (delta: 10.3MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2024-11-08 11:09:58,565 INFO L158 Benchmark]: TraceAbstraction took 6371.15ms. Allocated memory was 182.5MB in the beginning and 295.7MB in the end (delta: 113.2MB). Free memory was 126.3MB in the beginning and 133.8MB in the end (delta: -7.5MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. [2024-11-08 11:09:58,565 INFO L158 Benchmark]: Witness Printer took 125.43ms. Allocated memory is still 295.7MB. Free memory was 133.8MB in the beginning and 122.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 11:09:58,566 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.15ms. Allocated memory is still 127.9MB. Free memory was 89.5MB in the beginning and 89.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.67ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 78.6MB in the end (delta: 29.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.16ms. Allocated memory is still 182.5MB. Free memory was 78.6MB in the beginning and 70.5MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.68ms. Allocated memory is still 182.5MB. Free memory was 147.8MB in the beginning and 137.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 912.74ms. Allocated memory is still 182.5MB. Free memory was 137.6MB in the beginning and 127.3MB in the end (delta: 10.3MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6371.15ms. Allocated memory was 182.5MB in the beginning and 295.7MB in the end (delta: 113.2MB). Free memory was 126.3MB in the beginning and 133.8MB in the end (delta: -7.5MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. * Witness Printer took 125.43ms. Allocated memory is still 295.7MB. Free memory was 133.8MB in the beginning and 122.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 140]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 909 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 909 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3890 IncrementalHoareTripleChecker+Invalid, 4376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 946 mSDtfsCounter, 3890 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=977occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 417 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1817 NumberOfCodeBlocks, 1817 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1807 ConstructedInterpolants, 0 QuantifiedInterpolants, 6272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1156/1160 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: 592]: Loop Invariant Derived loop invariant: ((((((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) || (((a19 <= 6) && (14 == a4)) && (a12 == 0))) || (((a10 <= 1) && (14 == a4)) && (a12 == 0))) || (((a19 == 9) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:09:58,590 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