./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label34.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 550f3a62df7d5eada5d2aa8dd32299382207e40f85198cb35440276faa9cf7d3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:58:16,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:58:17,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:58:17,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:58:17,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:58:17,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:58:17,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:58:17,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:58:17,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:58:17,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:58:17,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:58:17,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:58:17,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:58:17,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:58:17,086 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:58:17,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:58:17,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:58:17,087 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:58:17,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:58:17,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:58:17,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:58:17,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:58:17,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:58:17,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:58:17,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:58:17,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:58:17,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:58:17,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:58:17,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:58:17,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:58:17,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:58:17,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:58:17,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:58:17,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:58:17,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:58:17,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:58:17,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:58:17,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:58:17,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:58:17,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:58:17,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:58:17,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:58:17,099 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 -> 550f3a62df7d5eada5d2aa8dd32299382207e40f85198cb35440276faa9cf7d3 [2024-10-12 15:58:17,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:58:17,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:58:17,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:58:17,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:58:17,396 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:58:17,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label34.c [2024-10-12 15:58:18,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:58:19,081 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:58:19,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label34.c [2024-10-12 15:58:19,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae348594/f07a6213476b493cb6b00054efc256a4/FLAG43d6f62e4 [2024-10-12 15:58:19,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae348594/f07a6213476b493cb6b00054efc256a4 [2024-10-12 15:58:19,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:58:19,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:58:19,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:58:19,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:58:19,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:58:19,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1110e28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19, skipping insertion in model container [2024-10-12 15:58:19,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:58:19,438 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label34.c[7166,7179] [2024-10-12 15:58:19,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:58:19,583 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:58:19,631 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label34.c[7166,7179] [2024-10-12 15:58:19,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:58:19,723 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:58:19,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19 WrapperNode [2024-10-12 15:58:19,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:58:19,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:58:19,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:58:19,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:58:19,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,808 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-12 15:58:19,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:58:19,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:58:19,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:58:19,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:58:19,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,857 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:58:19,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:58:19,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:58:19,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:58:19,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:58:19,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (1/1) ... [2024-10-12 15:58:19,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:58:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:19,968 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-10-12 15:58:19,971 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-10-12 15:58:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:58:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:58:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:58:20,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:58:20,097 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:58:20,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:58:21,156 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 15:58:21,157 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:58:21,211 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:58:21,211 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:58:21,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:21 BoogieIcfgContainer [2024-10-12 15:58:21,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:58:21,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:58:21,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:58:21,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:58:21,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:58:19" (1/3) ... [2024-10-12 15:58:21,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586b59c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:58:21, skipping insertion in model container [2024-10-12 15:58:21,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:19" (2/3) ... [2024-10-12 15:58:21,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586b59c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:58:21, skipping insertion in model container [2024-10-12 15:58:21,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:21" (3/3) ... [2024-10-12 15:58:21,222 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label34.c [2024-10-12 15:58:21,238 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:58:21,239 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:58:21,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:58:21,303 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;@30509178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:58:21,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:58:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 15:58:21,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:21,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:21,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:21,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1104932647, now seen corresponding path program 1 times [2024-10-12 15:58:21,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:21,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166274873] [2024-10-12 15:58:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:21,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:21,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166274873] [2024-10-12 15:58:21,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166274873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:21,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965289868] [2024-10-12 15:58:21,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:21,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:58:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:58:21,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:58:21,601 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:21,646 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-12 15:58:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:58:21,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 15:58:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:21,659 INFO L225 Difference]: With dead ends: 287 [2024-10-12 15:58:21,659 INFO L226 Difference]: Without dead ends: 142 [2024-10-12 15:58:21,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:58:21,665 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:21,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:58:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-12 15:58:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-12 15:58:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-12 15:58:21,708 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 62 [2024-10-12 15:58:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:21,709 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-12 15:58:21,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-12 15:58:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 15:58:21,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:21,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:21,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:58:21,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:21,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash 892309638, now seen corresponding path program 1 times [2024-10-12 15:58:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:21,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576863444] [2024-10-12 15:58:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:21,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576863444] [2024-10-12 15:58:21,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576863444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:21,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:21,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:21,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888135679] [2024-10-12 15:58:21,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:21,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:21,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:21,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:21,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:21,947 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:22,540 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-12 15:58:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:22,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-12 15:58:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:22,543 INFO L225 Difference]: With dead ends: 422 [2024-10-12 15:58:22,543 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 15:58:22,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:22,545 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 84 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:22,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:58:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 15:58:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-12 15:58:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 280 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2024-10-12 15:58:22,583 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 62 [2024-10-12 15:58:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:22,584 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2024-10-12 15:58:22,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2024-10-12 15:58:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 15:58:22,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:22,589 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:22,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:58:22,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:22,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1653488615, now seen corresponding path program 1 times [2024-10-12 15:58:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101728192] [2024-10-12 15:58:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:22,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:22,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101728192] [2024-10-12 15:58:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101728192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:22,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:22,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:22,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480449723] [2024-10-12 15:58:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:22,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:22,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:22,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:22,908 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:23,371 INFO L93 Difference]: Finished difference Result 700 states and 966 transitions. [2024-10-12 15:58:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:23,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-10-12 15:58:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:23,375 INFO L225 Difference]: With dead ends: 700 [2024-10-12 15:58:23,375 INFO L226 Difference]: Without dead ends: 420 [2024-10-12 15:58:23,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:23,377 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 83 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:23,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 212 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-12 15:58:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-12 15:58:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.2529832935560858) internal successors, (525), 419 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 525 transitions. [2024-10-12 15:58:23,410 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 525 transitions. Word has length 128 [2024-10-12 15:58:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:23,410 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 525 transitions. [2024-10-12 15:58:23,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 525 transitions. [2024-10-12 15:58:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 15:58:23,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:23,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:23,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:58:23,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:23,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash 206450238, now seen corresponding path program 1 times [2024-10-12 15:58:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:23,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180803679] [2024-10-12 15:58:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:23,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180803679] [2024-10-12 15:58:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180803679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:23,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:23,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:23,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287837656] [2024-10-12 15:58:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:23,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:23,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:23,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:23,725 INFO L87 Difference]: Start difference. First operand 420 states and 525 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:24,132 INFO L93 Difference]: Finished difference Result 978 states and 1208 transitions. [2024-10-12 15:58:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:24,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-10-12 15:58:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:24,135 INFO L225 Difference]: With dead ends: 978 [2024-10-12 15:58:24,136 INFO L226 Difference]: Without dead ends: 559 [2024-10-12 15:58:24,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:24,138 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:24,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 75 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-12 15:58:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-12 15:58:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2078853046594982) internal successors, (674), 558 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 674 transitions. [2024-10-12 15:58:24,154 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 674 transitions. Word has length 135 [2024-10-12 15:58:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:24,155 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 674 transitions. [2024-10-12 15:58:24,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 674 transitions. [2024-10-12 15:58:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 15:58:24,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:24,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:24,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:58:24,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:24,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1580171619, now seen corresponding path program 1 times [2024-10-12 15:58:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008105701] [2024-10-12 15:58:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:24,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008105701] [2024-10-12 15:58:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008105701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:24,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:24,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:58:24,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443711833] [2024-10-12 15:58:24,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:24,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:58:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:24,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:58:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:24,539 INFO L87 Difference]: Start difference. First operand 559 states and 674 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:24,969 INFO L93 Difference]: Finished difference Result 1033 states and 1253 transitions. [2024-10-12 15:58:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:58:24,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 15:58:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:24,973 INFO L225 Difference]: With dead ends: 1033 [2024-10-12 15:58:24,973 INFO L226 Difference]: Without dead ends: 559 [2024-10-12 15:58:24,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:24,977 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:24,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 17 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-12 15:58:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-12 15:58:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2025089605734767) internal successors, (671), 558 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 671 transitions. [2024-10-12 15:58:24,995 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 671 transitions. Word has length 137 [2024-10-12 15:58:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:24,995 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 671 transitions. [2024-10-12 15:58:24,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 671 transitions. [2024-10-12 15:58:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 15:58:24,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:24,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:24,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:58:24,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:24,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1740240245, now seen corresponding path program 1 times [2024-10-12 15:58:25,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:25,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658262327] [2024-10-12 15:58:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:25,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658262327] [2024-10-12 15:58:25,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658262327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:25,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:25,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:25,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973448654] [2024-10-12 15:58:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:25,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:25,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:25,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:25,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:25,123 INFO L87 Difference]: Start difference. First operand 559 states and 671 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:25,593 INFO L93 Difference]: Finished difference Result 1256 states and 1565 transitions. [2024-10-12 15:58:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-10-12 15:58:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:25,597 INFO L225 Difference]: With dead ends: 1256 [2024-10-12 15:58:25,597 INFO L226 Difference]: Without dead ends: 837 [2024-10-12 15:58:25,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:25,599 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:25,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 32 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-12 15:58:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-12 15:58:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.1997607655502391) internal successors, (1003), 836 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1003 transitions. [2024-10-12 15:58:25,623 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1003 transitions. Word has length 153 [2024-10-12 15:58:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:25,624 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1003 transitions. [2024-10-12 15:58:25,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1003 transitions. [2024-10-12 15:58:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-12 15:58:25,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:25,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:25,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:58:25,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:25,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash 493489661, now seen corresponding path program 1 times [2024-10-12 15:58:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100866236] [2024-10-12 15:58:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:25,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100866236] [2024-10-12 15:58:25,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100866236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:25,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:25,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:25,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327260724] [2024-10-12 15:58:25,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:25,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:25,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:25,812 INFO L87 Difference]: Start difference. First operand 837 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:26,288 INFO L93 Difference]: Finished difference Result 1673 states and 2051 transitions. [2024-10-12 15:58:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2024-10-12 15:58:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:26,292 INFO L225 Difference]: With dead ends: 1673 [2024-10-12 15:58:26,292 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 15:58:26,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:26,294 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 92 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:26,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 187 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 15:58:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-12 15:58:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.1456410256410257) internal successors, (1117), 975 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1117 transitions. [2024-10-12 15:58:26,311 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1117 transitions. Word has length 173 [2024-10-12 15:58:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:26,312 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1117 transitions. [2024-10-12 15:58:26,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1117 transitions. [2024-10-12 15:58:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-12 15:58:26,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:26,315 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:58:26,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:26,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash 159129255, now seen corresponding path program 1 times [2024-10-12 15:58:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:26,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634516508] [2024-10-12 15:58:26,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:26,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-10-12 15:58:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:26,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634516508] [2024-10-12 15:58:26,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634516508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:26,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732729499] [2024-10-12 15:58:26,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:26,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:26,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:26,731 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-10-12 15:58:26,733 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-10-12 15:58:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:26,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:26,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-10-12 15:58:27,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:27,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732729499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:27,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:27,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:58:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732287902] [2024-10-12 15:58:27,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:27,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:27,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:27,227 INFO L87 Difference]: Start difference. First operand 976 states and 1117 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:27,681 INFO L93 Difference]: Finished difference Result 1534 states and 1758 transitions. [2024-10-12 15:58:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:27,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 246 [2024-10-12 15:58:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:27,687 INFO L225 Difference]: With dead ends: 1534 [2024-10-12 15:58:27,687 INFO L226 Difference]: Without dead ends: 1532 [2024-10-12 15:58:27,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:27,688 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:27,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 9 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-12 15:58:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1115. [2024-10-12 15:58:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.1714542190305206) internal successors, (1305), 1114 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1305 transitions. [2024-10-12 15:58:27,710 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1305 transitions. Word has length 246 [2024-10-12 15:58:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:27,711 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1305 transitions. [2024-10-12 15:58:27,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1305 transitions. [2024-10-12 15:58:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-12 15:58:27,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:27,716 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:27,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:58:27,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:27,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:27,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2106262713, now seen corresponding path program 1 times [2024-10-12 15:58:27,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188108331] [2024-10-12 15:58:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:27,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 79 proven. 42 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 15:58:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188108331] [2024-10-12 15:58:28,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188108331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888980700] [2024-10-12 15:58:28,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:28,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:28,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:28,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:58:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:28,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:28,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 15:58:28,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:28,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888980700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:28,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:28,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 15:58:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799056274] [2024-10-12 15:58:28,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:28,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:28,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:28,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:28,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:58:28,889 INFO L87 Difference]: Start difference. First operand 1115 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:29,324 INFO L93 Difference]: Finished difference Result 2368 states and 2843 transitions. [2024-10-12 15:58:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:29,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 310 [2024-10-12 15:58:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:29,329 INFO L225 Difference]: With dead ends: 2368 [2024-10-12 15:58:29,329 INFO L226 Difference]: Without dead ends: 1393 [2024-10-12 15:58:29,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:58:29,331 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 79 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:29,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 222 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-12 15:58:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2024-10-12 15:58:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1644054269752593) internal successors, (1459), 1253 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1459 transitions. [2024-10-12 15:58:29,355 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1459 transitions. Word has length 310 [2024-10-12 15:58:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:29,355 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1459 transitions. [2024-10-12 15:58:29,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1459 transitions. [2024-10-12 15:58:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-10-12 15:58:29,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:29,361 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:29,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:58:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-12 15:58:29,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:29,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:29,563 INFO L85 PathProgramCache]: Analyzing trace with hash 17569926, now seen corresponding path program 1 times [2024-10-12 15:58:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173445070] [2024-10-12 15:58:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 86 proven. 96 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-12 15:58:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173445070] [2024-10-12 15:58:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173445070] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482587103] [2024-10-12 15:58:30,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:30,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:30,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:30,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:58:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:30,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:30,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-12 15:58:30,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482587103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:30,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:30,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:58:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569677673] [2024-10-12 15:58:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:30,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:30,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:30,321 INFO L87 Difference]: Start difference. First operand 1254 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:30,764 INFO L93 Difference]: Finished difference Result 2644 states and 3075 transitions. [2024-10-12 15:58:30,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:30,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 361 [2024-10-12 15:58:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:30,766 INFO L225 Difference]: With dead ends: 2644 [2024-10-12 15:58:30,766 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:58:30,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:30,769 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 79 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:30,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 219 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:58:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:58:30,770 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-10-12 15:58:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:58:30,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 361 [2024-10-12 15:58:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:30,771 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:58:30,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:58:30,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:58:30,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:58:30,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:58:30,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:30,981 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:30,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:58:31,111 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:58:31,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:58:31 BoogieIcfgContainer [2024-10-12 15:58:31,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:58:31,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:58:31,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:58:31,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:58:31,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:21" (3/4) ... [2024-10-12 15:58:31,135 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:58:31,156 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:58:31,158 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:58:31,158 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:58:31,159 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:58:31,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:58:31,309 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:58:31,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:58:31,310 INFO L158 Benchmark]: Toolchain (without parser) took 12190.45ms. Allocated memory was 172.0MB in the beginning and 325.1MB in the end (delta: 153.1MB). Free memory was 116.2MB in the beginning and 158.6MB in the end (delta: -42.4MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-10-12 15:58:31,310 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:58:31,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.81ms. Allocated memory is still 172.0MB. Free memory was 116.2MB in the beginning and 132.4MB in the end (delta: -16.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 15:58:31,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.93ms. Allocated memory is still 172.0MB. Free memory was 132.4MB in the beginning and 124.1MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:58:31,311 INFO L158 Benchmark]: Boogie Preprocessor took 124.25ms. Allocated memory is still 172.0MB. Free memory was 124.1MB in the beginning and 114.4MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 15:58:31,311 INFO L158 Benchmark]: RCFGBuilder took 1276.84ms. Allocated memory is still 172.0MB. Free memory was 113.6MB in the beginning and 78.4MB in the end (delta: 35.2MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-10-12 15:58:31,311 INFO L158 Benchmark]: TraceAbstraction took 9917.98ms. Allocated memory was 172.0MB in the beginning and 325.1MB in the end (delta: 153.1MB). Free memory was 78.4MB in the beginning and 171.2MB in the end (delta: -92.8MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-10-12 15:58:31,312 INFO L158 Benchmark]: Witness Printer took 176.34ms. Allocated memory is still 325.1MB. Free memory was 171.2MB in the beginning and 158.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:58:31,314 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 117.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 601.81ms. Allocated memory is still 172.0MB. Free memory was 116.2MB in the beginning and 132.4MB in the end (delta: -16.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.93ms. Allocated memory is still 172.0MB. Free memory was 132.4MB in the beginning and 124.1MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.25ms. Allocated memory is still 172.0MB. Free memory was 124.1MB in the beginning and 114.4MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1276.84ms. Allocated memory is still 172.0MB. Free memory was 113.6MB in the beginning and 78.4MB in the end (delta: 35.2MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9917.98ms. Allocated memory was 172.0MB in the beginning and 325.1MB in the end (delta: 153.1MB). Free memory was 78.4MB in the beginning and 171.2MB in the end (delta: -92.8MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 176.34ms. Allocated memory is still 325.1MB. Free memory was 171.2MB in the beginning and 158.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 203]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 1255 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 468 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3348 IncrementalHoareTripleChecker+Invalid, 3816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 468 mSolverCounterUnsat, 1215 mSDtfsCounter, 3348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 948 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1254occurred in iteration=9, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 556 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2684 NumberOfCodeBlocks, 2684 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2671 ConstructedInterpolants, 0 QuantifiedInterpolants, 10707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1242 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1834/2022 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 <= 6) && (14 == a4)) && (a12 == 0)) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || (((a19 == 9) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:58:31,346 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