./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array20_pattern.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/array-patterns/array20_pattern.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 4595fcce7ed27c87f4b36557925b67d85fd0fff83d482c199564b06ae0d3b884 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:13:46,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:13:46,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:13:46,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:13:46,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:13:46,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:13:46,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:13:46,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:13:46,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:13:46,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:13:46,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:13:46,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:13:46,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:13:46,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:13:46,774 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:13:46,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:13:46,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:13:46,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:13:46,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:13:46,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:13:46,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:13:46,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:13:46,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:13:46,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:13:46,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:13:46,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:13:46,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:13:46,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:13:46,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:13:46,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:13:46,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:13:46,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:13:46,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:13:46,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:13:46,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:13:46,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:13:46,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:13:46,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:13:46,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:13:46,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:13:46,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:13:46,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:13:46,789 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 -> 4595fcce7ed27c87f4b36557925b67d85fd0fff83d482c199564b06ae0d3b884 [2024-10-10 22:13:47,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:13:47,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:13:47,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:13:47,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:13:47,058 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:13:47,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array20_pattern.c [2024-10-10 22:13:48,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:13:48,708 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:13:48,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array20_pattern.c [2024-10-10 22:13:48,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86ac10629/3a4a262ef65f477da51a3cc3cbbea1d2/FLAG56dcda231 [2024-10-10 22:13:48,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86ac10629/3a4a262ef65f477da51a3cc3cbbea1d2 [2024-10-10 22:13:48,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:13:48,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:13:48,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:13:48,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:13:48,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:13:48,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:13:48" (1/1) ... [2024-10-10 22:13:48,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46da1e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:48, skipping insertion in model container [2024-10-10 22:13:48,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:13:48" (1/1) ... [2024-10-10 22:13:48,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:13:48,941 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/array-patterns/array20_pattern.c[1444,1457] [2024-10-10 22:13:48,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:13:48,967 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:13:48,977 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/array-patterns/array20_pattern.c[1444,1457] [2024-10-10 22:13:48,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:13:49,002 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:13:49,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49 WrapperNode [2024-10-10 22:13:49,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:13:49,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:13:49,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:13:49,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:13:49,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,037 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2024-10-10 22:13:49,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:13:49,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:13:49,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:13:49,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:13:49,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,071 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-10-10 22:13:49,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:13:49,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:13:49,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:13:49,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:13:49,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (1/1) ... [2024-10-10 22:13:49,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:13:49,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:13:49,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:13:49,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:13:49,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:13:49,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-10 22:13:49,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-10 22:13:49,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:13:49,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:13:49,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:13:49,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:13:49,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:13:49,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:13:49,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:13:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:13:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:13:49,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:13:49,282 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:13:49,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:13:49,518 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-10 22:13:49,518 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:13:49,557 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:13:49,558 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-10 22:13:49,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:13:49 BoogieIcfgContainer [2024-10-10 22:13:49,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:13:49,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:13:49,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:13:49,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:13:49,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:13:48" (1/3) ... [2024-10-10 22:13:49,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee76db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:13:49, skipping insertion in model container [2024-10-10 22:13:49,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:13:49" (2/3) ... [2024-10-10 22:13:49,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee76db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:13:49, skipping insertion in model container [2024-10-10 22:13:49,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:13:49" (3/3) ... [2024-10-10 22:13:49,570 INFO L112 eAbstractionObserver]: Analyzing ICFG array20_pattern.c [2024-10-10 22:13:49,586 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:13:49,587 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:13:49,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:13:49,661 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;@4e2f8645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:13:49,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:13:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:13:49,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-10 22:13:49,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:13:49,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:13:49,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:13:49,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:13:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1876061686, now seen corresponding path program 1 times [2024-10-10 22:13:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:13:49,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015661618] [2024-10-10 22:13:49,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:13:49,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:13:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:49,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:13:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:13:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:13:49,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015661618] [2024-10-10 22:13:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015661618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:13:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:13:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:13:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148595468] [2024-10-10 22:13:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:13:49,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:13:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:13:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:13:49,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:13:49,903 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:13:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:13:49,935 INFO L93 Difference]: Finished difference Result 54 states and 88 transitions. [2024-10-10 22:13:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:13:49,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-10 22:13:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:13:49,943 INFO L225 Difference]: With dead ends: 54 [2024-10-10 22:13:49,943 INFO L226 Difference]: Without dead ends: 26 [2024-10-10 22:13:49,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:13:49,952 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:13:49,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:13:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-10 22:13:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-10 22:13:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:13:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-10 22:13:49,983 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 14 [2024-10-10 22:13:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:13:49,983 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-10 22:13:49,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:13:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-10 22:13:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 22:13:49,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:13:49,985 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:13:49,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:13:49,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:13:49,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:13:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash -364244922, now seen corresponding path program 1 times [2024-10-10 22:13:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:13:49,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853921498] [2024-10-10 22:13:49,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:13:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:13:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:13:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-10 22:13:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 22:13:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:13:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:13:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853921498] [2024-10-10 22:13:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853921498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:13:50,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:13:50,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:13:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410036598] [2024-10-10 22:13:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:13:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:13:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:13:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:13:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:13:50,415 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:13:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:13:50,446 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-10-10 22:13:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:13:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-10-10 22:13:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:13:50,448 INFO L225 Difference]: With dead ends: 33 [2024-10-10 22:13:50,449 INFO L226 Difference]: Without dead ends: 29 [2024-10-10 22:13:50,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:13:50,451 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:13:50,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:13:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-10 22:13:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-10 22:13:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:13:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-10 22:13:50,462 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 29 [2024-10-10 22:13:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:13:50,463 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-10 22:13:50,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:13:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-10 22:13:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 22:13:50,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:13:50,465 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:13:50,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:13:50,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:13:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:13:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -315688640, now seen corresponding path program 1 times [2024-10-10 22:13:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:13:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628901524] [2024-10-10 22:13:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:13:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:13:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:13:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-10 22:13:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 22:13:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:13:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:13:50,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628901524] [2024-10-10 22:13:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628901524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:13:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:13:50,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:13:50,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81976628] [2024-10-10 22:13:50,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:13:50,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:13:50,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:13:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:13:50,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:13:50,686 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:13:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:13:50,799 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-10-10 22:13:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:13:50,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-10-10 22:13:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:13:50,802 INFO L225 Difference]: With dead ends: 61 [2024-10-10 22:13:50,802 INFO L226 Difference]: Without dead ends: 37 [2024-10-10 22:13:50,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 22:13:50,805 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:13:50,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:13:50,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-10 22:13:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2024-10-10 22:13:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:13:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-10-10 22:13:50,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 33 [2024-10-10 22:13:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:13:50,818 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-10-10 22:13:50,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:13:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-10-10 22:13:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 22:13:50,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:13:50,820 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:13:50,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:13:50,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:13:50,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:13:50,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1044441326, now seen corresponding path program 1 times [2024-10-10 22:13:50,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:13:50,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744456334] [2024-10-10 22:13:50,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:13:50,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:13:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:13:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-10 22:13:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:13:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:13:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:13:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744456334] [2024-10-10 22:13:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744456334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:13:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:13:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:13:50,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505251536] [2024-10-10 22:13:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:13:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:13:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:13:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:13:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:13:50,979 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:13:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:13:51,022 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-10-10 22:13:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:13:51,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-10 22:13:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:13:51,024 INFO L225 Difference]: With dead ends: 60 [2024-10-10 22:13:51,024 INFO L226 Difference]: Without dead ends: 34 [2024-10-10 22:13:51,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:13:51,026 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:13:51,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:13:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-10 22:13:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-10-10 22:13:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:13:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-10-10 22:13:51,033 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 36 [2024-10-10 22:13:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:13:51,033 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-10 22:13:51,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:13:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-10-10 22:13:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 22:13:51,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:13:51,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:13:51,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:13:51,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:13:51,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:13:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash -313799821, now seen corresponding path program 1 times [2024-10-10 22:13:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:13:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741460002] [2024-10-10 22:13:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:13:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:13:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 22:13:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214367397] [2024-10-10 22:13:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:13:51,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:13:51,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:13:51,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:13:51,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:13:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:13:51,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-10 22:13:51,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:13:51,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-10 22:13:52,033 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-10-10 22:13:52,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2024-10-10 22:13:52,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-10 22:13:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:13:52,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:14:11,840 WARN L286 SmtUtils]: Spent 9.72s on a formula simplification. DAG size of input: 106 DAG size of output: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-10 22:14:19,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:14:19,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741460002] [2024-10-10 22:14:19,549 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-10 22:14:19,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214367397] [2024-10-10 22:14:19,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214367397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:14:19,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:14:19,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2024-10-10 22:14:19,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821856259] [2024-10-10 22:14:19,550 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-10 22:14:19,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-10 22:14:19,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:14:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-10 22:14:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2024-10-10 22:14:19,552 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:14:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:14:20,153 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2024-10-10 22:14:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-10 22:14:20,154 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2024-10-10 22:14:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:14:20,156 INFO L225 Difference]: With dead ends: 90 [2024-10-10 22:14:20,156 INFO L226 Difference]: Without dead ends: 66 [2024-10-10 22:14:20,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2024-10-10 22:14:20,158 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:14:20,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 162 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:14:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-10 22:14:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2024-10-10 22:14:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-10 22:14:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-10-10 22:14:20,168 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 37 [2024-10-10 22:14:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:14:20,169 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-10-10 22:14:20,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:14:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-10-10 22:14:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 22:14:20,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:14:20,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:14:20,184 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 22:14:20,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:14:20,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:14:20,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:14:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1324917071, now seen corresponding path program 1 times [2024-10-10 22:14:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:14:20,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028795537] [2024-10-10 22:14:20,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:14:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:14:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:14:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:14:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-10 22:14:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:14:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:14:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028795537] [2024-10-10 22:14:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028795537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:14:20,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:14:20,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:14:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504222065] [2024-10-10 22:14:20,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:14:20,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:14:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:14:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:14:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:14:20,425 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:14:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:14:20,465 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2024-10-10 22:14:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:14:20,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-10 22:14:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:14:20,467 INFO L225 Difference]: With dead ends: 81 [2024-10-10 22:14:20,479 INFO L226 Difference]: Without dead ends: 59 [2024-10-10 22:14:20,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:14:20,482 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:14:20,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:14:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-10 22:14:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-10-10 22:14:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-10 22:14:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-10-10 22:14:20,498 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 37 [2024-10-10 22:14:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:14:20,498 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-10-10 22:14:20,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:14:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-10-10 22:14:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 22:14:20,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:14:20,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:14:20,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:14:20,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:14:20,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:14:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1066751633, now seen corresponding path program 1 times [2024-10-10 22:14:20,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:14:20,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127655399] [2024-10-10 22:14:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:14:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:14:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:14:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:14:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-10 22:14:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:14:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:14:20,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127655399] [2024-10-10 22:14:20,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127655399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:14:20,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006038114] [2024-10-10 22:14:20,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:14:20,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:14:20,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:14:20,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:14:20,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:14:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:20,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-10 22:14:20,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:14:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:14:21,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:14:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 22:14:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006038114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:14:21,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:14:21,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 23 [2024-10-10 22:14:21,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355495734] [2024-10-10 22:14:21,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:14:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-10 22:14:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:14:21,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-10 22:14:21,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-10-10 22:14:21,315 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 23 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-10 22:14:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:14:21,890 INFO L93 Difference]: Finished difference Result 233 states and 308 transitions. [2024-10-10 22:14:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-10 22:14:21,890 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 37 [2024-10-10 22:14:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:14:21,893 INFO L225 Difference]: With dead ends: 233 [2024-10-10 22:14:21,893 INFO L226 Difference]: Without dead ends: 185 [2024-10-10 22:14:21,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2024-10-10 22:14:21,895 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 192 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:14:21,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 341 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:14:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-10 22:14:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 105. [2024-10-10 22:14:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 91 states have internal predecessors, (115), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-10 22:14:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-10-10 22:14:21,918 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 37 [2024-10-10 22:14:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:14:21,918 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-10-10 22:14:21,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-10 22:14:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-10-10 22:14:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:14:21,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:14:21,919 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:14:21,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:14:22,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:14:22,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:14:22,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:14:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash -957259103, now seen corresponding path program 2 times [2024-10-10 22:14:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:14:22,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818614015] [2024-10-10 22:14:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:14:22,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:14:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:22,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:14:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:14:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:22,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-10 22:14:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:14:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:14:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818614015] [2024-10-10 22:14:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818614015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:14:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506587933] [2024-10-10 22:14:22,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:14:22,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:14:22,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:14:22,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:14:22,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:14:22,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:14:22,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:14:22,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:14:22,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:14:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:14:22,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:14:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:14:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506587933] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:14:22,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:14:22,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-10 22:14:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656387808] [2024-10-10 22:14:22,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:14:22,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-10 22:14:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:14:22,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-10 22:14:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:14:22,536 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:14:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:14:22,964 INFO L93 Difference]: Finished difference Result 212 states and 275 transitions. [2024-10-10 22:14:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-10 22:14:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-10-10 22:14:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:14:22,966 INFO L225 Difference]: With dead ends: 212 [2024-10-10 22:14:22,966 INFO L226 Difference]: Without dead ends: 131 [2024-10-10 22:14:22,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2024-10-10 22:14:22,967 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:14:22,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 140 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:14:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-10 22:14:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-10-10 22:14:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 110 states have internal predecessors, (137), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-10 22:14:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2024-10-10 22:14:22,987 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 38 [2024-10-10 22:14:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:14:22,988 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2024-10-10 22:14:22,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:14:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2024-10-10 22:14:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-10 22:14:22,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:14:22,989 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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 22:14:22,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 22:14:23,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:14:23,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:14:23,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:14:23,191 INFO L85 PathProgramCache]: Analyzing trace with hash -715827731, now seen corresponding path program 3 times [2024-10-10 22:14:23,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:14:23,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754764039] [2024-10-10 22:14:23,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:14:23,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:14:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:14:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:14:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-10 22:14:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:14:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:14:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754764039] [2024-10-10 22:14:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754764039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:14:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798955442] [2024-10-10 22:14:23,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:14:23,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:14:23,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:14:23,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:14:23,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:14:23,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-10 22:14:23,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:14:23,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:14:23,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:14:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:14:23,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:14:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:14:23,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798955442] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:14:23,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:14:23,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-10-10 22:14:23,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778651225] [2024-10-10 22:14:23,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:14:23,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-10 22:14:23,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:14:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-10 22:14:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:14:23,679 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:14:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:14:23,886 INFO L93 Difference]: Finished difference Result 176 states and 211 transitions. [2024-10-10 22:14:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-10 22:14:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2024-10-10 22:14:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:14:23,888 INFO L225 Difference]: With dead ends: 176 [2024-10-10 22:14:23,888 INFO L226 Difference]: Without dead ends: 102 [2024-10-10 22:14:23,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:14:23,889 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:14:23,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 112 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:14:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-10 22:14:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-10-10 22:14:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.180722891566265) internal successors, (98), 83 states have internal predecessors, (98), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-10 22:14:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2024-10-10 22:14:23,909 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 41 [2024-10-10 22:14:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:14:23,910 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2024-10-10 22:14:23,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:14:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2024-10-10 22:14:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 22:14:23,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:14:23,911 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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 22:14:23,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:14:24,112 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,SelfDestructingSolverStorable8 [2024-10-10 22:14:24,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:14:24,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:14:24,113 INFO L85 PathProgramCache]: Analyzing trace with hash -47121920, now seen corresponding path program 4 times [2024-10-10 22:14:24,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:14:24,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164755509] [2024-10-10 22:14:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:14:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:14:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:24,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:14:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:24,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:14:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-10 22:14:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:14:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-10 22:14:24,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:14:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164755509] [2024-10-10 22:14:24,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164755509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:14:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606416189] [2024-10-10 22:14:24,222 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:14:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:14:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:14:24,224 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 22:14:24,225 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 22:14:24,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:14:24,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:14:24,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:14:24,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:14:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:14:24,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:14:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-10 22:14:24,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606416189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:14:24,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:14:24,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-10 22:14:24,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803092543] [2024-10-10 22:14:24,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:14:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:14:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:14:24,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:14:24,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:14:24,416 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:14:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:14:24,580 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2024-10-10 22:14:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:14:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-10-10 22:14:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:14:24,582 INFO L225 Difference]: With dead ends: 106 [2024-10-10 22:14:24,582 INFO L226 Difference]: Without dead ends: 100 [2024-10-10 22:14:24,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:14:24,583 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:14:24,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 201 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:14:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-10 22:14:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-10-10 22:14:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-10 22:14:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-10-10 22:14:24,603 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 43 [2024-10-10 22:14:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:14:24,603 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-10-10 22:14:24,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:14:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-10-10 22:14:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 22:14:24,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:14:24,607 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2024-10-10 22:14:24,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:14:24,810 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,SelfDestructingSolverStorable9 [2024-10-10 22:14:24,811 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:14:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:14:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1854788154, now seen corresponding path program 5 times [2024-10-10 22:14:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:14:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266045877] [2024-10-10 22:14:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:14:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:14:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 22:14:24,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400522748] [2024-10-10 22:14:24,846 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-10 22:14:24,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:14:24,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:14:24,847 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 22:14:24,851 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 22:14:25,093 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-10-10 22:14:25,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:14:25,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-10-10 22:14:25,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:14:25,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-10 22:14:25,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-10 22:14:25,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:14:25,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-10 22:14:25,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:14:25,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-10 22:14:26,270 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-10 22:14:26,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 172 [2024-10-10 22:14:26,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,363 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2024-10-10 22:14:26,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 4 select indices, 4 select index equivalence classes, 26 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 549 [2024-10-10 22:14:26,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,567 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-10 22:14:26,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-10 22:14:26,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-10 22:14:26,646 INFO L349 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2024-10-10 22:14:26,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 25 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 142 [2024-10-10 22:14:26,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 99 [2024-10-10 22:14:26,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:26,961 INFO L349 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2024-10-10 22:14:26,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 168 [2024-10-10 22:14:28,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 79 [2024-10-10 22:14:28,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:28,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:28,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:28,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-10 22:14:28,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:14:28,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 87 [2024-10-10 22:14:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:14:28,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:15:09,627 WARN L286 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-10 22:15:19,620 WARN L286 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)