./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/Problem01_label51.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/Problem01_label51.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 39ef6d062a4ff56ba1e3913ade729d3f60e638b9dea34b0ea6935ef8cddd75d2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:34:19,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:34:20,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:34:20,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:34:20,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:34:20,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:34:20,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:34:20,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:34:20,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:34:20,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:34:20,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:34:20,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:34:20,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:34:20,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:34:20,093 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:34:20,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:34:20,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:34:20,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:34:20,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:34:20,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:34:20,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:34:20,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:34:20,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:34:20,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:34:20,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:34:20,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:34:20,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:34:20,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:34:20,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:34:20,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:34:20,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:34:20,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:34:20,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:34:20,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:34:20,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:34:20,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:34:20,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:34:20,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:34:20,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:34:20,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:34:20,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:34:20,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:34:20,101 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 -> 39ef6d062a4ff56ba1e3913ade729d3f60e638b9dea34b0ea6935ef8cddd75d2 [2024-10-10 22:34:20,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:34:20,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:34:20,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:34:20,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:34:20,372 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:34:20,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label51.c [2024-10-10 22:34:21,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:34:22,138 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:34:22,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label51.c [2024-10-10 22:34:22,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/03b244bf8/69baa7fda40b43dd9ecdc9c19ad354e8/FLAGd94f6290b [2024-10-10 22:34:22,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/03b244bf8/69baa7fda40b43dd9ecdc9c19ad354e8 [2024-10-10 22:34:22,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:34:22,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:34:22,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:34:22,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:34:22,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:34:22,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606ddacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22, skipping insertion in model container [2024-10-10 22:34:22,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:34:22,525 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/Problem01_label51.c[18730,18743] [2024-10-10 22:34:22,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:34:22,572 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:34:22,633 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/Problem01_label51.c[18730,18743] [2024-10-10 22:34:22,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:34:22,658 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:34:22,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22 WrapperNode [2024-10-10 22:34:22,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:34:22,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:34:22,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:34:22,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:34:22,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,720 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-10 22:34:22,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:34:22,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:34:22,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:34:22,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:34:22,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,753 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 22:34:22,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:34:22,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:34:22,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:34:22,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:34:22,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (1/1) ... [2024-10-10 22:34:22,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:34:22,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:22,824 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 22:34:22,827 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 22:34:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:34:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:34:22,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:34:22,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:34:22,941 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:34:22,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:34:23,829 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-10 22:34:23,831 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:34:23,877 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:34:23,878 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:34:23,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:23 BoogieIcfgContainer [2024-10-10 22:34:23,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:34:23,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:34:23,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:34:23,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:34:23,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:34:22" (1/3) ... [2024-10-10 22:34:23,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280e7b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:34:23, skipping insertion in model container [2024-10-10 22:34:23,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:22" (2/3) ... [2024-10-10 22:34:23,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280e7b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:34:23, skipping insertion in model container [2024-10-10 22:34:23,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:23" (3/3) ... [2024-10-10 22:34:23,886 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label51.c [2024-10-10 22:34:23,900 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:34:23,900 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:34:23,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:34:23,971 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;@7e0fb3d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:34:23,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:34:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 22:34:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-10 22:34:23,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:23,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:23,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:23,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash -92354426, now seen corresponding path program 1 times [2024-10-10 22:34:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:24,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385585937] [2024-10-10 22:34:24,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:24,345 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 22:34:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:24,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385585937] [2024-10-10 22:34:24,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385585937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158789419] [2024-10-10 22:34:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:24,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:34:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:34:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:34:24,378 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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 22:34:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:24,402 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-10 22:34:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:34:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-10-10 22:34:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:24,412 INFO L225 Difference]: With dead ends: 271 [2024-10-10 22:34:24,412 INFO L226 Difference]: Without dead ends: 134 [2024-10-10 22:34:24,415 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 22:34:24,417 INFO L432 NwaCegarLoop]: 200 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, 200 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 22:34:24,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:34:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-10 22:34:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-10 22:34:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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 22:34:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-10 22:34:24,454 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 105 [2024-10-10 22:34:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:24,457 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-10 22:34:24,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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 22:34:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-10 22:34:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-10 22:34:24,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:24,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:24,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:34:24,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:24,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1253932375, now seen corresponding path program 1 times [2024-10-10 22:34:24,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:24,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815632187] [2024-10-10 22:34:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:24,726 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 22:34:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815632187] [2024-10-10 22:34:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815632187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:24,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:24,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:24,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240425029] [2024-10-10 22:34:24,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:24,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:24,732 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 22:34:25,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:25,404 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2024-10-10 22:34:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:25,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-10-10 22:34:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:25,416 INFO L225 Difference]: With dead ends: 398 [2024-10-10 22:34:25,416 INFO L226 Difference]: Without dead ends: 265 [2024-10-10 22:34:25,417 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 22:34:25,424 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:25,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 29 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:34:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-10 22:34:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-10 22:34:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 264 states have internal predecessors, (379), 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 22:34:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 379 transitions. [2024-10-10 22:34:25,471 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 379 transitions. Word has length 105 [2024-10-10 22:34:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:25,472 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 379 transitions. [2024-10-10 22:34:25,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 22:34:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 379 transitions. [2024-10-10 22:34:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-10 22:34:25,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:25,476 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:25,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:34:25,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:25,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1671367466, now seen corresponding path program 1 times [2024-10-10 22:34:25,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:25,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970413689] [2024-10-10 22:34:25,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:25,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970413689] [2024-10-10 22:34:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970413689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:25,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479435872] [2024-10-10 22:34:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:25,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:25,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:25,697 INFO L87 Difference]: Start difference. First operand 265 states and 379 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:26,206 INFO L93 Difference]: Finished difference Result 791 states and 1134 transitions. [2024-10-10 22:34:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:26,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-10-10 22:34:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:26,213 INFO L225 Difference]: With dead ends: 791 [2024-10-10 22:34:26,214 INFO L226 Difference]: Without dead ends: 527 [2024-10-10 22:34:26,218 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 22:34:26,222 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:26,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:34:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-10 22:34:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-10-10 22:34:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3460076045627376) internal successors, (708), 526 states have internal predecessors, (708), 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 22:34:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions. [2024-10-10 22:34:26,278 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 111 [2024-10-10 22:34:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:26,278 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 708 transitions. [2024-10-10 22:34:26,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions. [2024-10-10 22:34:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-10 22:34:26,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:26,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:26,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:34:26,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash -821095830, now seen corresponding path program 1 times [2024-10-10 22:34:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:26,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008081454] [2024-10-10 22:34:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008081454] [2024-10-10 22:34:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008081454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384857350] [2024-10-10 22:34:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:26,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:34:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:34:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:34:26,783 INFO L87 Difference]: Start difference. First operand 527 states and 708 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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 22:34:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:27,405 INFO L93 Difference]: Finished difference Result 1410 states and 1881 transitions. [2024-10-10 22:34:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:34:27,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2024-10-10 22:34:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:27,408 INFO L225 Difference]: With dead ends: 1410 [2024-10-10 22:34:27,408 INFO L226 Difference]: Without dead ends: 789 [2024-10-10 22:34:27,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:34:27,410 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 128 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:27,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 78 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:34:27,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-10 22:34:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 658. [2024-10-10 22:34:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.1902587519025876) internal successors, (782), 657 states have internal predecessors, (782), 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 22:34:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 782 transitions. [2024-10-10 22:34:27,422 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 782 transitions. Word has length 112 [2024-10-10 22:34:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:27,422 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 782 transitions. [2024-10-10 22:34:27,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 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 22:34:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 782 transitions. [2024-10-10 22:34:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-10 22:34:27,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:27,425 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:27,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:34:27,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1868829400, now seen corresponding path program 1 times [2024-10-10 22:34:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413306944] [2024-10-10 22:34:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:27,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413306944] [2024-10-10 22:34:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413306944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:34:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854521909] [2024-10-10 22:34:27,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:27,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:27,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:27,591 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 22:34:27,595 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 22:34:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:27,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:34:27,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:34:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:34:27,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:34:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854521909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:27,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:34:27,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:34:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716495652] [2024-10-10 22:34:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:27,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:27,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:34:27,830 INFO L87 Difference]: Start difference. First operand 658 states and 782 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 22:34:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:28,304 INFO L93 Difference]: Finished difference Result 1708 states and 2039 transitions. [2024-10-10 22:34:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:28,305 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 120 [2024-10-10 22:34:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:28,308 INFO L225 Difference]: With dead ends: 1708 [2024-10-10 22:34:28,311 INFO L226 Difference]: Without dead ends: 920 [2024-10-10 22:34:28,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:34:28,317 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:28,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 170 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-10 22:34:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 789. [2024-10-10 22:34:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.1789340101522843) internal successors, (929), 788 states have internal predecessors, (929), 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 22:34:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 929 transitions. [2024-10-10 22:34:28,342 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 929 transitions. Word has length 120 [2024-10-10 22:34:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:28,342 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 929 transitions. [2024-10-10 22:34:28,343 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 22:34:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 929 transitions. [2024-10-10 22:34:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-10 22:34:28,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:28,348 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:28,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:34:28,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:28,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:28,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash -908394461, now seen corresponding path program 1 times [2024-10-10 22:34:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122855743] [2024-10-10 22:34:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:28,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:28,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122855743] [2024-10-10 22:34:28,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122855743] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:34:28,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006660966] [2024-10-10 22:34:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:28,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:28,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:28,861 INFO L229 MonitoredProcess]: Starting monitored process 3 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 22:34:28,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:34:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:28,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:34:28,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:34:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:34:29,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:34:29,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006660966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:29,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:34:29,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:34:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945711695] [2024-10-10 22:34:29,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:29,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:29,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:34:29,119 INFO L87 Difference]: Start difference. First operand 789 states and 929 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 22:34:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:29,687 INFO L93 Difference]: Finished difference Result 2363 states and 2784 transitions. [2024-10-10 22:34:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 122 [2024-10-10 22:34:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:29,691 INFO L225 Difference]: With dead ends: 2363 [2024-10-10 22:34:29,691 INFO L226 Difference]: Without dead ends: 1444 [2024-10-10 22:34:29,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:34:29,693 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:29,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 186 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:34:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-10-10 22:34:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2024-10-10 22:34:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.1552321552321552) internal successors, (1667), 1443 states have internal predecessors, (1667), 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 22:34:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1667 transitions. [2024-10-10 22:34:29,710 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1667 transitions. Word has length 122 [2024-10-10 22:34:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:29,711 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1667 transitions. [2024-10-10 22:34:29,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 22:34:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1667 transitions. [2024-10-10 22:34:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-10 22:34:29,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:29,713 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:29,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:34:29,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:29,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:29,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 872563878, now seen corresponding path program 1 times [2024-10-10 22:34:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:29,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96142162] [2024-10-10 22:34:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:34:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96142162] [2024-10-10 22:34:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96142162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:30,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:30,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896265709] [2024-10-10 22:34:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:30,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:30,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:30,021 INFO L87 Difference]: Start difference. First operand 1444 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:30,550 INFO L93 Difference]: Finished difference Result 3018 states and 3502 transitions. [2024-10-10 22:34:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-10 22:34:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:30,555 INFO L225 Difference]: With dead ends: 3018 [2024-10-10 22:34:30,555 INFO L226 Difference]: Without dead ends: 1706 [2024-10-10 22:34:30,556 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 22:34:30,557 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 105 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:30,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 42 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:34:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-10 22:34:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2024-10-10 22:34:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.1407624633431086) internal successors, (1945), 1705 states have internal predecessors, (1945), 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 22:34:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 1945 transitions. [2024-10-10 22:34:30,578 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 1945 transitions. Word has length 139 [2024-10-10 22:34:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:30,578 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 1945 transitions. [2024-10-10 22:34:30,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 1945 transitions. [2024-10-10 22:34:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-10 22:34:30,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:30,581 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:30,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:34:30,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:30,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 652307652, now seen corresponding path program 1 times [2024-10-10 22:34:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434436639] [2024-10-10 22:34:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:34:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434436639] [2024-10-10 22:34:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434436639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:30,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:30,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:30,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523985484] [2024-10-10 22:34:30,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:30,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:30,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:30,651 INFO L87 Difference]: Start difference. First operand 1706 states and 1945 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 22:34:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:31,197 INFO L93 Difference]: Finished difference Result 3804 states and 4352 transitions. [2024-10-10 22:34:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:31,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 148 [2024-10-10 22:34:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:31,209 INFO L225 Difference]: With dead ends: 3804 [2024-10-10 22:34:31,209 INFO L226 Difference]: Without dead ends: 2230 [2024-10-10 22:34:31,211 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 22:34:31,215 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 131 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:31,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 21 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:34:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2024-10-10 22:34:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1968. [2024-10-10 22:34:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.1403152008134214) internal successors, (2243), 1967 states have internal predecessors, (2243), 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 22:34:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2243 transitions. [2024-10-10 22:34:31,268 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2243 transitions. Word has length 148 [2024-10-10 22:34:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2243 transitions. [2024-10-10 22:34:31,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 22:34:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2243 transitions. [2024-10-10 22:34:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-10 22:34:31,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:31,275 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:31,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:34:31,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:31,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1212405259, now seen corresponding path program 1 times [2024-10-10 22:34:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:31,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080455562] [2024-10-10 22:34:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:34:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:31,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080455562] [2024-10-10 22:34:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080455562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:31,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:31,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269725518] [2024-10-10 22:34:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:31,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:34:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:31,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:34:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:34:31,557 INFO L87 Difference]: Start difference. First operand 1968 states and 2243 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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 22:34:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:32,360 INFO L93 Difference]: Finished difference Result 4066 states and 4650 transitions. [2024-10-10 22:34:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:34:32,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2024-10-10 22:34:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:32,369 INFO L225 Difference]: With dead ends: 4066 [2024-10-10 22:34:32,373 INFO L226 Difference]: Without dead ends: 2230 [2024-10-10 22:34:32,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:34:32,379 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 250 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:32,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 46 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:34:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2024-10-10 22:34:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2099. [2024-10-10 22:34:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.1325071496663488) internal successors, (2376), 2098 states have internal predecessors, (2376), 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 22:34:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2376 transitions. [2024-10-10 22:34:32,435 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2376 transitions. Word has length 154 [2024-10-10 22:34:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:32,436 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2376 transitions. [2024-10-10 22:34:32,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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 22:34:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2376 transitions. [2024-10-10 22:34:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-10 22:34:32,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:32,439 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, 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] [2024-10-10 22:34:32,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:34:32,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:32,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 522118198, now seen corresponding path program 1 times [2024-10-10 22:34:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:32,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451177199] [2024-10-10 22:34:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:32,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:32,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451177199] [2024-10-10 22:34:32,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451177199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:34:32,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86178515] [2024-10-10 22:34:32,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:32,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:32,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:32,597 INFO L229 MonitoredProcess]: Starting monitored process 4 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 22:34:32,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:34:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:32,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:34:32,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:34:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-10 22:34:32,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:34:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86178515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:32,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:34:32,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:34:32,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372338703] [2024-10-10 22:34:32,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:32,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:32,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:32,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:34:32,854 INFO L87 Difference]: Start difference. First operand 2099 states and 2376 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 22:34:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:33,322 INFO L93 Difference]: Finished difference Result 4721 states and 5396 transitions. [2024-10-10 22:34:33,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:33,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 172 [2024-10-10 22:34:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:33,333 INFO L225 Difference]: With dead ends: 4721 [2024-10-10 22:34:33,333 INFO L226 Difference]: Without dead ends: 2754 [2024-10-10 22:34:33,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:34:33,339 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:33,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 175 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2024-10-10 22:34:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2099. [2024-10-10 22:34:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.1205910390848428) internal successors, (2351), 2098 states have internal predecessors, (2351), 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 22:34:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2351 transitions. [2024-10-10 22:34:33,388 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2351 transitions. Word has length 172 [2024-10-10 22:34:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:33,389 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2351 transitions. [2024-10-10 22:34:33,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 22:34:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2351 transitions. [2024-10-10 22:34:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-10 22:34:33,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:33,393 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2024-10-10 22:34:33,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:34:33,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:33,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:33,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1549937323, now seen corresponding path program 1 times [2024-10-10 22:34:33,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:33,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989554833] [2024-10-10 22:34:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:33,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-10 22:34:33,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989554833] [2024-10-10 22:34:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989554833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:33,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:33,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:33,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345064958] [2024-10-10 22:34:33,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:33,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:34:33,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:33,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:34:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:34:33,762 INFO L87 Difference]: Start difference. First operand 2099 states and 2351 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:34,317 INFO L93 Difference]: Finished difference Result 4590 states and 5162 transitions. [2024-10-10 22:34:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:34:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2024-10-10 22:34:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:34,324 INFO L225 Difference]: With dead ends: 4590 [2024-10-10 22:34:34,325 INFO L226 Difference]: Without dead ends: 2623 [2024-10-10 22:34:34,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:34:34,327 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 220 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:34,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 40 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:34:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-10-10 22:34:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2361. [2024-10-10 22:34:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.1148305084745762) internal successors, (2631), 2360 states have internal predecessors, (2631), 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 22:34:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 2631 transitions. [2024-10-10 22:34:34,362 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 2631 transitions. Word has length 219 [2024-10-10 22:34:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:34,362 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 2631 transitions. [2024-10-10 22:34:34,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 2631 transitions. [2024-10-10 22:34:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-10 22:34:34,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:34,366 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:34:34,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:34:34,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:34,367 INFO L85 PathProgramCache]: Analyzing trace with hash 579159894, now seen corresponding path program 1 times [2024-10-10 22:34:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425703535] [2024-10-10 22:34:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 120 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-10 22:34:34,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:34,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425703535] [2024-10-10 22:34:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425703535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:34:34,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641021732] [2024-10-10 22:34:34,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:34,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:34,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:34,569 INFO L229 MonitoredProcess]: Starting monitored process 5 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 22:34:34,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:34:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:34,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:34:34,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:34:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-10 22:34:34,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:34:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641021732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:34,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:34:34,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:34:34,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612607846] [2024-10-10 22:34:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:34:34,818 INFO L87 Difference]: Start difference. First operand 2361 states and 2631 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:35,117 INFO L93 Difference]: Finished difference Result 4850 states and 5425 transitions. [2024-10-10 22:34:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:35,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2024-10-10 22:34:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:35,118 INFO L225 Difference]: With dead ends: 4850 [2024-10-10 22:34:35,118 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:34:35,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:34:35,122 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:35,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 162 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:34:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:34:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:34:35,124 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 22:34:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:34:35,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2024-10-10 22:34:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:35,124 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:34:35,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:34:35,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:34:35,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:34:35,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:34:35,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 22:34:35,335 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:35,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:34:35,587 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:34:35,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:34:35 BoogieIcfgContainer [2024-10-10 22:34:35,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:34:35,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:34:35,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:34:35,601 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:34:35,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:23" (3/4) ... [2024-10-10 22:34:35,606 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:34:35,622 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:34:35,627 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:34:35,627 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:34:35,632 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:34:35,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:34:35,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:34:35,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:34:35,773 INFO L158 Benchmark]: Toolchain (without parser) took 13591.55ms. Allocated memory was 218.1MB in the beginning and 388.0MB in the end (delta: 169.9MB). Free memory was 144.8MB in the beginning and 183.4MB in the end (delta: -38.6MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:35,774 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 77.1MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:34:35,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.22ms. Allocated memory is still 218.1MB. Free memory was 144.8MB in the beginning and 115.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-10 22:34:35,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.94ms. Allocated memory is still 218.1MB. Free memory was 115.5MB in the beginning and 109.5MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:35,775 INFO L158 Benchmark]: Boogie Preprocessor took 66.29ms. Allocated memory is still 218.1MB. Free memory was 109.5MB in the beginning and 104.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:35,775 INFO L158 Benchmark]: RCFGBuilder took 1089.97ms. Allocated memory is still 218.1MB. Free memory was 103.9MB in the beginning and 99.8MB in the end (delta: 4.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-10 22:34:35,776 INFO L158 Benchmark]: TraceAbstraction took 11720.38ms. Allocated memory was 218.1MB in the beginning and 388.0MB in the end (delta: 169.9MB). Free memory was 99.7MB in the beginning and 196.0MB in the end (delta: -96.3MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. [2024-10-10 22:34:35,776 INFO L158 Benchmark]: Witness Printer took 172.69ms. Allocated memory is still 388.0MB. Free memory was 196.0MB in the beginning and 183.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:34:35,777 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.14ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 77.1MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.22ms. Allocated memory is still 218.1MB. Free memory was 144.8MB in the beginning and 115.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.94ms. Allocated memory is still 218.1MB. Free memory was 115.5MB in the beginning and 109.5MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.29ms. Allocated memory is still 218.1MB. Free memory was 109.5MB in the beginning and 104.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1089.97ms. Allocated memory is still 218.1MB. Free memory was 103.9MB in the beginning and 99.8MB in the end (delta: 4.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11720.38ms. Allocated memory was 218.1MB in the beginning and 388.0MB in the end (delta: 169.9MB). Free memory was 99.7MB in the beginning and 196.0MB in the end (delta: -96.3MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. * Witness Printer took 172.69ms. Allocated memory is still 388.0MB. Free memory was 196.0MB in the beginning and 183.4MB in the end (delta: 12.5MB). 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: 504]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1161 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1161 mSDsluCounter, 1183 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4346 IncrementalHoareTripleChecker+Invalid, 4834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 488 mSolverCounterUnsat, 1113 mSDtfsCounter, 4346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2361occurred in iteration=11, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1572 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2385 NumberOfCodeBlocks, 2385 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2369 ConstructedInterpolants, 0 QuantifiedInterpolants, 6969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1213 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 970/1011 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: 593]: Loop Invariant Derived loop invariant: ((((((((((a16 <= 4) && (a20 == 1)) || ((a20 <= 0) && (15 <= a8))) || ((a20 <= 0) && (a16 <= 5))) || ((a7 == 1) && (a16 <= 5))) || (((((a8 <= 13) && (a12 == 8)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((a8 <= 13) && (a7 == 1))) || (((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((a20 == 1) && (15 <= a8))) || ((a8 <= 13) && (a16 <= 4))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:34:35,803 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