./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/eca-rers2012/Problem02_label26.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 18aad4ca7dabbbf78ef10474b35f6cac486a6e59d41545af1bcfdc261bf8f717 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:19:50,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:19:50,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:19:50,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:19:50,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:19:50,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:19:50,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:19:50,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:19:50,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:19:50,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:19:50,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:19:50,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:19:50,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:19:50,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:19:50,835 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:19:50,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:19:50,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:19:50,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:19:50,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:19:50,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:19:50,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:19:50,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:19:50,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:19:50,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:19:50,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:19:50,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:19:50,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:19:50,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:19:50,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:19:50,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:19:50,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:19:50,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:19:50,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:19:50,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:19:50,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:19:50,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:19:50,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:19:50,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:19:50,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:19:50,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:19:50,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:19:50,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:19:50,848 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 -> 18aad4ca7dabbbf78ef10474b35f6cac486a6e59d41545af1bcfdc261bf8f717 [2024-11-21 21:19:51,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:19:51,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:19:51,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:19:51,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:19:51,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:19:51,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label26.c [2024-11-21 21:19:52,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:19:52,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:19:52,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label26.c [2024-11-21 21:19:52,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2b44583/530bcf167247428b9d00fbc13e15baf3/FLAGb94ce74e3 [2024-11-21 21:19:53,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2b44583/530bcf167247428b9d00fbc13e15baf3 [2024-11-21 21:19:53,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:19:53,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:19:53,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:19:53,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:19:53,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:19:53,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a307e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53, skipping insertion in model container [2024-11-21 21:19:53,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:19:53,576 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label26.c[20881,20894] [2024-11-21 21:19:53,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:19:53,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:19:53,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label26.c[20881,20894] [2024-11-21 21:19:53,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:19:53,740 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:19:53,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53 WrapperNode [2024-11-21 21:19:53,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:19:53,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:19:53,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:19:53,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:19:53,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,826 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-21 21:19:53,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:19:53,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:19:53,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:19:53,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:19:53,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,878 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-21 21:19:53,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:19:53,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:19:53,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:19:53,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:19:53,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (1/1) ... [2024-11-21 21:19:53,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:19:53,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:19:53,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 21:19:53,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 21:19:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:19:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:19:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:19:54,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:19:54,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:19:54,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:19:54,964 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 21:19:54,964 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:19:54,983 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:19:54,985 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:19:54,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:54 BoogieIcfgContainer [2024-11-21 21:19:54,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:19:54,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:19:54,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:19:54,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:19:54,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:19:53" (1/3) ... [2024-11-21 21:19:54,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7024f147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:19:54, skipping insertion in model container [2024-11-21 21:19:54,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:53" (2/3) ... [2024-11-21 21:19:54,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7024f147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:19:54, skipping insertion in model container [2024-11-21 21:19:54,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:54" (3/3) ... [2024-11-21 21:19:54,995 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label26.c [2024-11-21 21:19:55,012 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:19:55,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:19:55,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:19:55,090 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;@7582c7e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:19:55,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:19:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-21 21:19:55,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:55,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:55,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:55,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash 768814821, now seen corresponding path program 1 times [2024-11-21 21:19:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242587631] [2024-11-21 21:19:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242587631] [2024-11-21 21:19:55,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242587631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:55,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:55,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:55,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756282949] [2024-11-21 21:19:55,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:55,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:55,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:55,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:55,719 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:56,426 INFO L93 Difference]: Finished difference Result 596 states and 1030 transitions. [2024-11-21 21:19:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:56,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-21 21:19:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:56,439 INFO L225 Difference]: With dead ends: 596 [2024-11-21 21:19:56,439 INFO L226 Difference]: Without dead ends: 305 [2024-11-21 21:19:56,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:56,446 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 108 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:56,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:19:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-21 21:19:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-21 21:19:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2024-11-21 21:19:56,498 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 136 [2024-11-21 21:19:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:56,499 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2024-11-21 21:19:56,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2024-11-21 21:19:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-21 21:19:56,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:56,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:56,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:19:56,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:56,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1739122209, now seen corresponding path program 1 times [2024-11-21 21:19:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:56,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163533486] [2024-11-21 21:19:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:56,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:56,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163533486] [2024-11-21 21:19:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163533486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:56,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671163540] [2024-11-21 21:19:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:56,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:56,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:56,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:56,716 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:57,167 INFO L93 Difference]: Finished difference Result 902 states and 1375 transitions. [2024-11-21 21:19:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:57,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-21 21:19:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:57,172 INFO L225 Difference]: With dead ends: 902 [2024-11-21 21:19:57,172 INFO L226 Difference]: Without dead ends: 599 [2024-11-21 21:19:57,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:57,175 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:57,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 71 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-21 21:19:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2024-11-21 21:19:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.477310924369748) internal successors, (879), 595 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 879 transitions. [2024-11-21 21:19:57,204 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 879 transitions. Word has length 147 [2024-11-21 21:19:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:57,204 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 879 transitions. [2024-11-21 21:19:57,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 879 transitions. [2024-11-21 21:19:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-21 21:19:57,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:57,209 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:57,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:19:57,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash 959969494, now seen corresponding path program 1 times [2024-11-21 21:19:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:57,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420483515] [2024-11-21 21:19:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-21 21:19:57,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:57,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420483515] [2024-11-21 21:19:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420483515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:57,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880096272] [2024-11-21 21:19:57,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:57,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:57,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:57,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:57,357 INFO L87 Difference]: Start difference. First operand 596 states and 879 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:57,589 INFO L93 Difference]: Finished difference Result 1040 states and 1541 transitions. [2024-11-21 21:19:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:57,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 151 [2024-11-21 21:19:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:57,591 INFO L225 Difference]: With dead ends: 1040 [2024-11-21 21:19:57,591 INFO L226 Difference]: Without dead ends: 446 [2024-11-21 21:19:57,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:57,597 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:57,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 23 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:19:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-21 21:19:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-11-21 21:19:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.4247191011235956) internal successors, (634), 445 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2024-11-21 21:19:57,615 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 151 [2024-11-21 21:19:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:57,615 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2024-11-21 21:19:57,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2024-11-21 21:19:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-21 21:19:57,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:57,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:57,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:19:57,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:57,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash -90241050, now seen corresponding path program 1 times [2024-11-21 21:19:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574858973] [2024-11-21 21:19:57,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:57,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:57,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574858973] [2024-11-21 21:19:57,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574858973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:57,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:57,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117478903] [2024-11-21 21:19:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:57,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:57,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:57,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:57,783 INFO L87 Difference]: Start difference. First operand 446 states and 634 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:58,153 INFO L93 Difference]: Finished difference Result 1326 states and 1888 transitions. [2024-11-21 21:19:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-11-21 21:19:58,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:58,157 INFO L225 Difference]: With dead ends: 1326 [2024-11-21 21:19:58,157 INFO L226 Difference]: Without dead ends: 882 [2024-11-21 21:19:58,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:58,159 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:58,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 82 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-21 21:19:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 875. [2024-11-21 21:19:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.3729977116704806) internal successors, (1200), 874 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1200 transitions. [2024-11-21 21:19:58,184 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1200 transitions. Word has length 154 [2024-11-21 21:19:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:58,185 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1200 transitions. [2024-11-21 21:19:58,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1200 transitions. [2024-11-21 21:19:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-21 21:19:58,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:58,190 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:58,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:19:58,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:58,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1636593553, now seen corresponding path program 1 times [2024-11-21 21:19:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343084312] [2024-11-21 21:19:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343084312] [2024-11-21 21:19:58,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343084312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:58,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:58,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:58,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141321810] [2024-11-21 21:19:58,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:58,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:58,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:58,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:58,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:58,312 INFO L87 Difference]: Start difference. First operand 875 states and 1200 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:58,722 INFO L93 Difference]: Finished difference Result 2310 states and 3170 transitions. [2024-11-21 21:19:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:58,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-11-21 21:19:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:58,728 INFO L225 Difference]: With dead ends: 2310 [2024-11-21 21:19:58,728 INFO L226 Difference]: Without dead ends: 1437 [2024-11-21 21:19:58,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:58,730 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 140 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:58,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 60 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-11-21 21:19:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1297. [2024-11-21 21:19:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1296 states have (on average 1.3032407407407407) internal successors, (1689), 1296 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1689 transitions. [2024-11-21 21:19:58,753 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1689 transitions. Word has length 158 [2024-11-21 21:19:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:58,754 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1689 transitions. [2024-11-21 21:19:58,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1689 transitions. [2024-11-21 21:19:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-21 21:19:58,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:58,758 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:58,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:19:58,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:58,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 192088678, now seen corresponding path program 1 times [2024-11-21 21:19:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959163177] [2024-11-21 21:19:58,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-21 21:19:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959163177] [2024-11-21 21:19:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959163177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:58,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:58,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926170895] [2024-11-21 21:19:58,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:58,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:58,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:58,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:58,857 INFO L87 Difference]: Start difference. First operand 1297 states and 1689 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:59,221 INFO L93 Difference]: Finished difference Result 2592 states and 3376 transitions. [2024-11-21 21:19:59,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:59,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-11-21 21:19:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:59,247 INFO L225 Difference]: With dead ends: 2592 [2024-11-21 21:19:59,248 INFO L226 Difference]: Without dead ends: 1297 [2024-11-21 21:19:59,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:59,250 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:59,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 247 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:19:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-11-21 21:19:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1291. [2024-11-21 21:19:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1290 states have (on average 1.248062015503876) internal successors, (1610), 1290 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1610 transitions. [2024-11-21 21:19:59,273 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1610 transitions. Word has length 163 [2024-11-21 21:19:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:59,273 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1610 transitions. [2024-11-21 21:19:59,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1610 transitions. [2024-11-21 21:19:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-21 21:19:59,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:59,279 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:59,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:19:59,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:59,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash 628642087, now seen corresponding path program 1 times [2024-11-21 21:19:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:59,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423230446] [2024-11-21 21:19:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 21:19:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423230446] [2024-11-21 21:19:59,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423230446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:59,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:59,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:59,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982633045] [2024-11-21 21:19:59,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:59,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:59,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:59,461 INFO L87 Difference]: Start difference. First operand 1291 states and 1610 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:59,859 INFO L93 Difference]: Finished difference Result 3430 states and 4276 transitions. [2024-11-21 21:19:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:59,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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-11-21 21:19:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:59,866 INFO L225 Difference]: With dead ends: 3430 [2024-11-21 21:19:59,867 INFO L226 Difference]: Without dead ends: 2141 [2024-11-21 21:19:59,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:59,869 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:59,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 248 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2024-11-21 21:19:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2139. [2024-11-21 21:19:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.19644527595884) internal successors, (2558), 2138 states have internal predecessors, (2558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2558 transitions. [2024-11-21 21:19:59,933 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2558 transitions. Word has length 163 [2024-11-21 21:19:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:59,934 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2558 transitions. [2024-11-21 21:19:59,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2558 transitions. [2024-11-21 21:19:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-21 21:19:59,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:59,940 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:59,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:19:59,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:59,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:59,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1045977767, now seen corresponding path program 1 times [2024-11-21 21:19:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:59,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989116945] [2024-11-21 21:19:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989116945] [2024-11-21 21:20:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989116945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:00,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:20:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597464541] [2024-11-21 21:20:00,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:00,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:20:00,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:20:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:20:00,229 INFO L87 Difference]: Start difference. First operand 2139 states and 2558 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:01,112 INFO L93 Difference]: Finished difference Result 5248 states and 6309 transitions. [2024-11-21 21:20:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:20:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2024-11-21 21:20:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:01,121 INFO L225 Difference]: With dead ends: 5248 [2024-11-21 21:20:01,121 INFO L226 Difference]: Without dead ends: 2551 [2024-11-21 21:20:01,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:20:01,125 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 294 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:01,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 100 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 21:20:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2024-11-21 21:20:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2551. [2024-11-21 21:20:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2550 states have (on average 1.1133333333333333) internal successors, (2839), 2550 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 2839 transitions. [2024-11-21 21:20:01,174 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 2839 transitions. Word has length 207 [2024-11-21 21:20:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:01,174 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 2839 transitions. [2024-11-21 21:20:01,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 2839 transitions. [2024-11-21 21:20:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-21 21:20:01,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:01,180 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:01,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:20:01,181 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:01,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash 901541662, now seen corresponding path program 1 times [2024-11-21 21:20:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:01,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900510824] [2024-11-21 21:20:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:01,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 21:20:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900510824] [2024-11-21 21:20:01,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900510824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:01,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:01,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577862105] [2024-11-21 21:20:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:01,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:01,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:01,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:01,396 INFO L87 Difference]: Start difference. First operand 2551 states and 2839 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:01,772 INFO L93 Difference]: Finished difference Result 4106 states and 4578 transitions. [2024-11-21 21:20:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:01,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-11-21 21:20:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:01,780 INFO L225 Difference]: With dead ends: 4106 [2024-11-21 21:20:01,781 INFO L226 Difference]: Without dead ends: 2125 [2024-11-21 21:20:01,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:01,786 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 80 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:01,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 213 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2024-11-21 21:20:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2125. [2024-11-21 21:20:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 2124 states have (on average 1.0819209039548023) internal successors, (2298), 2124 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2298 transitions. [2024-11-21 21:20:01,823 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2298 transitions. Word has length 229 [2024-11-21 21:20:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:01,823 INFO L471 AbstractCegarLoop]: Abstraction has 2125 states and 2298 transitions. [2024-11-21 21:20:01,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2298 transitions. [2024-11-21 21:20:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-21 21:20:01,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:01,829 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:01,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:20:01,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:01,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1138162939, now seen corresponding path program 1 times [2024-11-21 21:20:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781260176] [2024-11-21 21:20:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-21 21:20:01,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781260176] [2024-11-21 21:20:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781260176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:01,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:01,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496537782] [2024-11-21 21:20:01,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:01,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:01,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:01,949 INFO L87 Difference]: Start difference. First operand 2125 states and 2298 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:02,285 INFO L93 Difference]: Finished difference Result 3109 states and 3353 transitions. [2024-11-21 21:20:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 238 [2024-11-21 21:20:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:02,286 INFO L225 Difference]: With dead ends: 3109 [2024-11-21 21:20:02,286 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 21:20:02,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:02,289 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 111 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:02,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 200 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 21:20:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 21:20:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 21:20:02,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2024-11-21 21:20:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:02,290 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 21:20:02,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 21:20:02,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 21:20:02,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:20:02,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 21:20:02,297 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:02,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 21:20:02,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:20:02,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:20:02 BoogieIcfgContainer [2024-11-21 21:20:02,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:20:02,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:20:02,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:20:02,564 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:20:02,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:54" (3/4) ... [2024-11-21 21:20:02,567 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 21:20:02,580 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 21:20:02,581 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 21:20:02,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 21:20:02,583 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 21:20:02,706 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:20:02,706 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 21:20:02,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:20:02,707 INFO L158 Benchmark]: Toolchain (without parser) took 9566.23ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 104.9MB in the beginning and 212.2MB in the end (delta: -107.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:20:02,707 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:20:02,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.73ms. Allocated memory is still 174.1MB. Free memory was 104.6MB in the beginning and 124.9MB in the end (delta: -20.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-21 21:20:02,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.63ms. Allocated memory is still 174.1MB. Free memory was 124.9MB in the beginning and 119.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-21 21:20:02,708 INFO L158 Benchmark]: Boogie Preprocessor took 101.92ms. Allocated memory is still 174.1MB. Free memory was 119.1MB in the beginning and 113.7MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:20:02,708 INFO L158 Benchmark]: RCFGBuilder took 1054.79ms. Allocated memory is still 174.1MB. Free memory was 113.7MB in the beginning and 122.5MB in the end (delta: -8.8MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2024-11-21 21:20:02,709 INFO L158 Benchmark]: TraceAbstraction took 7575.09ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 121.6MB in the beginning and 224.8MB in the end (delta: -103.2MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2024-11-21 21:20:02,709 INFO L158 Benchmark]: Witness Printer took 142.73ms. Allocated memory is still 276.8MB. Free memory was 224.8MB in the beginning and 212.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:20:02,711 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.16ms. Allocated memory is still 111.1MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.73ms. Allocated memory is still 174.1MB. Free memory was 104.6MB in the beginning and 124.9MB in the end (delta: -20.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.63ms. Allocated memory is still 174.1MB. Free memory was 124.9MB in the beginning and 119.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.92ms. Allocated memory is still 174.1MB. Free memory was 119.1MB in the beginning and 113.7MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1054.79ms. Allocated memory is still 174.1MB. Free memory was 113.7MB in the beginning and 122.5MB in the end (delta: -8.8MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7575.09ms. Allocated memory was 174.1MB in the beginning and 276.8MB in the end (delta: 102.8MB). Free memory was 121.6MB in the beginning and 224.8MB in the end (delta: -103.2MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. * Witness Printer took 142.73ms. Allocated memory is still 276.8MB. Free memory was 224.8MB in the beginning and 212.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 590]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1454 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1454 mSDsluCounter, 1333 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3978 IncrementalHoareTripleChecker+Invalid, 4563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 585 mSolverCounterUnsat, 1164 mSDtfsCounter, 3978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2551occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 158 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1746 NumberOfCodeBlocks, 1746 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1736 ConstructedInterpolants, 0 QuantifiedInterpolants, 3316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 472/472 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: 616]: Loop Invariant Derived loop invariant: (((((((((((((((a17 == 8) && (a25 == 1)) && (a28 <= 9)) && (a11 <= 0)) || ((((a19 == 0) && (a17 == 8)) && (a25 == 1)) && (a11 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a28 == 10)) && (a21 == 1)) && (a19 == 1))) || (((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1))) || ((((a25 == 1) && (a28 <= 9)) && (a11 == 1)) && (a17 <= 8))) || (((a19 == 0) && (a17 <= 7)) && (a25 <= 0))) || ((((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1))) || (((a11 == 1) && (a17 <= 7)) && (a25 <= 0))) || ((((a17 == 8) && (a28 <= 9)) && (a11 <= 0)) && (a25 <= 0))) || (((a25 == 1) && (a28 <= 9)) && (a17 <= 7))) || ((((a17 == 8) && (a28 <= 9)) && (a11 == 1)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-21 21:20:02,732 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