./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aec3d6b735697765f122fd4969787ab3e5c22f1789977e4ce823d6b216b50af2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:33:35,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:33:36,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:33:36,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:33:36,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:33:36,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:33:36,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:33:36,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:33:36,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:33:36,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:33:36,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:33:36,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:33:36,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:33:36,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:33:36,043 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:33:36,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:33:36,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:33:36,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:33:36,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:33:36,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:33:36,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:33:36,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:33:36,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:33:36,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:33:36,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:33:36,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:33:36,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:33:36,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:33:36,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:33:36,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:33:36,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:33:36,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:33:36,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:33:36,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:33:36,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:33:36,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:33:36,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:33:36,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:33:36,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:33:36,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:33:36,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:33:36,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:33:36,055 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 -> aec3d6b735697765f122fd4969787ab3e5c22f1789977e4ce823d6b216b50af2 [2024-10-10 23:33:36,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:33:36,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:33:36,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:33:36,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:33:36,386 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:33:36,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c [2024-10-10 23:33:37,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:33:38,017 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:33:38,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c [2024-10-10 23:33:38,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a8b9e1daa/3cde25df50064c398f04ff5b49f380b1/FLAG8580a0afa [2024-10-10 23:33:38,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a8b9e1daa/3cde25df50064c398f04ff5b49f380b1 [2024-10-10 23:33:38,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:33:38,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:33:38,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:33:38,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:33:38,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:33:38,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5843f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38, skipping insertion in model container [2024-10-10 23:33:38,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:33:38,299 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c[5937,5950] [2024-10-10 23:33:38,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:33:38,427 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:33:38,464 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c[5937,5950] [2024-10-10 23:33:38,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:33:38,696 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:33:38,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38 WrapperNode [2024-10-10 23:33:38,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:33:38,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:33:38,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:33:38,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:33:38,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,783 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:33:38,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:33:38,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:33:38,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:33:38,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:33:38,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,833 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:33:38,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:33:38,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:33:38,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:33:38,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:33:38,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (1/1) ... [2024-10-10 23:33:38,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:33:38,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:38,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:33:38,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:33:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:33:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:33:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:33:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:33:39,041 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:33:39,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:33:39,914 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:33:39,915 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:33:39,994 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:33:39,994 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:33:39,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:39 BoogieIcfgContainer [2024-10-10 23:33:39,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:33:39,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:33:39,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:33:39,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:33:39,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:33:38" (1/3) ... [2024-10-10 23:33:40,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e785cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:33:39, skipping insertion in model container [2024-10-10 23:33:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:38" (2/3) ... [2024-10-10 23:33:40,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e785cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:33:40, skipping insertion in model container [2024-10-10 23:33:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:39" (3/3) ... [2024-10-10 23:33:40,002 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label33.c [2024-10-10 23:33:40,016 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:33:40,016 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:33:40,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:33:40,076 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;@4bbe2549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:33:40,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:33:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 23:33:40,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:40,096 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] [2024-10-10 23:33:40,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:40,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash -531067996, now seen corresponding path program 1 times [2024-10-10 23:33:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541890696] [2024-10-10 23:33:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541890696] [2024-10-10 23:33:40,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541890696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:40,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:40,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:33:40,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510699828] [2024-10-10 23:33:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:40,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:33:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:40,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:33:40,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:33:40,298 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:40,329 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:33:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:33:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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 57 [2024-10-10 23:33:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:40,341 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:33:40,342 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:33:40,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:33:40,347 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:40,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:33:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:33:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:33:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:33:40,385 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 57 [2024-10-10 23:33:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:40,385 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:33:40,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:33:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 23:33:40,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:40,387 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] [2024-10-10 23:33:40,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:33:40,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:40,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash -260997874, now seen corresponding path program 1 times [2024-10-10 23:33:40,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:40,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510568951] [2024-10-10 23:33:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510568951] [2024-10-10 23:33:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510568951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:33:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437690306] [2024-10-10 23:33:40,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:40,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:40,574 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:41,262 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-10 23:33:41,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:41,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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 57 [2024-10-10 23:33:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:41,265 INFO L225 Difference]: With dead ends: 539 [2024-10-10 23:33:41,265 INFO L226 Difference]: Without dead ends: 359 [2024-10-10 23:33:41,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:41,270 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 124 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:41,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 51 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-10 23:33:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-10 23:33:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.5223463687150838) internal successors, (545), 358 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2024-10-10 23:33:41,304 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 57 [2024-10-10 23:33:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:41,304 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2024-10-10 23:33:41,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2024-10-10 23:33:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-10 23:33:41,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:41,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:41,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:33:41,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash 953137571, now seen corresponding path program 1 times [2024-10-10 23:33:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375527856] [2024-10-10 23:33:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:41,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:41,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375527856] [2024-10-10 23:33:41,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375527856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:41,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:41,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:33:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247288886] [2024-10-10 23:33:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:41,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:41,711 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:42,535 INFO L93 Difference]: Finished difference Result 1073 states and 1632 transitions. [2024-10-10 23:33:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2024-10-10 23:33:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:42,538 INFO L225 Difference]: With dead ends: 1073 [2024-10-10 23:33:42,539 INFO L226 Difference]: Without dead ends: 715 [2024-10-10 23:33:42,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:42,545 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:42,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 93 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:33:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-10 23:33:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-10 23:33:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2024-10-10 23:33:42,590 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 132 [2024-10-10 23:33:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:42,591 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2024-10-10 23:33:42,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2024-10-10 23:33:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-10 23:33:42,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:42,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:33:42,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:42,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1541307673, now seen corresponding path program 1 times [2024-10-10 23:33:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136815609] [2024-10-10 23:33:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136815609] [2024-10-10 23:33:43,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136815609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:43,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:43,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995636885] [2024-10-10 23:33:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:43,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:43,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:43,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:43,060 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:43,864 INFO L93 Difference]: Finished difference Result 1963 states and 2569 transitions. [2024-10-10 23:33:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2024-10-10 23:33:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:43,868 INFO L225 Difference]: With dead ends: 1963 [2024-10-10 23:33:43,868 INFO L226 Difference]: Without dead ends: 1249 [2024-10-10 23:33:43,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:43,871 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:43,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:33:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-10 23:33:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-10-10 23:33:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.236378205128205) internal successors, (1543), 1248 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1543 transitions. [2024-10-10 23:33:43,892 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1543 transitions. Word has length 136 [2024-10-10 23:33:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:43,892 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1543 transitions. [2024-10-10 23:33:43,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1543 transitions. [2024-10-10 23:33:43,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-10 23:33:43,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:43,895 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:33:43,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:33:43,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:43,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1739105939, now seen corresponding path program 1 times [2024-10-10 23:33:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:43,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641815204] [2024-10-10 23:33:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-10 23:33:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641815204] [2024-10-10 23:33:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641815204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:44,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:44,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276072547] [2024-10-10 23:33:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:44,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:44,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:44,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:44,265 INFO L87 Difference]: Start difference. First operand 1249 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:44,970 INFO L93 Difference]: Finished difference Result 2704 states and 3352 transitions. [2024-10-10 23:33:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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 216 [2024-10-10 23:33:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:44,975 INFO L225 Difference]: With dead ends: 2704 [2024-10-10 23:33:44,975 INFO L226 Difference]: Without dead ends: 1605 [2024-10-10 23:33:44,976 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 23:33:44,976 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:44,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 117 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-10 23:33:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-10-10 23:33:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1221945137157108) internal successors, (1800), 1604 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1800 transitions. [2024-10-10 23:33:45,001 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1800 transitions. Word has length 216 [2024-10-10 23:33:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:45,001 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1800 transitions. [2024-10-10 23:33:45,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1800 transitions. [2024-10-10 23:33:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-10 23:33:45,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:45,004 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:33:45,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:45,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1059775836, now seen corresponding path program 1 times [2024-10-10 23:33:45,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:45,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461139621] [2024-10-10 23:33:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 215 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:33:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461139621] [2024-10-10 23:33:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461139621] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247212037] [2024-10-10 23:33:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:45,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:45,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:45,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:45,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:33:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:45,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:45,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:33:45,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247212037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:33:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850291055] [2024-10-10 23:33:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:45,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:45,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:45,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:45,611 INFO L87 Difference]: Start difference. First operand 1605 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:46,301 INFO L93 Difference]: Finished difference Result 3387 states and 3900 transitions. [2024-10-10 23:33:46,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:46,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 343 [2024-10-10 23:33:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:46,309 INFO L225 Difference]: With dead ends: 3387 [2024-10-10 23:33:46,311 INFO L226 Difference]: Without dead ends: 1961 [2024-10-10 23:33:46,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:46,314 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:46,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 251 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-10 23:33:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1961. [2024-10-10 23:33:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.1321428571428571) internal successors, (2219), 1960 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2219 transitions. [2024-10-10 23:33:46,337 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2219 transitions. Word has length 343 [2024-10-10 23:33:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:46,338 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2219 transitions. [2024-10-10 23:33:46,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2219 transitions. [2024-10-10 23:33:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-10 23:33:46,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:46,341 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:46,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:46,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:46,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:46,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1336314470, now seen corresponding path program 1 times [2024-10-10 23:33:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:46,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624571903] [2024-10-10 23:33:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:46,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:33:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624571903] [2024-10-10 23:33:46,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624571903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:46,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:46,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609296566] [2024-10-10 23:33:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:46,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:46,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:46,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:46,814 INFO L87 Difference]: Start difference. First operand 1961 states and 2219 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:47,199 INFO L93 Difference]: Finished difference Result 4099 states and 4688 transitions. [2024-10-10 23:33:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:47,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 347 [2024-10-10 23:33:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:47,206 INFO L225 Difference]: With dead ends: 4099 [2024-10-10 23:33:47,206 INFO L226 Difference]: Without dead ends: 2317 [2024-10-10 23:33:47,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:47,210 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:47,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 56 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-10-10 23:33:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2317. [2024-10-10 23:33:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.1278065630397236) internal successors, (2612), 2316 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2612 transitions. [2024-10-10 23:33:47,236 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2612 transitions. Word has length 347 [2024-10-10 23:33:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:47,237 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2612 transitions. [2024-10-10 23:33:47,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2612 transitions. [2024-10-10 23:33:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-10 23:33:47,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:47,240 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:47,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:33:47,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:47,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:47,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1220392436, now seen corresponding path program 1 times [2024-10-10 23:33:47,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:47,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075124671] [2024-10-10 23:33:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:47,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 222 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:33:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075124671] [2024-10-10 23:33:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075124671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745338872] [2024-10-10 23:33:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:47,593 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 23:33:47,594 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 23:33:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:47,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:47,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-10-10 23:33:48,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745338872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 23:33:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058625375] [2024-10-10 23:33:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:48,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:48,248 INFO L87 Difference]: Start difference. First operand 2317 states and 2612 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:48,761 INFO L93 Difference]: Finished difference Result 4989 states and 5717 transitions. [2024-10-10 23:33:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:48,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 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 350 [2024-10-10 23:33:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:48,768 INFO L225 Difference]: With dead ends: 4989 [2024-10-10 23:33:48,768 INFO L226 Difference]: Without dead ends: 2851 [2024-10-10 23:33:48,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:48,774 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:48,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 45 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-10 23:33:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2673. [2024-10-10 23:33:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.1126497005988023) internal successors, (2973), 2672 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2973 transitions. [2024-10-10 23:33:48,809 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2973 transitions. Word has length 350 [2024-10-10 23:33:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:48,810 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2973 transitions. [2024-10-10 23:33:48,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2973 transitions. [2024-10-10 23:33:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-10-10 23:33:48,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:48,814 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-10-10 23:33:48,827 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 23:33:49,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:49,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:49,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1794301128, now seen corresponding path program 1 times [2024-10-10 23:33:49,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:49,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035815048] [2024-10-10 23:33:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:33:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035815048] [2024-10-10 23:33:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035815048] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907936270] [2024-10-10 23:33:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:49,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:49,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:49,302 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 23:33:49,303 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 23:33:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:49,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:49,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:49,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907936270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:33:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132232065] [2024-10-10 23:33:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:49,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:49,466 INFO L87 Difference]: Start difference. First operand 2673 states and 2973 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:49,897 INFO L93 Difference]: Finished difference Result 5701 states and 6437 transitions. [2024-10-10 23:33:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:49,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 374 [2024-10-10 23:33:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:49,905 INFO L225 Difference]: With dead ends: 5701 [2024-10-10 23:33:49,905 INFO L226 Difference]: Without dead ends: 3207 [2024-10-10 23:33:49,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:49,910 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:49,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 65 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2024-10-10 23:33:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2851. [2024-10-10 23:33:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.1164912280701755) internal successors, (3182), 2850 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3182 transitions. [2024-10-10 23:33:49,945 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3182 transitions. Word has length 374 [2024-10-10 23:33:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:49,945 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3182 transitions. [2024-10-10 23:33:49,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3182 transitions. [2024-10-10 23:33:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-10-10 23:33:49,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:49,949 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:49,964 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 23:33:50,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:50,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:50,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:50,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1766922043, now seen corresponding path program 1 times [2024-10-10 23:33:50,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:50,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921562148] [2024-10-10 23:33:50,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:50,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:50,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:50,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921562148] [2024-10-10 23:33:50,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921562148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:50,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:50,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022073486] [2024-10-10 23:33:50,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:50,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:50,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:50,318 INFO L87 Difference]: Start difference. First operand 2851 states and 3182 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:50,740 INFO L93 Difference]: Finished difference Result 3921 states and 4447 transitions. [2024-10-10 23:33:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:50,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2024-10-10 23:33:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:50,749 INFO L225 Difference]: With dead ends: 3921 [2024-10-10 23:33:50,749 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:33:50,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:50,750 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:50,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 16 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:33:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3207. [2024-10-10 23:33:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.1384903306300687) internal successors, (3650), 3206 states have internal predecessors, (3650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3650 transitions. [2024-10-10 23:33:50,784 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3650 transitions. Word has length 381 [2024-10-10 23:33:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:50,784 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3650 transitions. [2024-10-10 23:33:50,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3650 transitions. [2024-10-10 23:33:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-10-10 23:33:50,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:50,787 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:50,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:33:50,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1857640466, now seen corresponding path program 1 times [2024-10-10 23:33:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186436038] [2024-10-10 23:33:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-10 23:33:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186436038] [2024-10-10 23:33:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186436038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203913102] [2024-10-10 23:33:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:51,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:51,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:51,117 INFO L87 Difference]: Start difference. First operand 3207 states and 3650 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:51,589 INFO L93 Difference]: Finished difference Result 6442 states and 7345 transitions. [2024-10-10 23:33:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 427 [2024-10-10 23:33:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:51,597 INFO L225 Difference]: With dead ends: 6442 [2024-10-10 23:33:51,597 INFO L226 Difference]: Without dead ends: 3385 [2024-10-10 23:33:51,599 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 23:33:51,599 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:51,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2024-10-10 23:33:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3207. [2024-10-10 23:33:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0995009357454772) internal successors, (3525), 3206 states have internal predecessors, (3525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3525 transitions. [2024-10-10 23:33:51,629 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3525 transitions. Word has length 427 [2024-10-10 23:33:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:51,629 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3525 transitions. [2024-10-10 23:33:51,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3525 transitions. [2024-10-10 23:33:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2024-10-10 23:33:51,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:51,632 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-10-10 23:33:51,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:33:51,632 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:51,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash 601935279, now seen corresponding path program 2 times [2024-10-10 23:33:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175774779] [2024-10-10 23:33:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 473 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-10 23:33:52,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:52,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175774779] [2024-10-10 23:33:52,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175774779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:52,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247433249] [2024-10-10 23:33:52,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 23:33:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:52,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:52,199 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 23:33:52,200 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 23:33:52,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 23:33:52,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 23:33:52,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:33:52,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:52,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247433249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:52,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:52,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:52,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282242666] [2024-10-10 23:33:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:52,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:52,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:52,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:33:52,767 INFO L87 Difference]: Start difference. First operand 3207 states and 3525 transitions. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:53,344 INFO L93 Difference]: Finished difference Result 7481 states and 8210 transitions. [2024-10-10 23:33:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:53,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 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 453 [2024-10-10 23:33:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:53,352 INFO L225 Difference]: With dead ends: 7481 [2024-10-10 23:33:53,352 INFO L226 Difference]: Without dead ends: 4453 [2024-10-10 23:33:53,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:33:53,355 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 190 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:53,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 13 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2024-10-10 23:33:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 3207. [2024-10-10 23:33:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0814098565190269) internal successors, (3467), 3206 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3467 transitions. [2024-10-10 23:33:53,415 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3467 transitions. Word has length 453 [2024-10-10 23:33:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:53,416 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3467 transitions. [2024-10-10 23:33:53,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3467 transitions. [2024-10-10 23:33:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-10-10 23:33:53,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:53,418 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:53,431 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 23:33:53,618 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 23:33:53,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:53,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1600945022, now seen corresponding path program 1 times [2024-10-10 23:33:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:53,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947189062] [2024-10-10 23:33:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:53,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:53,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947189062] [2024-10-10 23:33:53,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947189062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:53,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:53,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041403405] [2024-10-10 23:33:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:53,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:53,866 INFO L87 Difference]: Start difference. First operand 3207 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:54,258 INFO L93 Difference]: Finished difference Result 6947 states and 7542 transitions. [2024-10-10 23:33:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:54,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 460 [2024-10-10 23:33:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:54,265 INFO L225 Difference]: With dead ends: 6947 [2024-10-10 23:33:54,265 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:33:54,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:54,268 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 103 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:54,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 224 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:33:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3741. [2024-10-10 23:33:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0751336898395722) internal successors, (4021), 3740 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4021 transitions. [2024-10-10 23:33:54,301 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4021 transitions. Word has length 460 [2024-10-10 23:33:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:54,303 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4021 transitions. [2024-10-10 23:33:54,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4021 transitions. [2024-10-10 23:33:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-10-10 23:33:54,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:54,306 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:33:54,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:33:54,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:54,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1716759247, now seen corresponding path program 1 times [2024-10-10 23:33:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399719981] [2024-10-10 23:33:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 473 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-10 23:33:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399719981] [2024-10-10 23:33:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399719981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865926499] [2024-10-10 23:33:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:54,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:54,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:54,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:54,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:33:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:55,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:33:55,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-10-10 23:33:55,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:55,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865926499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:55,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:55,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 23:33:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045922614] [2024-10-10 23:33:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:55,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:55,985 INFO L87 Difference]: Start difference. First operand 3741 states and 4021 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:56,404 INFO L93 Difference]: Finished difference Result 7303 states and 7871 transitions. [2024-10-10 23:33:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:56,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 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 505 [2024-10-10 23:33:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:56,418 INFO L225 Difference]: With dead ends: 7303 [2024-10-10 23:33:56,424 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:33:56,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:56,432 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:56,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 46 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:33:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2024-10-10 23:33:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.065339458907606) internal successors, (4174), 3918 states have internal predecessors, (4174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4174 transitions. [2024-10-10 23:33:56,510 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4174 transitions. Word has length 505 [2024-10-10 23:33:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:56,510 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4174 transitions. [2024-10-10 23:33:56,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4174 transitions. [2024-10-10 23:33:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2024-10-10 23:33:56,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:56,518 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 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] [2024-10-10 23:33:56,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 23:33:56,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:33:56,719 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:56,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1938019861, now seen corresponding path program 1 times [2024-10-10 23:33:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:56,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227043661] [2024-10-10 23:33:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 861 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-10 23:33:56,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227043661] [2024-10-10 23:33:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227043661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35861860] [2024-10-10 23:33:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:56,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:56,934 INFO L87 Difference]: Start difference. First operand 3919 states and 4174 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:57,306 INFO L93 Difference]: Finished difference Result 8549 states and 9172 transitions. [2024-10-10 23:33:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:57,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 635 [2024-10-10 23:33:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:57,318 INFO L225 Difference]: With dead ends: 8549 [2024-10-10 23:33:57,319 INFO L226 Difference]: Without dead ends: 4987 [2024-10-10 23:33:57,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:57,325 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:57,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:33:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2024-10-10 23:33:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4809. [2024-10-10 23:33:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0630199667221298) internal successors, (5111), 4808 states have internal predecessors, (5111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5111 transitions. [2024-10-10 23:33:57,376 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5111 transitions. Word has length 635 [2024-10-10 23:33:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:57,376 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5111 transitions. [2024-10-10 23:33:57,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5111 transitions. [2024-10-10 23:33:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2024-10-10 23:33:57,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:57,384 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:33:57,384 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:57,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1122599052, now seen corresponding path program 1 times [2024-10-10 23:33:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585628898] [2024-10-10 23:33:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 1311 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-10 23:33:57,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:57,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585628898] [2024-10-10 23:33:57,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585628898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:57,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:57,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:57,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209995326] [2024-10-10 23:33:57,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:57,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:57,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:57,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:57,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:57,812 INFO L87 Difference]: Start difference. First operand 4809 states and 5111 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:58,154 INFO L93 Difference]: Finished difference Result 9439 states and 10042 transitions. [2024-10-10 23:33:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:58,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 760 [2024-10-10 23:33:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:58,162 INFO L225 Difference]: With dead ends: 9439 [2024-10-10 23:33:58,162 INFO L226 Difference]: Without dead ends: 4809 [2024-10-10 23:33:58,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:58,165 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:58,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 242 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:33:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2024-10-10 23:33:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4275. [2024-10-10 23:33:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.066916237716425) internal successors, (4560), 4274 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4560 transitions. [2024-10-10 23:33:58,194 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4560 transitions. Word has length 760 [2024-10-10 23:33:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:58,194 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4560 transitions. [2024-10-10 23:33:58,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4560 transitions. [2024-10-10 23:33:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2024-10-10 23:33:58,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:58,199 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:58,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:33:58,200 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:58,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1314668678, now seen corresponding path program 1 times [2024-10-10 23:33:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569728481] [2024-10-10 23:33:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 1334 proven. 155 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-10 23:33:58,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:58,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569728481] [2024-10-10 23:33:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569728481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:58,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036577817] [2024-10-10 23:33:58,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:58,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:58,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:58,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:58,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 23:33:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:58,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:58,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-10-10 23:33:58,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036577817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:58,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:33:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613216081] [2024-10-10 23:33:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:58,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:58,841 INFO L87 Difference]: Start difference. First operand 4275 states and 4560 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:59,188 INFO L93 Difference]: Finished difference Result 6235 states and 6610 transitions. [2024-10-10 23:33:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:59,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 793 [2024-10-10 23:33:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:59,195 INFO L225 Difference]: With dead ends: 6235 [2024-10-10 23:33:59,199 INFO L226 Difference]: Without dead ends: 6233 [2024-10-10 23:33:59,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 793 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:59,200 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 143 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:59,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 9 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:33:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2024-10-10 23:33:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 4275. [2024-10-10 23:33:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.066916237716425) internal successors, (4560), 4274 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4560 transitions. [2024-10-10 23:33:59,293 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4560 transitions. Word has length 793 [2024-10-10 23:33:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:59,294 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4560 transitions. [2024-10-10 23:33:59,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4560 transitions. [2024-10-10 23:33:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2024-10-10 23:33:59,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:59,306 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:59,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 23:33:59,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 23:33:59,508 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:59,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 648763885, now seen corresponding path program 1 times [2024-10-10 23:33:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915510709] [2024-10-10 23:33:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 1424 proven. 155 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-10 23:33:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915510709] [2024-10-10 23:33:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915510709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:59,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509284947] [2024-10-10 23:33:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:59,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:59,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:59,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:33:59,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 23:33:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:59,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:34:00,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2024-10-10 23:34:00,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509284947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:00,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:00,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:34:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753569683] [2024-10-10 23:34:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:34:00,062 INFO L87 Difference]: Start difference. First operand 4275 states and 4560 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:00,404 INFO L93 Difference]: Finished difference Result 9793 states and 10431 transitions. [2024-10-10 23:34:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 811 [2024-10-10 23:34:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:00,406 INFO L225 Difference]: With dead ends: 9793 [2024-10-10 23:34:00,406 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:34:00,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:34:00,411 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 123 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:00,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 241 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:34:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:34:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:34:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:34:00,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 811 [2024-10-10 23:34:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:00,412 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:34:00,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:34:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:34:00,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:34:00,414 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:34:00,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 23:34:00,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 23:34:00,622 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:00,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:34:01,128 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:34:01,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:34:01 BoogieIcfgContainer [2024-10-10 23:34:01,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:34:01,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:34:01,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:34:01,144 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:34:01,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:39" (3/4) ... [2024-10-10 23:34:01,146 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:34:01,161 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:34:01,165 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:34:01,166 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:34:01,167 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:34:01,295 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:34:01,295 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:34:01,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:34:01,296 INFO L158 Benchmark]: Toolchain (without parser) took 23243.55ms. Allocated memory was 161.5MB in the beginning and 685.8MB in the end (delta: 524.3MB). Free memory was 90.7MB in the beginning and 266.7MB in the end (delta: -176.0MB). Peak memory consumption was 350.6MB. Max. memory is 16.1GB. [2024-10-10 23:34:01,296 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:34:01,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.08ms. Allocated memory is still 161.5MB. Free memory was 90.4MB in the beginning and 125.0MB in the end (delta: -34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-10 23:34:01,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.29ms. Allocated memory is still 161.5MB. Free memory was 125.0MB in the beginning and 115.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:34:01,297 INFO L158 Benchmark]: Boogie Preprocessor took 99.66ms. Allocated memory is still 161.5MB. Free memory was 115.2MB in the beginning and 102.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:34:01,297 INFO L158 Benchmark]: RCFGBuilder took 1110.80ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 119.5MB in the end (delta: -16.9MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-10-10 23:34:01,298 INFO L158 Benchmark]: TraceAbstraction took 21147.22ms. Allocated memory was 161.5MB in the beginning and 685.8MB in the end (delta: 524.3MB). Free memory was 119.5MB in the beginning and 281.4MB in the end (delta: -161.9MB). Peak memory consumption was 361.4MB. Max. memory is 16.1GB. [2024-10-10 23:34:01,298 INFO L158 Benchmark]: Witness Printer took 151.35ms. Allocated memory is still 685.8MB. Free memory was 281.4MB in the beginning and 266.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:34:01,299 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.52ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.08ms. Allocated memory is still 161.5MB. Free memory was 90.4MB in the beginning and 125.0MB in the end (delta: -34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.29ms. Allocated memory is still 161.5MB. Free memory was 125.0MB in the beginning and 115.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.66ms. Allocated memory is still 161.5MB. Free memory was 115.2MB in the beginning and 102.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1110.80ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 119.5MB in the end (delta: -16.9MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21147.22ms. Allocated memory was 161.5MB in the beginning and 685.8MB in the end (delta: 524.3MB). Free memory was 119.5MB in the beginning and 281.4MB in the end (delta: -161.9MB). Peak memory consumption was 361.4MB. Max. memory is 16.1GB. * Witness Printer took 151.35ms. Allocated memory is still 685.8MB. Free memory was 281.4MB in the beginning and 266.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 188]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2114 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2114 mSDsluCounter, 1953 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 1079 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8663 IncrementalHoareTripleChecker+Invalid, 9742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1079 mSolverCounterUnsat, 1870 mSDtfsCounter, 8663 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3682 GetRequests, 3640 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4809occurred in iteration=15, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 5518 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 10866 NumberOfCodeBlocks, 10866 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 10841 ConstructedInterpolants, 0 QuantifiedInterpolants, 31608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4599 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 18002/19131 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((((((long long) a12 + 43) <= 0) && (a21 <= 7)) && (a15 <= 5)) || ((7 <= a15) && (a24 == 1))) || ((a21 <= 9) && (a24 == 1))) || ((a24 == 1) && (81 <= a12))) || ((a24 == 1) && (a15 <= 5))) || ((a12 <= 11) && (a24 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:34:01,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE