./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/Problem14_label49.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/Problem14_label49.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 ed3a92c264decf07ef3fe9934b7adac3cfdd66377f9f8a3c9a530596f6e34d7c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:16:00,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:16:00,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:16:00,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:16:00,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:16:01,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:16:01,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:16:01,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:16:01,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:16:01,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:16:01,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:16:01,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:16:01,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:16:01,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:16:01,029 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:16:01,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:16:01,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:16:01,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:16:01,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:16:01,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:16:01,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:16:01,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:16:01,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:16:01,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:16:01,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:16:01,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:16:01,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:16:01,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:16:01,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:16:01,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:16:01,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:16:01,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:16:01,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:16:01,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:16:01,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:16:01,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:16:01,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:16:01,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:16:01,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:16:01,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:16:01,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:16:01,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:16:01,041 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 -> ed3a92c264decf07ef3fe9934b7adac3cfdd66377f9f8a3c9a530596f6e34d7c [2024-10-12 16:16:01,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:16:01,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:16:01,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:16:01,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:16:01,372 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:16:01,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c [2024-10-12 16:16:02,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:16:03,123 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:16:03,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c [2024-10-12 16:16:03,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a654df54b/85b14d9dac3441e7870ee01b349ad2ab/FLAGc4563878e [2024-10-12 16:16:03,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a654df54b/85b14d9dac3441e7870ee01b349ad2ab [2024-10-12 16:16:03,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:16:03,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:16:03,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:16:03,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:16:03,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:16:03,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:03,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe30049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03, skipping insertion in model container [2024-10-12 16:16:03,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:03,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:16:03,459 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/Problem14_label49.c[6042,6055] [2024-10-12 16:16:03,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:16:03,653 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:16:03,680 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/Problem14_label49.c[6042,6055] [2024-10-12 16:16:03,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:16:03,799 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:16:03,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03 WrapperNode [2024-10-12 16:16:03,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:16:03,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:16:03,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:16:03,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:16:03,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:03,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:03,912 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-12 16:16:03,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:16:03,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:16:03,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:16:03,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:16:03,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:03,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:03,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:03,982 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 16:16:03,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:03,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:04,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:04,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:04,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:04,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:04,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:16:04,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:16:04,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:16:04,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:16:04,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (1/1) ... [2024-10-12 16:16:04,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:16:04,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:16:04,115 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 16:16:04,118 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 16:16:04,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:16:04,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:16:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:16:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:16:04,326 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:16:04,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:16:05,727 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-12 16:16:05,728 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:16:05,786 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:16:05,787 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:16:05,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:16:05 BoogieIcfgContainer [2024-10-12 16:16:05,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:16:05,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:16:05,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:16:05,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:16:05,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:16:03" (1/3) ... [2024-10-12 16:16:05,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346764c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:16:05, skipping insertion in model container [2024-10-12 16:16:05,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:03" (2/3) ... [2024-10-12 16:16:05,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346764c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:16:05, skipping insertion in model container [2024-10-12 16:16:05,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:16:05" (3/3) ... [2024-10-12 16:16:05,800 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label49.c [2024-10-12 16:16:05,818 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:16:05,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:16:05,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:16:05,900 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;@52e3149d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:16:05,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:16:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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 16:16:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 16:16:05,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:05,914 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] [2024-10-12 16:16:05,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:05,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash 716765783, now seen corresponding path program 1 times [2024-10-12 16:16:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:05,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159081360] [2024-10-12 16:16:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:06,126 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 16:16:06,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:06,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159081360] [2024-10-12 16:16:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159081360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:06,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:06,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:16:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504116935] [2024-10-12 16:16:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:06,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:16:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:06,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:16:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:16:06,178 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 16:16:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:06,215 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-12 16:16:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:16:06,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-12 16:16:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:06,227 INFO L225 Difference]: With dead ends: 365 [2024-10-12 16:16:06,228 INFO L226 Difference]: Without dead ends: 181 [2024-10-12 16:16:06,232 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 16:16:06,236 INFO L432 NwaCegarLoop]: 295 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, 295 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 16:16:06,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:16:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-12 16:16:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-12 16:16:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 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 16:16:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-12 16:16:06,279 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 58 [2024-10-12 16:16:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:06,280 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-12 16:16:06,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 16:16:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-12 16:16:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 16:16:06,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:06,282 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] [2024-10-12 16:16:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:16:06,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash 499004973, now seen corresponding path program 1 times [2024-10-12 16:16:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:06,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604781979] [2024-10-12 16:16:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:06,567 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 16:16:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604781979] [2024-10-12 16:16:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604781979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:16:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100566318] [2024-10-12 16:16:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:06,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:06,572 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 16:16:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:07,498 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-12 16:16:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-12 16:16:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:07,501 INFO L225 Difference]: With dead ends: 539 [2024-10-12 16:16:07,501 INFO L226 Difference]: Without dead ends: 359 [2024-10-12 16:16:07,503 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 16:16:07,504 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:07,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 87 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:16:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-12 16:16:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-12 16:16:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 0 states have call successors, (0), 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 16:16:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2024-10-12 16:16:07,538 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 58 [2024-10-12 16:16:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:07,539 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2024-10-12 16:16:07,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 16:16:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2024-10-12 16:16:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 16:16:07,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:07,543 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, 1, 1, 1, 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 16:16:07,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:16:07,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:07,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -247476893, now seen corresponding path program 1 times [2024-10-12 16:16:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:07,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326740163] [2024-10-12 16:16:07,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:07,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326740163] [2024-10-12 16:16:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326740163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:08,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993309013] [2024-10-12 16:16:08,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:08,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:16:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:16:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:16:08,043 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 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 16:16:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:09,036 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2024-10-12 16:16:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:16:09,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 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 16:16:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:09,040 INFO L225 Difference]: With dead ends: 1073 [2024-10-12 16:16:09,040 INFO L226 Difference]: Without dead ends: 715 [2024-10-12 16:16:09,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:16:09,047 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:09,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:16:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-12 16:16:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-12 16:16:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2619047619047619) internal successors, (901), 714 states have internal predecessors, (901), 0 states have call successors, (0), 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 16:16:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 901 transitions. [2024-10-12 16:16:09,091 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 901 transitions. Word has length 137 [2024-10-12 16:16:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:09,091 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 901 transitions. [2024-10-12 16:16:09,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 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 16:16:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 901 transitions. [2024-10-12 16:16:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 16:16:09,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:09,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:09,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:16:09,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:09,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash 783452548, now seen corresponding path program 1 times [2024-10-12 16:16:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:09,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699830900] [2024-10-12 16:16:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:09,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699830900] [2024-10-12 16:16:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699830900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:09,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:09,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260604584] [2024-10-12 16:16:09,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:09,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:09,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:09,309 INFO L87 Difference]: Start difference. First operand 715 states and 901 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 16:16:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:09,941 INFO L93 Difference]: Finished difference Result 1073 states and 1409 transitions. [2024-10-12 16:16:09,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:09,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-10-12 16:16:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:09,957 INFO L225 Difference]: With dead ends: 1073 [2024-10-12 16:16:09,958 INFO L226 Difference]: Without dead ends: 1071 [2024-10-12 16:16:09,960 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 16:16:09,964 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:09,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 34 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:16:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-12 16:16:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 893. [2024-10-12 16:16:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 0 states have call successors, (0), 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 16:16:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2024-10-12 16:16:09,988 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 163 [2024-10-12 16:16:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:09,990 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2024-10-12 16:16:09,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 16:16:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2024-10-12 16:16:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-12 16:16:09,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:09,999 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, 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] [2024-10-12 16:16:09,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:16:09,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash -838282162, now seen corresponding path program 1 times [2024-10-12 16:16:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078306021] [2024-10-12 16:16:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 16:16:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:10,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078306021] [2024-10-12 16:16:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078306021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:10,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890653131] [2024-10-12 16:16:10,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:10,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:16:10,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:10,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:16:10,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:16:10,308 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:11,094 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2024-10-12 16:16:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:16:11,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-10-12 16:16:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:11,099 INFO L225 Difference]: With dead ends: 1992 [2024-10-12 16:16:11,100 INFO L226 Difference]: Without dead ends: 1071 [2024-10-12 16:16:11,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:16:11,103 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:11,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 116 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:16:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-12 16:16:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-12 16:16:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 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 16:16:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2024-10-12 16:16:11,131 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 229 [2024-10-12 16:16:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:11,132 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2024-10-12 16:16:11,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2024-10-12 16:16:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-12 16:16:11,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:11,136 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, 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] [2024-10-12 16:16:11,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:16:11,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:11,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1269389324, now seen corresponding path program 1 times [2024-10-12 16:16:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065025710] [2024-10-12 16:16:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:11,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:11,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065025710] [2024-10-12 16:16:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065025710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:16:11,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096021725] [2024-10-12 16:16:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:11,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:16:11,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:16:11,478 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 16:16:11,479 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 16:16:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:11,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:16:11,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:16:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 16:16:11,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:16:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096021725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:16:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-12 16:16:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88816874] [2024-10-12 16:16:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:11,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:16:11,921 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 16:16:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:12,491 INFO L93 Difference]: Finished difference Result 2497 states and 3032 transitions. [2024-10-12 16:16:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 229 [2024-10-12 16:16:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:12,502 INFO L225 Difference]: With dead ends: 2497 [2024-10-12 16:16:12,502 INFO L226 Difference]: Without dead ends: 1427 [2024-10-12 16:16:12,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:16:12,506 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:12,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 45 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:16:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-10-12 16:16:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1249. [2024-10-12 16:16:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.2043269230769231) internal successors, (1503), 1248 states have internal predecessors, (1503), 0 states have call successors, (0), 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 16:16:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1503 transitions. [2024-10-12 16:16:12,533 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1503 transitions. Word has length 229 [2024-10-12 16:16:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:12,534 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1503 transitions. [2024-10-12 16:16:12,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 16:16:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1503 transitions. [2024-10-12 16:16:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-12 16:16:12,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:12,537 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:12,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 16:16:12,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 16:16:12,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:12,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2059711629, now seen corresponding path program 1 times [2024-10-12 16:16:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080198295] [2024-10-12 16:16:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:13,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080198295] [2024-10-12 16:16:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080198295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:13,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:13,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873204127] [2024-10-12 16:16:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:13,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:13,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:13,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:13,022 INFO L87 Difference]: Start difference. First operand 1249 states and 1503 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 16:16:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:13,600 INFO L93 Difference]: Finished difference Result 3031 states and 3653 transitions. [2024-10-12 16:16:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-10-12 16:16:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:13,606 INFO L225 Difference]: With dead ends: 3031 [2024-10-12 16:16:13,607 INFO L226 Difference]: Without dead ends: 1783 [2024-10-12 16:16:13,609 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 16:16:13,610 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:13,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 75 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:16:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-10-12 16:16:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2024-10-12 16:16:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1655443322109988) internal successors, (2077), 1782 states have internal predecessors, (2077), 0 states have call successors, (0), 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 16:16:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2077 transitions. [2024-10-12 16:16:13,642 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2077 transitions. Word has length 232 [2024-10-12 16:16:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:13,642 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2077 transitions. [2024-10-12 16:16:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 16:16:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2077 transitions. [2024-10-12 16:16:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-12 16:16:13,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:13,647 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:13,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:16:13,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:13,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -240484349, now seen corresponding path program 1 times [2024-10-12 16:16:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803035410] [2024-10-12 16:16:13,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-12 16:16:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803035410] [2024-10-12 16:16:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803035410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102019221] [2024-10-12 16:16:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:13,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:16:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:16:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:16:13,966 INFO L87 Difference]: Start difference. First operand 1783 states and 2077 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 16:16:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:14,664 INFO L93 Difference]: Finished difference Result 3623 states and 4234 transitions. [2024-10-12 16:16:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:16:14,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 349 [2024-10-12 16:16:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:14,673 INFO L225 Difference]: With dead ends: 3623 [2024-10-12 16:16:14,673 INFO L226 Difference]: Without dead ends: 1961 [2024-10-12 16:16:14,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:16:14,678 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:14,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:16:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-12 16:16:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-12 16:16:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1144781144781144) internal successors, (1986), 1782 states have internal predecessors, (1986), 0 states have call successors, (0), 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 16:16:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1986 transitions. [2024-10-12 16:16:14,726 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1986 transitions. Word has length 349 [2024-10-12 16:16:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:14,727 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 1986 transitions. [2024-10-12 16:16:14,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 16:16:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1986 transitions. [2024-10-12 16:16:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-10-12 16:16:14,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:14,735 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:16:14,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:16:14,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:14,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash 508513089, now seen corresponding path program 1 times [2024-10-12 16:16:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86434661] [2024-10-12 16:16:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-12 16:16:15,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:15,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86434661] [2024-10-12 16:16:15,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86434661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:16:15,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113697118] [2024-10-12 16:16:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:15,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:16:15,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:16:15,216 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 16:16:15,217 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 16:16:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:15,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:16:15,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:16:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-12 16:16:15,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:16:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113697118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:15,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:16:15,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 16:16:15,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688435349] [2024-10-12 16:16:15,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:15,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:15,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:15,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:15,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:16:15,928 INFO L87 Difference]: Start difference. First operand 1783 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:16,424 INFO L93 Difference]: Finished difference Result 2853 states and 3125 transitions. [2024-10-12 16:16:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:16,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 438 [2024-10-12 16:16:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:16,434 INFO L225 Difference]: With dead ends: 2853 [2024-10-12 16:16:16,435 INFO L226 Difference]: Without dead ends: 2851 [2024-10-12 16:16:16,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 437 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 16:16:16,437 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:16,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:16:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-12 16:16:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 1605. [2024-10-12 16:16:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.0910224438902743) internal successors, (1750), 1604 states have internal predecessors, (1750), 0 states have call successors, (0), 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 16:16:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1750 transitions. [2024-10-12 16:16:16,474 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1750 transitions. Word has length 438 [2024-10-12 16:16:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:16,474 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1750 transitions. [2024-10-12 16:16:16,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1750 transitions. [2024-10-12 16:16:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-10-12 16:16:16,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:16,481 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2024-10-12 16:16:16,499 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 16:16:16,685 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 16:16:16,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:16,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash 718989491, now seen corresponding path program 1 times [2024-10-12 16:16:16,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:16,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37057631] [2024-10-12 16:16:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-12 16:16:17,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:17,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37057631] [2024-10-12 16:16:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37057631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:17,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:17,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689574229] [2024-10-12 16:16:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:17,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:17,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:17,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:17,097 INFO L87 Difference]: Start difference. First operand 1605 states and 1750 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 16:16:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:17,639 INFO L93 Difference]: Finished difference Result 3921 states and 4308 transitions. [2024-10-12 16:16:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:17,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 444 [2024-10-12 16:16:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:17,648 INFO L225 Difference]: With dead ends: 3921 [2024-10-12 16:16:17,649 INFO L226 Difference]: Without dead ends: 2495 [2024-10-12 16:16:17,651 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 16:16:17,652 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:17,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:16:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2024-10-12 16:16:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1961. [2024-10-12 16:16:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.0760204081632654) internal successors, (2109), 1960 states have internal predecessors, (2109), 0 states have call successors, (0), 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 16:16:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2109 transitions. [2024-10-12 16:16:17,691 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2109 transitions. Word has length 444 [2024-10-12 16:16:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:17,692 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2109 transitions. [2024-10-12 16:16:17,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 16:16:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2109 transitions. [2024-10-12 16:16:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-10-12 16:16:17,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:17,696 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:17,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:16:17,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:17,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 952992866, now seen corresponding path program 1 times [2024-10-12 16:16:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784210345] [2024-10-12 16:16:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-12 16:16:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:18,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784210345] [2024-10-12 16:16:18,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784210345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:18,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:18,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:18,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956713475] [2024-10-12 16:16:18,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:18,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:18,152 INFO L87 Difference]: Start difference. First operand 1961 states and 2109 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 16:16:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:18,715 INFO L93 Difference]: Finished difference Result 4455 states and 4860 transitions. [2024-10-12 16:16:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:18,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 451 [2024-10-12 16:16:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:18,724 INFO L225 Difference]: With dead ends: 4455 [2024-10-12 16:16:18,724 INFO L226 Difference]: Without dead ends: 2673 [2024-10-12 16:16:18,727 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 16:16:18,728 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:18,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 199 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:16:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-12 16:16:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2024-10-12 16:16:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.0819610778443114) internal successors, (2891), 2672 states have internal predecessors, (2891), 0 states have call successors, (0), 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 16:16:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2891 transitions. [2024-10-12 16:16:18,779 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2891 transitions. Word has length 451 [2024-10-12 16:16:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:18,780 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2891 transitions. [2024-10-12 16:16:18,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 16:16:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2891 transitions. [2024-10-12 16:16:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-10-12 16:16:18,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:18,785 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:18,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:16:18,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:18,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1051863469, now seen corresponding path program 1 times [2024-10-12 16:16:18,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:18,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603531851] [2024-10-12 16:16:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-12 16:16:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603531851] [2024-10-12 16:16:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603531851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:19,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:19,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139090921] [2024-10-12 16:16:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:19,058 INFO L87 Difference]: Start difference. First operand 2673 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 16:16:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:19,602 INFO L93 Difference]: Finished difference Result 6413 states and 7026 transitions. [2024-10-12 16:16:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:19,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 492 [2024-10-12 16:16:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:19,618 INFO L225 Difference]: With dead ends: 6413 [2024-10-12 16:16:19,618 INFO L226 Difference]: Without dead ends: 3919 [2024-10-12 16:16:19,622 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 16:16:19,623 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:19,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 50 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:16:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-12 16:16:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3563. [2024-10-12 16:16:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0777653003930376) internal successors, (3839), 3562 states have internal predecessors, (3839), 0 states have call successors, (0), 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 16:16:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3839 transitions. [2024-10-12 16:16:19,688 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3839 transitions. Word has length 492 [2024-10-12 16:16:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:19,689 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3839 transitions. [2024-10-12 16:16:19,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 16:16:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3839 transitions. [2024-10-12 16:16:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2024-10-12 16:16:19,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:19,696 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:19,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:16:19,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:19,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1378920713, now seen corresponding path program 1 times [2024-10-12 16:16:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:19,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421735735] [2024-10-12 16:16:19,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:19,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 1154 proven. 104 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-10-12 16:16:20,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421735735] [2024-10-12 16:16:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421735735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:16:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97799931] [2024-10-12 16:16:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:20,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:16:20,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:16:20,479 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 16:16:20,481 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 16:16:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:20,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:16:20,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:16:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2024-10-12 16:16:20,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:16:20,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97799931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:20,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:16:20,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:16:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238592758] [2024-10-12 16:16:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:20,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:16:20,790 INFO L87 Difference]: Start difference. First operand 3563 states and 3839 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 16:16:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:21,288 INFO L93 Difference]: Finished difference Result 7837 states and 8457 transitions. [2024-10-12 16:16:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:21,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 637 [2024-10-12 16:16:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:21,302 INFO L225 Difference]: With dead ends: 7837 [2024-10-12 16:16:21,302 INFO L226 Difference]: Without dead ends: 3563 [2024-10-12 16:16:21,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:16:21,309 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:21,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 244 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 16:16:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2024-10-12 16:16:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3029. [2024-10-12 16:16:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.0686922060766182) internal successors, (3236), 3028 states have internal predecessors, (3236), 0 states have call successors, (0), 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 16:16:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3236 transitions. [2024-10-12 16:16:21,377 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3236 transitions. Word has length 637 [2024-10-12 16:16:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:21,379 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 3236 transitions. [2024-10-12 16:16:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 16:16:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3236 transitions. [2024-10-12 16:16:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-10-12 16:16:21,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:21,390 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:21,408 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 16:16:21,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:16:21,591 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:21,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -884112776, now seen corresponding path program 1 times [2024-10-12 16:16:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554048501] [2024-10-12 16:16:21,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 1313 proven. 104 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-10-12 16:16:22,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554048501] [2024-10-12 16:16:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554048501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:16:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101141263] [2024-10-12 16:16:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:22,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:16:22,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:16:22,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:16:22,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 16:16:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:22,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:16:22,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:16:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2024-10-12 16:16:22,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:16:22,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101141263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:22,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:16:22,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:16:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837885002] [2024-10-12 16:16:22,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:22,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:22,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:22,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:22,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:16:22,734 INFO L87 Difference]: Start difference. First operand 3029 states and 3236 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 16:16:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:23,207 INFO L93 Difference]: Finished difference Result 6767 states and 7303 transitions. [2024-10-12 16:16:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:23,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 707 [2024-10-12 16:16:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:23,209 INFO L225 Difference]: With dead ends: 6767 [2024-10-12 16:16:23,209 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:16:23,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:16:23,215 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 128 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:23,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 216 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 16:16:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:16:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:16:23,216 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 16:16:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:16:23,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 707 [2024-10-12 16:16:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:23,217 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:16:23,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 16:16:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:16:23,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:16:23,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:16:23,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 16:16:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:16:23,425 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:23,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:16:23,876 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:16:23,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:16:23 BoogieIcfgContainer [2024-10-12 16:16:23,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:16:23,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:16:23,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:16:23,895 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:16:23,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:16:05" (3/4) ... [2024-10-12 16:16:23,899 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:16:23,920 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 16:16:23,922 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:16:23,923 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:16:23,924 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:16:24,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:16:24,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:16:24,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:16:24,078 INFO L158 Benchmark]: Toolchain (without parser) took 20900.06ms. Allocated memory was 153.1MB in the beginning and 515.9MB in the end (delta: 362.8MB). Free memory was 104.6MB in the beginning and 237.2MB in the end (delta: -132.6MB). Peak memory consumption was 229.8MB. Max. memory is 16.1GB. [2024-10-12 16:16:24,078 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 100.7MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:16:24,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.99ms. Allocated memory is still 153.1MB. Free memory was 104.6MB in the beginning and 70.1MB in the end (delta: 34.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-12 16:16:24,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.91ms. Allocated memory is still 153.1MB. Free memory was 70.1MB in the beginning and 60.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 16:16:24,079 INFO L158 Benchmark]: Boogie Preprocessor took 162.87ms. Allocated memory is still 153.1MB. Free memory was 60.2MB in the beginning and 47.5MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 16:16:24,082 INFO L158 Benchmark]: RCFGBuilder took 1710.37ms. Allocated memory is still 153.1MB. Free memory was 46.9MB in the beginning and 63.8MB in the end (delta: -16.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-10-12 16:16:24,083 INFO L158 Benchmark]: TraceAbstraction took 18104.38ms. Allocated memory was 153.1MB in the beginning and 515.9MB in the end (delta: 362.8MB). Free memory was 62.9MB in the beginning and 251.9MB in the end (delta: -189.0MB). Peak memory consumption was 175.6MB. Max. memory is 16.1GB. [2024-10-12 16:16:24,083 INFO L158 Benchmark]: Witness Printer took 182.42ms. Allocated memory is still 515.9MB. Free memory was 250.8MB in the beginning and 237.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 16:16:24,085 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.36ms. Allocated memory is still 100.7MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.99ms. Allocated memory is still 153.1MB. Free memory was 104.6MB in the beginning and 70.1MB in the end (delta: 34.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.91ms. Allocated memory is still 153.1MB. Free memory was 70.1MB in the beginning and 60.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 162.87ms. Allocated memory is still 153.1MB. Free memory was 60.2MB in the beginning and 47.5MB in the end (delta: 12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1710.37ms. Allocated memory is still 153.1MB. Free memory was 46.9MB in the beginning and 63.8MB in the end (delta: -16.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18104.38ms. Allocated memory was 153.1MB in the beginning and 515.9MB in the end (delta: 362.8MB). Free memory was 62.9MB in the beginning and 251.9MB in the end (delta: -189.0MB). Peak memory consumption was 175.6MB. Max. memory is 16.1GB. * Witness Printer took 182.42ms. Allocated memory is still 515.9MB. Free memory was 250.8MB in the beginning and 237.2MB in the end (delta: 13.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: 191]: 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, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1705 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1705 mSDsluCounter, 1745 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 853 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6735 IncrementalHoareTripleChecker+Invalid, 7588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 853 mSolverCounterUnsat, 1683 mSDtfsCounter, 6735 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2053 GetRequests, 2023 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3563occurred in iteration=12, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 3204 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 6635 NumberOfCodeBlocks, 6635 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6617 ConstructedInterpolants, 0 QuantifiedInterpolants, 24156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2572 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 11110/11431 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: 890]: Loop Invariant Derived loop invariant: (((((((((a15 <= 8) && (((long long) 49 + a12) <= 0)) && (10 <= a21)) || ((a24 == 1) && (a15 <= 6))) || ((a24 == 1) && (8 <= a15))) || ((a24 == 1) && (81 <= a12))) || ((a12 <= 11) && (a24 == 1))) || ((a24 == 1) && (7 <= a21))) || ((a15 <= 6) && (((long long) 49 + a12) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:16:24,117 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