./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label33.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 ba2534bfbb3b7fef6d384d90d6e700886914eb65b2774fd30412c09b1975a4a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:16:40,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:16:41,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:16:41,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:16:41,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:16:41,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:16:41,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:16:41,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:16:41,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:16:41,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:16:41,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:16:41,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:16:41,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:16:41,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:16:41,080 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:16:41,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:16:41,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:16:41,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:16:41,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:16:41,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:16:41,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:16:41,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:16:41,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:16:41,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:16:41,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:16:41,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:16:41,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:16:41,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:16:41,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:16:41,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:16:41,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:16:41,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:16:41,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:41,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:16:41,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:16:41,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:16:41,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:16:41,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:16:41,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:16:41,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:16:41,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:16:41,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:16:41,090 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-clean/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-clean/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 -> ba2534bfbb3b7fef6d384d90d6e700886914eb65b2774fd30412c09b1975a4a3 [2024-10-10 23:16:41,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:16:41,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:16:41,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:16:41,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:16:41,347 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:16:41,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label33.c [2024-10-10 23:16:42,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:16:43,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:16:43,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label33.c [2024-10-10 23:16:43,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/565207982/9da9a5ace9be467e8e8318d891202c78/FLAGe88e7d2d7 [2024-10-10 23:16:43,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/565207982/9da9a5ace9be467e8e8318d891202c78 [2024-10-10 23:16:43,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:16:43,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:16:43,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:43,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:16:43,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:16:43,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63da72cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43, skipping insertion in model container [2024-10-10 23:16:43,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:16:43,392 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label33.c[5127,5140] [2024-10-10 23:16:43,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:43,562 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:16:43,584 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label33.c[5127,5140] [2024-10-10 23:16:43,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:43,657 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:16:43,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43 WrapperNode [2024-10-10 23:16:43,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:43,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:43,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:16:43,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:16:43,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,767 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:16:43,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:43,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:16:43,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:16:43,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:16:43,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:16:43,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:16:43,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:16:43,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:16:43,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:16:43,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (1/1) ... [2024-10-10 23:16:43,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:43,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:16:43,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:16:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:16:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:16:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:16:43,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:16:44,047 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:16:44,049 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:16:45,084 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:16:45,085 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:16:45,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:16:45,145 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:16:45,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:45 BoogieIcfgContainer [2024-10-10 23:16:45,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:16:45,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:16:45,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:16:45,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:16:45,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:16:43" (1/3) ... [2024-10-10 23:16:45,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128d8b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:45, skipping insertion in model container [2024-10-10 23:16:45,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:43" (2/3) ... [2024-10-10 23:16:45,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128d8b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:45, skipping insertion in model container [2024-10-10 23:16:45,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:45" (3/3) ... [2024-10-10 23:16:45,155 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label33.c [2024-10-10 23:16:45,173 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:16:45,173 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:16:45,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:16:45,243 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;@53460217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:16:45,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:16:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 23:16:45,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:45,257 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] [2024-10-10 23:16:45,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:45,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1425991636, now seen corresponding path program 1 times [2024-10-10 23:16:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:45,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617916964] [2024-10-10 23:16:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:45,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:45,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617916964] [2024-10-10 23:16:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617916964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:45,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:45,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893464209] [2024-10-10 23:16:45,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:45,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:16:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:45,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:16:45,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:16:45,492 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:45,537 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:16:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:16:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 43 [2024-10-10 23:16:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:45,550 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:16:45,550 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:16:45,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:16:45,560 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:45,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:16:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:16:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:16:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:16:45,609 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 43 [2024-10-10 23:16:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:45,609 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:16:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:16:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 23:16:45,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:45,614 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] [2024-10-10 23:16:45,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:16:45,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:45,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash -14695347, now seen corresponding path program 1 times [2024-10-10 23:16:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844033762] [2024-10-10 23:16:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:45,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844033762] [2024-10-10 23:16:45,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844033762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:45,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:45,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:45,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243391943] [2024-10-10 23:16:45,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:45,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:45,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:45,861 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:46,485 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-10 23:16:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:46,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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 43 [2024-10-10 23:16:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:46,488 INFO L225 Difference]: With dead ends: 422 [2024-10-10 23:16:46,488 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:16:46,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:46,490 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:46,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 29 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:16:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:16:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:16:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.4678571428571427) internal successors, (411), 280 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 411 transitions. [2024-10-10 23:16:46,508 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 411 transitions. Word has length 43 [2024-10-10 23:16:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:46,508 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 411 transitions. [2024-10-10 23:16:46,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2024-10-10 23:16:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-10 23:16:46,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:46,512 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:46,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:16:46,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:46,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:46,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1465520241, now seen corresponding path program 1 times [2024-10-10 23:16:46,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:46,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007278643] [2024-10-10 23:16:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:46,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:46,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007278643] [2024-10-10 23:16:46,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007278643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:46,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:46,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:46,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373940658] [2024-10-10 23:16:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:46,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:46,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:46,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:46,765 INFO L87 Difference]: Start difference. First operand 281 states and 411 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:47,285 INFO L93 Difference]: Finished difference Result 839 states and 1230 transitions. [2024-10-10 23:16:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-10 23:16:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:47,289 INFO L225 Difference]: With dead ends: 839 [2024-10-10 23:16:47,289 INFO L226 Difference]: Without dead ends: 559 [2024-10-10 23:16:47,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:47,291 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:47,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-10 23:16:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-10 23:16:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3064516129032258) internal successors, (729), 558 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2024-10-10 23:16:47,321 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 113 [2024-10-10 23:16:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:47,322 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2024-10-10 23:16:47,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2024-10-10 23:16:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-10 23:16:47,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:47,326 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:47,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:16:47,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:47,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash 467953201, now seen corresponding path program 1 times [2024-10-10 23:16:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:47,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237713160] [2024-10-10 23:16:47,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:47,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:47,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:47,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237713160] [2024-10-10 23:16:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237713160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:47,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77694455] [2024-10-10 23:16:47,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:47,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:47,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:47,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:47,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:16:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:47,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:47,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:47,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77694455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:47,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:47,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:16:47,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065706108] [2024-10-10 23:16:47,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:47,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:47,927 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:48,443 INFO L93 Difference]: Finished difference Result 978 states and 1298 transitions. [2024-10-10 23:16:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:48,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118 [2024-10-10 23:16:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:48,451 INFO L225 Difference]: With dead ends: 978 [2024-10-10 23:16:48,451 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:16:48,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:48,454 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 139 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:48,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:16:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 698. [2024-10-10 23:16:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.3529411764705883) internal successors, (943), 697 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 943 transitions. [2024-10-10 23:16:48,490 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 943 transitions. Word has length 118 [2024-10-10 23:16:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:48,490 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 943 transitions. [2024-10-10 23:16:48,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 943 transitions. [2024-10-10 23:16:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-10 23:16:48,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:48,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:48,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:16:48,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:48,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:48,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1807206423, now seen corresponding path program 1 times [2024-10-10 23:16:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:48,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980707110] [2024-10-10 23:16:48,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980707110] [2024-10-10 23:16:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980707110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:49,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:49,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748305005] [2024-10-10 23:16:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:49,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:16:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:49,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:16:49,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:16:49,159 INFO L87 Difference]: Start difference. First operand 698 states and 943 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:49,719 INFO L93 Difference]: Finished difference Result 1534 states and 2044 transitions. [2024-10-10 23:16:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:16:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-10-10 23:16:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:49,725 INFO L225 Difference]: With dead ends: 1534 [2024-10-10 23:16:49,725 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:16:49,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:16:49,728 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:49,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 83 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:16:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-10 23:16:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.3002392344497609) internal successors, (1087), 836 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1087 transitions. [2024-10-10 23:16:49,748 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1087 transitions. Word has length 161 [2024-10-10 23:16:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:49,748 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1087 transitions. [2024-10-10 23:16:49,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1087 transitions. [2024-10-10 23:16:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-10 23:16:49,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:49,751 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:16:49,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:16:49,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1246194655, now seen corresponding path program 1 times [2024-10-10 23:16:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:49,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314946725] [2024-10-10 23:16:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314946725] [2024-10-10 23:16:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314946725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:50,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:16:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875211543] [2024-10-10 23:16:50,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:50,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:16:50,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:50,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:16:50,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:50,213 INFO L87 Difference]: Start difference. First operand 837 states and 1087 transitions. Second operand has 7 states, 7 states have (on average 28.0) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:50,752 INFO L93 Difference]: Finished difference Result 1589 states and 2084 transitions. [2024-10-10 23:16:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:16:50,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.0) internal successors, (196), 6 states have internal predecessors, (196), 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 196 [2024-10-10 23:16:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:50,756 INFO L225 Difference]: With dead ends: 1589 [2024-10-10 23:16:50,756 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:16:50,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:50,759 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:50,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 18 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:16:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-10 23:16:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2930622009569377) internal successors, (1081), 836 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1081 transitions. [2024-10-10 23:16:50,780 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1081 transitions. Word has length 196 [2024-10-10 23:16:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:50,781 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1081 transitions. [2024-10-10 23:16:50,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.0) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1081 transitions. [2024-10-10 23:16:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-10 23:16:50,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:50,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-10-10 23:16:50,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:16:50,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:50,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2013264545, now seen corresponding path program 1 times [2024-10-10 23:16:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:50,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110570652] [2024-10-10 23:16:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:50,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110570652] [2024-10-10 23:16:50,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110570652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:50,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:50,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804391032] [2024-10-10 23:16:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:50,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:50,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:50,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:50,969 INFO L87 Difference]: Start difference. First operand 837 states and 1081 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:51,453 INFO L93 Difference]: Finished difference Result 1951 states and 2638 transitions. [2024-10-10 23:16:51,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:51,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2024-10-10 23:16:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:51,458 INFO L225 Difference]: With dead ends: 1951 [2024-10-10 23:16:51,458 INFO L226 Difference]: Without dead ends: 1254 [2024-10-10 23:16:51,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:51,461 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:51,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 211 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-10 23:16:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 837. [2024-10-10 23:16:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2822966507177034) internal successors, (1072), 836 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1072 transitions. [2024-10-10 23:16:51,479 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1072 transitions. Word has length 203 [2024-10-10 23:16:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:51,479 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1072 transitions. [2024-10-10 23:16:51,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1072 transitions. [2024-10-10 23:16:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-10 23:16:51,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:51,482 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:16:51,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:16:51,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1782441339, now seen corresponding path program 1 times [2024-10-10 23:16:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548527477] [2024-10-10 23:16:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:51,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548527477] [2024-10-10 23:16:51,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548527477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:51,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:51,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134339278] [2024-10-10 23:16:51,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:51,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:51,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:51,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:51,664 INFO L87 Difference]: Start difference. First operand 837 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:52,178 INFO L93 Difference]: Finished difference Result 1951 states and 2620 transitions. [2024-10-10 23:16:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:52,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2024-10-10 23:16:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:52,183 INFO L225 Difference]: With dead ends: 1951 [2024-10-10 23:16:52,184 INFO L226 Difference]: Without dead ends: 1254 [2024-10-10 23:16:52,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:52,186 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:52,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 187 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-10 23:16:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1115. [2024-10-10 23:16:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2612208258527828) internal successors, (1405), 1114 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1405 transitions. [2024-10-10 23:16:52,214 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1405 transitions. Word has length 232 [2024-10-10 23:16:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:52,215 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1405 transitions. [2024-10-10 23:16:52,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1405 transitions. [2024-10-10 23:16:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-10 23:16:52,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:52,222 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:52,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:16:52,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:52,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash -382368498, now seen corresponding path program 1 times [2024-10-10 23:16:52,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:52,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556947019] [2024-10-10 23:16:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:52,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-10 23:16:52,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:52,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556947019] [2024-10-10 23:16:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556947019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:52,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453069340] [2024-10-10 23:16:52,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:52,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:52,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:52,797 INFO L87 Difference]: Start difference. First operand 1115 states and 1405 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:53,262 INFO L93 Difference]: Finished difference Result 1393 states and 1728 transitions. [2024-10-10 23:16:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:53,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2024-10-10 23:16:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:53,263 INFO L225 Difference]: With dead ends: 1393 [2024-10-10 23:16:53,263 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:16:53,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:53,266 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 139 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:53,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 6 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:16:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:16:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:16:53,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 342 [2024-10-10 23:16:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:53,267 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:16:53,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:16:53,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:16:53,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:16:53,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:16:53,273 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:53,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:16:53,371 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:16:53,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:16:53 BoogieIcfgContainer [2024-10-10 23:16:53,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:16:53,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:16:53,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:16:53,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:16:53,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:45" (3/4) ... [2024-10-10 23:16:53,390 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:16:53,408 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:16:53,408 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:16:53,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:16:53,413 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:16:53,554 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:16:53,555 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:16:53,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:16:53,555 INFO L158 Benchmark]: Toolchain (without parser) took 10451.09ms. Allocated memory was 140.5MB in the beginning and 257.9MB in the end (delta: 117.4MB). Free memory was 91.0MB in the beginning and 152.1MB in the end (delta: -61.2MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-10-10 23:16:53,556 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 140.5MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:16:53,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.82ms. Allocated memory is still 140.5MB. Free memory was 90.5MB in the beginning and 60.7MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-10 23:16:53,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.74ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 60.7MB in the beginning and 141.4MB in the end (delta: -80.7MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-10-10 23:16:53,556 INFO L158 Benchmark]: Boogie Preprocessor took 109.37ms. Allocated memory is still 176.2MB. Free memory was 141.4MB in the beginning and 131.0MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:16:53,557 INFO L158 Benchmark]: RCFGBuilder took 1263.77ms. Allocated memory is still 176.2MB. Free memory was 131.0MB in the beginning and 125.8MB in the end (delta: 5.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-10-10 23:16:53,557 INFO L158 Benchmark]: TraceAbstraction took 8237.68ms. Allocated memory was 176.2MB in the beginning and 257.9MB in the end (delta: 81.8MB). Free memory was 124.7MB in the beginning and 164.7MB in the end (delta: -40.0MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-10-10 23:16:53,557 INFO L158 Benchmark]: Witness Printer took 168.78ms. Allocated memory is still 257.9MB. Free memory was 164.7MB in the beginning and 152.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:16:53,559 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.18ms. Allocated memory is still 140.5MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.82ms. Allocated memory is still 140.5MB. Free memory was 90.5MB in the beginning and 60.7MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.74ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 60.7MB in the beginning and 141.4MB in the end (delta: -80.7MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.37ms. Allocated memory is still 176.2MB. Free memory was 141.4MB in the beginning and 131.0MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1263.77ms. Allocated memory is still 176.2MB. Free memory was 131.0MB in the beginning and 125.8MB in the end (delta: 5.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8237.68ms. Allocated memory was 176.2MB in the beginning and 257.9MB in the end (delta: 81.8MB). Free memory was 124.7MB in the beginning and 164.7MB in the end (delta: -40.0MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Witness Printer took 168.78ms. Allocated memory is still 257.9MB. Free memory was 164.7MB in the beginning and 152.1MB 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: 146]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 807 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 807 mSDsluCounter, 825 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3448 IncrementalHoareTripleChecker+Invalid, 3914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 466 mSolverCounterUnsat, 784 mSDtfsCounter, 3448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1115occurred in iteration=8, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 834 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1569 NumberOfCodeBlocks, 1569 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1559 ConstructedInterpolants, 0 QuantifiedInterpolants, 5833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1003/1009 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((14 == a4) && (a10 == 2)) && (a12 == 0)) || (((14 == a4) && (7 != a19)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:16:53,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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