./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bAnd5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/bAnd5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 09:58:54,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 09:58:54,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 09:58:54,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 09:58:54,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 09:58:54,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 09:58:54,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 09:58:54,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 09:58:54,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 09:58:54,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 09:58:54,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 09:58:54,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 09:58:54,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 09:58:54,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 09:58:54,965 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 09:58:54,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 09:58:54,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 09:58:54,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 09:58:54,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 09:58:54,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 09:58:54,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 09:58:54,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 09:58:54,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 09:58:54,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 09:58:54,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 09:58:54,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 09:58:54,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 09:58:54,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 09:58:54,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 09:58:54,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 09:58:54,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 09:58:54,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 09:58:54,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:58:54,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 09:58:54,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 09:58:54,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 09:58:54,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 09:58:54,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 09:58:54,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 09:58:54,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 09:58:54,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 09:58:54,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 09:58:54,971 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2024-11-08 09:58:55,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 09:58:55,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 09:58:55,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 09:58:55,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 09:58:55,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 09:58:55,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2024-11-08 09:58:56,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 09:58:56,693 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 09:58:56,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2024-11-08 09:58:56,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d76bd6bdc/51d6995251e44411a55ff418babc66ba/FLAG8b3c879f4 [2024-11-08 09:58:56,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d76bd6bdc/51d6995251e44411a55ff418babc66ba [2024-11-08 09:58:56,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 09:58:56,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 09:58:56,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 09:58:56,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 09:58:56,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 09:58:56,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463f870f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56, skipping insertion in model container [2024-11-08 09:58:56,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 09:58:56,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2024-11-08 09:58:56,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:58:56,879 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 09:58:56,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2024-11-08 09:58:56,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 09:58:56,906 INFO L204 MainTranslator]: Completed translation [2024-11-08 09:58:56,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56 WrapperNode [2024-11-08 09:58:56,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 09:58:56,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 09:58:56,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 09:58:56,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 09:58:56,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,931 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 82 [2024-11-08 09:58:56,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 09:58:56,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 09:58:56,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 09:58:56,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 09:58:56,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,958 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2024-11-08 09:58:56,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 09:58:56,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 09:58:56,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 09:58:56,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 09:58:56,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (1/1) ... [2024-11-08 09:58:56,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 09:58:56,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:57,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 09:58:57,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 09:58:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 09:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 09:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 09:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 09:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 09:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 09:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 09:58:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 09:58:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2024-11-08 09:58:57,055 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2024-11-08 09:58:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 09:58:57,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 09:58:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 09:58:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 09:58:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 09:58:57,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 09:58:57,124 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 09:58:57,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 09:58:57,268 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 09:58:57,268 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 09:58:57,279 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 09:58:57,280 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 09:58:57,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:58:57 BoogieIcfgContainer [2024-11-08 09:58:57,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 09:58:57,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 09:58:57,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 09:58:57,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 09:58:57,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:58:56" (1/3) ... [2024-11-08 09:58:57,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f29728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:58:57, skipping insertion in model container [2024-11-08 09:58:57,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:58:56" (2/3) ... [2024-11-08 09:58:57,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f29728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:58:57, skipping insertion in model container [2024-11-08 09:58:57,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:58:57" (3/3) ... [2024-11-08 09:58:57,289 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2024-11-08 09:58:57,316 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 09:58:57,321 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 09:58:57,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 09:58:57,423 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;@20e0893f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 09:58:57,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 09:58:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 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-11-08 09:58:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 09:58:57,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:57,434 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:57,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:57,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:57,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1617415168, now seen corresponding path program 1 times [2024-11-08 09:58:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122962673] [2024-11-08 09:58:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 09:58:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 09:58:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 09:58:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:58:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122962673] [2024-11-08 09:58:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122962673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:58:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 09:58:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 09:58:57,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724791152] [2024-11-08 09:58:57,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:58:57,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 09:58:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:57,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 09:58:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 09:58:57,756 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 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 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 09:58:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:57,790 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2024-11-08 09:58:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 09:58:57,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 30 [2024-11-08 09:58:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:57,801 INFO L225 Difference]: With dead ends: 63 [2024-11-08 09:58:57,801 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 09:58:57,804 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-11-08 09:58:57,808 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:57,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:58:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 09:58:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-08 09:58:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-11-08 09:58:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-08 09:58:57,837 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 30 [2024-11-08 09:58:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:57,838 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-08 09:58:57,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 09:58:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-08 09:58:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 09:58:57,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:57,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:57,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 09:58:57,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:57,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1295325000, now seen corresponding path program 1 times [2024-11-08 09:58:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372662363] [2024-11-08 09:58:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 09:58:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 09:58:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:57,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 09:58:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 09:58:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372662363] [2024-11-08 09:58:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372662363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402305083] [2024-11-08 09:58:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:57,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:57,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:57,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:58:57,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 09:58:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:58,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 09:58:58,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:58:58,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:58:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 09:58:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402305083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:58:58,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:58:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-08 09:58:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755572406] [2024-11-08 09:58:58,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:58:58,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 09:58:58,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 09:58:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 09:58:58,163 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 09:58:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:58,232 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2024-11-08 09:58:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 09:58:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 32 [2024-11-08 09:58:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:58,233 INFO L225 Difference]: With dead ends: 61 [2024-11-08 09:58:58,233 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 09:58:58,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 09:58:58,235 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:58,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:58:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 09:58:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-11-08 09:58:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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-11-08 09:58:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-08 09:58:58,239 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 32 [2024-11-08 09:58:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:58,240 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-08 09:58:58,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 09:58:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-08 09:58:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 09:58:58,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:58,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:58,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 09:58:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:58,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:58,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1588566225, now seen corresponding path program 1 times [2024-11-08 09:58:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190596955] [2024-11-08 09:58:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:58,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:58:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 09:58:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 09:58:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 09:58:58,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190596955] [2024-11-08 09:58:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190596955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873226933] [2024-11-08 09:58:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:58,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:58,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:58,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:58:58,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 09:58:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:58,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 09:58:58,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 09:58:58,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 09:58:58,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873226933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 09:58:58,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 09:58:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-08 09:58:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565380941] [2024-11-08 09:58:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 09:58:58,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 09:58:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:58:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 09:58:58,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 09:58:58,841 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:58:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:58:58,875 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-08 09:58:58,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 09:58:58,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-08 09:58:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:58:58,876 INFO L225 Difference]: With dead ends: 51 [2024-11-08 09:58:58,877 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 09:58:58,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 09:58:58,878 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 09:58:58,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 09:58:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 09:58:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-08 09:58:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-11-08 09:58:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-08 09:58:58,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 46 [2024-11-08 09:58:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:58:58,891 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-08 09:58:58,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 09:58:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-08 09:58:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 09:58:58,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:58:58,893 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:58:58,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 09:58:59,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 09:58:59,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:58:59,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:58:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash 480375887, now seen corresponding path program 1 times [2024-11-08 09:58:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:58:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59733220] [2024-11-08 09:58:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:59,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:58:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:58:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:59,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 09:58:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:59,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 09:58:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 09:58:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:58:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59733220] [2024-11-08 09:58:59,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59733220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:58:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516979431] [2024-11-08 09:58:59,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:58:59,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:58:59,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:58:59,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:58:59,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 09:58:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:58:59,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 09:58:59,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:58:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 09:58:59,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:59:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 09:59:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516979431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:59:00,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:59:00,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2024-11-08 09:59:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535337959] [2024-11-08 09:59:00,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:59:00,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 09:59:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:59:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 09:59:00,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-08 09:59:00,199 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 09:59:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:59:00,284 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2024-11-08 09:59:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 09:59:00,285 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-08 09:59:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:59:00,287 INFO L225 Difference]: With dead ends: 83 [2024-11-08 09:59:00,288 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 09:59:00,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-08 09:59:00,290 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 09:59:00,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 09:59:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 09:59:00,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2024-11-08 09:59:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-08 09:59:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2024-11-08 09:59:00,305 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 48 [2024-11-08 09:59:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:59:00,305 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2024-11-08 09:59:00,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 09:59:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2024-11-08 09:59:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 09:59:00,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:59:00,308 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-08 09:59:00,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 09:59:00,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:59:00,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:59:00,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:59:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1030385955, now seen corresponding path program 1 times [2024-11-08 09:59:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:59:00,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459971257] [2024-11-08 09:59:00,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:59:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:59:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:59:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:01,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 09:59:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 09:59:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 09:59:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:59:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459971257] [2024-11-08 09:59:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459971257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:59:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713092696] [2024-11-08 09:59:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:59:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:59:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:59:01,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:59:01,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 09:59:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:01,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-08 09:59:01,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:59:01,526 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 15 treesize of output 1 [2024-11-08 09:59:01,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 09:59:01,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2024-11-08 09:59:02,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 09:59:02,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-08 09:59:02,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 09:59:02,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-11-08 09:59:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 09:59:02,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:59:03,289 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 176 treesize of output 156 [2024-11-08 09:59:03,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 09:59:03,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 107 [2024-11-08 09:59:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 09:59:03,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713092696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:59:03,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:59:03,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 19] total 52 [2024-11-08 09:59:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999651726] [2024-11-08 09:59:03,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:59:03,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-08 09:59:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:59:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-08 09:59:03,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2316, Unknown=0, NotChecked=0, Total=2652 [2024-11-08 09:59:03,391 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 52 states, 50 states have (on average 2.2) internal successors, (110), 49 states have internal predecessors, (110), 7 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 09:59:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:59:05,330 INFO L93 Difference]: Finished difference Result 277 states and 381 transitions. [2024-11-08 09:59:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 09:59:05,331 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.2) internal successors, (110), 49 states have internal predecessors, (110), 7 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2024-11-08 09:59:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:59:05,334 INFO L225 Difference]: With dead ends: 277 [2024-11-08 09:59:05,334 INFO L226 Difference]: Without dead ends: 218 [2024-11-08 09:59:05,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=812, Invalid=5508, Unknown=0, NotChecked=0, Total=6320 [2024-11-08 09:59:05,337 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 290 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 09:59:05,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 523 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 09:59:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-08 09:59:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 181. [2024-11-08 09:59:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 153 states have (on average 1.2352941176470589) internal successors, (189), 160 states have internal predecessors, (189), 16 states have call successors, (16), 5 states have call predecessors, (16), 11 states have return successors, (55), 15 states have call predecessors, (55), 16 states have call successors, (55) [2024-11-08 09:59:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2024-11-08 09:59:05,387 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 49 [2024-11-08 09:59:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:59:05,388 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2024-11-08 09:59:05,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.2) internal successors, (110), 49 states have internal predecessors, (110), 7 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 09:59:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2024-11-08 09:59:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 09:59:05,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:59:05,391 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-08 09:59:05,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 09:59:05,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:59:05,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:59:05,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:59:05,597 INFO L85 PathProgramCache]: Analyzing trace with hash -292912813, now seen corresponding path program 2 times [2024-11-08 09:59:05,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:59:05,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638796189] [2024-11-08 09:59:05,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:59:05,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:59:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:59:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 09:59:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 09:59:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 09:59:06,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:59:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638796189] [2024-11-08 09:59:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638796189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:59:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280296639] [2024-11-08 09:59:06,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 09:59:06,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:59:06,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:59:06,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:59:06,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 09:59:06,272 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 09:59:06,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 09:59:06,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 09:59:06,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:59:06,307 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 15 treesize of output 1 [2024-11-08 09:59:06,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 09:59:06,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-11-08 09:59:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 09:59:06,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 09:59:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 09:59:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280296639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 09:59:06,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 09:59:06,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 10] total 35 [2024-11-08 09:59:06,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632099165] [2024-11-08 09:59:06,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 09:59:06,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 09:59:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 09:59:06,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 09:59:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 09:59:06,917 INFO L87 Difference]: Start difference. First operand 181 states and 260 transitions. Second operand has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 34 states have internal predecessors, (102), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 09:59:10,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:14,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:19,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:23,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:27,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:31,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:35,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:39,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:43,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:47,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:51,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:55,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 09:59:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 09:59:55,907 INFO L93 Difference]: Finished difference Result 388 states and 521 transitions. [2024-11-08 09:59:55,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 09:59:55,909 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 34 states have internal predecessors, (102), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2024-11-08 09:59:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 09:59:55,911 INFO L225 Difference]: With dead ends: 388 [2024-11-08 09:59:55,911 INFO L226 Difference]: Without dead ends: 236 [2024-11-08 09:59:55,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=2211, Unknown=0, NotChecked=0, Total=2550 [2024-11-08 09:59:55,916 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 134 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 62 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.6s IncrementalHoareTripleChecker+Time [2024-11-08 09:59:55,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 388 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 774 Invalid, 12 Unknown, 0 Unchecked, 48.6s Time] [2024-11-08 09:59:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-08 09:59:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2024-11-08 09:59:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 175 states have (on average 1.2228571428571429) internal successors, (214), 182 states have internal predecessors, (214), 17 states have call successors, (17), 7 states have call predecessors, (17), 13 states have return successors, (48), 16 states have call predecessors, (48), 17 states have call successors, (48) [2024-11-08 09:59:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 279 transitions. [2024-11-08 09:59:55,946 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 279 transitions. Word has length 49 [2024-11-08 09:59:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 09:59:55,946 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 279 transitions. [2024-11-08 09:59:55,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.914285714285714) internal successors, (102), 34 states have internal predecessors, (102), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 09:59:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 279 transitions. [2024-11-08 09:59:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 09:59:55,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 09:59:55,948 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 09:59:55,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 09:59:56,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:59:56,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 09:59:56,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 09:59:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2132276289, now seen corresponding path program 1 times [2024-11-08 09:59:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 09:59:56,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845482848] [2024-11-08 09:59:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:59:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 09:59:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 09:59:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 09:59:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:58,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 09:59:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 09:59:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 09:59:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845482848] [2024-11-08 09:59:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845482848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 09:59:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133545161] [2024-11-08 09:59:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 09:59:58,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 09:59:58,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 09:59:58,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 09:59:58,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 09:59:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 09:59:58,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-08 09:59:58,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 09:59:58,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 09:59:58,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 40 [2024-11-08 09:59:59,028 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 98 treesize of output 65 [2024-11-08 09:59:59,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 09:59:59,247 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-08 09:59:59,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 72 [2024-11-08 09:59:59,478 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 124 treesize of output 76 [2024-11-08 09:59:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 09:59:59,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:00:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133545161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:00:00,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:00:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2024-11-08 10:00:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96001342] [2024-11-08 10:00:00,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:00:00,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-08 10:00:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:00:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-08 10:00:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2451, Unknown=0, NotChecked=0, Total=2652 [2024-11-08 10:00:00,589 INFO L87 Difference]: Start difference. First operand 206 states and 279 transitions. Second operand has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 10:00:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:00:01,716 INFO L93 Difference]: Finished difference Result 322 states and 459 transitions. [2024-11-08 10:00:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 10:00:01,717 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2024-11-08 10:00:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:00:01,719 INFO L225 Difference]: With dead ends: 322 [2024-11-08 10:00:01,719 INFO L226 Difference]: Without dead ends: 318 [2024-11-08 10:00:01,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=370, Invalid=3790, Unknown=0, NotChecked=0, Total=4160 [2024-11-08 10:00:01,721 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 91 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:00:01,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 195 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:00:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-08 10:00:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 258. [2024-11-08 10:00:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 219 states have (on average 1.2511415525114156) internal successors, (274), 230 states have internal predecessors, (274), 21 states have call successors, (21), 7 states have call predecessors, (21), 17 states have return successors, (75), 20 states have call predecessors, (75), 21 states have call successors, (75) [2024-11-08 10:00:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 370 transitions. [2024-11-08 10:00:01,762 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 370 transitions. Word has length 51 [2024-11-08 10:00:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:00:01,762 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 370 transitions. [2024-11-08 10:00:01,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 38 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 10:00:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 370 transitions. [2024-11-08 10:00:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 10:00:01,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:01,764 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:01,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:00:01,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:00:01,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:01,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1947293477, now seen corresponding path program 3 times [2024-11-08 10:00:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:00:01,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057965489] [2024-11-08 10:00:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:00:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 10:00:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 10:00:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 10:00:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:00:02,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:00:02,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057965489] [2024-11-08 10:00:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057965489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:00:02,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712327859] [2024-11-08 10:00:02,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 10:00:02,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:00:02,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:00:02,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:00:02,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:00:02,140 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 10:00:02,140 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:00:02,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 10:00:02,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:00:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:00:02,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:00:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:00:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712327859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:00:02,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:00:02,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2024-11-08 10:00:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825801119] [2024-11-08 10:00:02,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:00:02,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 10:00:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:00:02,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 10:00:02,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:00:02,326 INFO L87 Difference]: Start difference. First operand 258 states and 370 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 10:00:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:00:02,535 INFO L93 Difference]: Finished difference Result 560 states and 795 transitions. [2024-11-08 10:00:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 10:00:02,536 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 51 [2024-11-08 10:00:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:00:02,539 INFO L225 Difference]: With dead ends: 560 [2024-11-08 10:00:02,540 INFO L226 Difference]: Without dead ends: 444 [2024-11-08 10:00:02,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-08 10:00:02,541 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 80 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:00:02,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 322 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:00:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-08 10:00:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 377. [2024-11-08 10:00:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 327 states have (on average 1.2507645259938838) internal successors, (409), 341 states have internal predecessors, (409), 26 states have call successors, (26), 10 states have call predecessors, (26), 23 states have return successors, (102), 25 states have call predecessors, (102), 26 states have call successors, (102) [2024-11-08 10:00:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 537 transitions. [2024-11-08 10:00:02,603 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 537 transitions. Word has length 51 [2024-11-08 10:00:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:00:02,604 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 537 transitions. [2024-11-08 10:00:02,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 10:00:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 537 transitions. [2024-11-08 10:00:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:00:02,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:02,607 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-08 10:00:02,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 10:00:02,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:00:02,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:02,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:02,809 INFO L85 PathProgramCache]: Analyzing trace with hash 110150350, now seen corresponding path program 1 times [2024-11-08 10:00:02,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:00:02,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009365242] [2024-11-08 10:00:02,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:02,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:00:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:00:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 10:00:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:03,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 10:00:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:00:03,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:00:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009365242] [2024-11-08 10:00:03,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009365242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:00:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404985688] [2024-11-08 10:00:03,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:03,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:00:03,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:00:03,379 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:00:03,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 10:00:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:03,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-08 10:00:03,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:00:03,495 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 15 treesize of output 1 [2024-11-08 10:00:03,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:00:03,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2024-11-08 10:00:03,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:00:03,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2024-11-08 10:00:03,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:00:03,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2024-11-08 10:00:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 10:00:03,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:00:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404985688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:00:04,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:00:04,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2024-11-08 10:00:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597284056] [2024-11-08 10:00:04,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:00:04,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 10:00:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:00:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 10:00:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2024-11-08 10:00:04,010 INFO L87 Difference]: Start difference. First operand 377 states and 537 transitions. Second operand has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 26 states have internal predecessors, (83), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 10:00:08,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 10:00:12,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 10:00:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:00:12,789 INFO L93 Difference]: Finished difference Result 498 states and 691 transitions. [2024-11-08 10:00:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 10:00:12,790 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 26 states have internal predecessors, (83), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2024-11-08 10:00:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:00:12,793 INFO L225 Difference]: With dead ends: 498 [2024-11-08 10:00:12,796 INFO L226 Difference]: Without dead ends: 458 [2024-11-08 10:00:12,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 10:00:12,797 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 122 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:00:12,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 231 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 422 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-11-08 10:00:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-08 10:00:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 445. [2024-11-08 10:00:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 387 states have (on average 1.2583979328165376) internal successors, (487), 407 states have internal predecessors, (487), 29 states have call successors, (29), 12 states have call predecessors, (29), 28 states have return successors, (106), 25 states have call predecessors, (106), 29 states have call successors, (106) [2024-11-08 10:00:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 622 transitions. [2024-11-08 10:00:12,894 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 622 transitions. Word has length 52 [2024-11-08 10:00:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:00:12,894 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 622 transitions. [2024-11-08 10:00:12,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 26 states have internal predecessors, (83), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 10:00:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 622 transitions. [2024-11-08 10:00:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 10:00:12,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:12,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:12,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 10:00:13,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 10:00:13,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:13,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1069560756, now seen corresponding path program 1 times [2024-11-08 10:00:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:00:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695147623] [2024-11-08 10:00:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:00:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:00:13,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 10:00:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:00:13,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 10:00:13,190 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 10:00:13,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:00:13,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:00:13,196 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:13,229 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:00:13,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:00:13 BoogieIcfgContainer [2024-11-08 10:00:13,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:00:13,231 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:00:13,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:00:13,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:00:13,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:58:57" (3/4) ... [2024-11-08 10:00:13,233 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 10:00:13,234 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:00:13,235 INFO L158 Benchmark]: Toolchain (without parser) took 76518.96ms. Allocated memory was 222.3MB in the beginning and 438.3MB in the end (delta: 216.0MB). Free memory was 152.5MB in the beginning and 338.0MB in the end (delta: -185.5MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-11-08 10:00:13,235 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:00:13,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.52ms. Allocated memory is still 222.3MB. Free memory was 152.5MB in the beginning and 139.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:00:13,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.03ms. Allocated memory is still 222.3MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:00:13,235 INFO L158 Benchmark]: Boogie Preprocessor took 44.60ms. Allocated memory is still 222.3MB. Free memory was 137.8MB in the beginning and 135.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:00:13,236 INFO L158 Benchmark]: RCFGBuilder took 300.96ms. Allocated memory is still 222.3MB. Free memory was 135.4MB in the beginning and 121.5MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:00:13,236 INFO L158 Benchmark]: TraceAbstraction took 75947.08ms. Allocated memory was 222.3MB in the beginning and 438.3MB in the end (delta: 216.0MB). Free memory was 120.8MB in the beginning and 339.0MB in the end (delta: -218.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:00:13,236 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 438.3MB. Free memory was 339.0MB in the beginning and 338.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:00:13,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.52ms. Allocated memory is still 222.3MB. Free memory was 152.5MB in the beginning and 139.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.03ms. Allocated memory is still 222.3MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.60ms. Allocated memory is still 222.3MB. Free memory was 137.8MB in the beginning and 135.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 300.96ms. Allocated memory is still 222.3MB. Free memory was 135.4MB in the beginning and 121.5MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 75947.08ms. Allocated memory was 222.3MB in the beginning and 438.3MB in the end (delta: 216.0MB). Free memory was 120.8MB in the beginning and 339.0MB in the end (delta: -218.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 438.3MB. Free memory was 339.0MB in the beginning and 338.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 57]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [N=2, i=0, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [N=2, i=1, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [N=2, i=2, x={9:0}] [L40] COND FALSE !(i < N) VAL [N=2, x={9:0}] [L45] CALL, EXPR bAnd(x) VAL [N=2, \old(x)={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [N=2, \old(x)={9:0}, i=1, res=-2147483647, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] VAL [N=2, \old(x)={9:0}, i=1, res=-2147483647, x={9:0}] [L25] EXPR res & x[i] VAL [N=2, \old(x)={9:0}, i=1, x={9:0}] [L25] res = res & x[i] [L24] i++ VAL [N=2, \old(x)={9:0}, i=2, res=1, x={9:0}] [L24] COND FALSE !(i < N) VAL [N=2, \old(x)={9:0}, res=1, x={9:0}] [L27] return res; VAL [N=2, \old(x)={9:0}, \result=1, x={9:0}] [L45] RET, EXPR bAnd(x) VAL [N=2, x={9:0}] [L45] ret = bAnd(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [N=2] [L48] CALL, EXPR bAnd(x) VAL [N=2, \old(x)={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [N=2, \old(x)={9:0}, i=1, res=2147483647, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] VAL [N=2, \old(x)={9:0}, i=1, res=2147483647, x={9:0}] [L25] EXPR res & x[i] VAL [N=2, \old(x)={9:0}, i=1, x={9:0}] [L25] res = res & x[i] [L24] i++ VAL [N=2, \old(x)={9:0}, i=2, res=2147483647, x={9:0}] [L24] COND FALSE !(i < N) VAL [N=2, \old(x)={9:0}, res=2147483647, x={9:0}] [L27] return res; VAL [N=2, \old(x)={9:0}, \result=2147483647, x={9:0}] [L48] RET, EXPR bAnd(x) VAL [N=2, ret=1, x={9:0}] [L48] ret2 = bAnd(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [N=2, i=0, ret2=2147483647, ret=1, temp=2147483647, x={9:0}] [L50] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2024-11-08 10:00:15,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:00:15,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:00:15,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:00:15,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:00:15,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:00:15,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2024-11-08 10:00:17,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:00:17,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:00:17,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2024-11-08 10:00:17,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ce85e2a/5224fda7f6464dae8cad7278449237b9/FLAGf8e581945 [2024-11-08 10:00:17,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15ce85e2a/5224fda7f6464dae8cad7278449237b9 [2024-11-08 10:00:17,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:00:17,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:00:17,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:00:17,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:00:17,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:00:17,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7e98cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17, skipping insertion in model container [2024-11-08 10:00:17,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:00:17,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2024-11-08 10:00:17,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:00:17,655 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:00:17,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i[1369,1382] [2024-11-08 10:00:17,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:00:17,701 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:00:17,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17 WrapperNode [2024-11-08 10:00:17,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:00:17,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:00:17,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:00:17,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:00:17,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,740 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2024-11-08 10:00:17,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:00:17,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:00:17,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:00:17,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:00:17,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,771 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2024-11-08 10:00:17,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:00:17,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:00:17,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:00:17,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:00:17,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (1/1) ... [2024-11-08 10:00:17,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:00:17,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:00:17,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:00:17,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:00:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:00:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 10:00:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 10:00:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 10:00:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 10:00:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 10:00:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 10:00:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 10:00:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2024-11-08 10:00:17,880 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2024-11-08 10:00:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:00:17,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:00:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 10:00:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 10:00:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 10:00:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 10:00:17,946 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:00:17,948 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:00:18,074 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 10:00:18,074 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:00:18,082 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:00:18,083 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 10:00:18,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:00:18 BoogieIcfgContainer [2024-11-08 10:00:18,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:00:18,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:00:18,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:00:18,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:00:18,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:00:17" (1/3) ... [2024-11-08 10:00:18,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639bb01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:00:18, skipping insertion in model container [2024-11-08 10:00:18,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:00:17" (2/3) ... [2024-11-08 10:00:18,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639bb01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:00:18, skipping insertion in model container [2024-11-08 10:00:18,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:00:18" (3/3) ... [2024-11-08 10:00:18,090 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2024-11-08 10:00:18,102 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:00:18,102 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:00:18,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:00:18,158 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;@74e1820e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:00:18,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:00:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.391304347826087) 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-11-08 10:00:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:00:18,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:18,169 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:18,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:18,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 466257350, now seen corresponding path program 1 times [2024-11-08 10:00:18,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:00:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444083200] [2024-11-08 10:00:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:00:18,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:00:18,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 10:00:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:18,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 10:00:18,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:00:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:00:18,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:00:18,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:00:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444083200] [2024-11-08 10:00:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444083200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:00:18,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:00:18,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:00:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562891195] [2024-11-08 10:00:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:00:18,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 10:00:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:00:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 10:00:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 10:00:18,380 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.391304347826087) 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) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:00:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:00:18,404 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2024-11-08 10:00:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 10:00:18,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-08 10:00:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:00:18,413 INFO L225 Difference]: With dead ends: 53 [2024-11-08 10:00:18,413 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 10:00:18,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-11-08 10:00:18,420 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:00:18,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:00:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 10:00:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 10:00:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-11-08 10:00:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-08 10:00:18,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2024-11-08 10:00:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:00:18,444 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-08 10:00:18,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:00:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-08 10:00:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:00:18,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:18,445 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:18,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 10:00:18,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:18,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:18,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1183314106, now seen corresponding path program 1 times [2024-11-08 10:00:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:00:18,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611895463] [2024-11-08 10:00:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:18,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:18,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:00:18,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:00:18,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 10:00:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:18,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:00:18,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:00:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:00:18,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:00:18,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:00:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611895463] [2024-11-08 10:00:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611895463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:00:18,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:00:18,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:00:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132061200] [2024-11-08 10:00:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:00:18,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:00:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:00:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:00:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:00:18,765 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 10:00:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:00:18,788 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-08 10:00:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:00:18,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 30 [2024-11-08 10:00:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:00:18,789 INFO L225 Difference]: With dead ends: 45 [2024-11-08 10:00:18,790 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 10:00:18,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:00:18,791 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:00:18,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:00:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 10:00:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-08 10:00:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-11-08 10:00:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-08 10:00:18,799 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 30 [2024-11-08 10:00:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:00:18,799 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-08 10:00:18,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 10:00:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-08 10:00:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 10:00:18,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:18,800 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:18,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 10:00:19,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:19,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:19,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash -590255016, now seen corresponding path program 1 times [2024-11-08 10:00:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:00:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395181234] [2024-11-08 10:00:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:19,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:19,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:00:19,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:00:19,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 10:00:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:19,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:00:19,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:00:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:00:19,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:00:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:00:19,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:00:19,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395181234] [2024-11-08 10:00:19,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395181234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:00:19,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:00:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-08 10:00:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548564147] [2024-11-08 10:00:19,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:00:19,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:00:19,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:00:19,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:00:19,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:00:19,156 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 10:00:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:00:19,200 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-11-08 10:00:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:00:19,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 32 [2024-11-08 10:00:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:00:19,201 INFO L225 Difference]: With dead ends: 47 [2024-11-08 10:00:19,201 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 10:00:19,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:00:19,203 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:00:19,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:00:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 10:00:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-08 10:00:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-11-08 10:00:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-08 10:00:19,209 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2024-11-08 10:00:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:00:19,213 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-08 10:00:19,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 10:00:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-08 10:00:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 10:00:19,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:19,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:19,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 10:00:19,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:19,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 111835254, now seen corresponding path program 2 times [2024-11-08 10:00:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:00:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43647938] [2024-11-08 10:00:19,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:00:19,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:19,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:00:19,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:00:19,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 10:00:19,479 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 10:00:19,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:00:19,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:00:19,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:00:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 10:00:19,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:00:19,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:00:19,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43647938] [2024-11-08 10:00:19,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43647938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:00:19,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:00:19,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:00:19,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635835305] [2024-11-08 10:00:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:00:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:00:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:00:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:00:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:00:19,537 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:00:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:00:19,592 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-11-08 10:00:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:00:19,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-08 10:00:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:00:19,593 INFO L225 Difference]: With dead ends: 46 [2024-11-08 10:00:19,593 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 10:00:19,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-11-08 10:00:19,594 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:00:19,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 30 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:00:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 10:00:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-08 10:00:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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-11-08 10:00:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-08 10:00:19,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2024-11-08 10:00:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:00:19,601 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-08 10:00:19,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:00:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-08 10:00:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 10:00:19,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:19,602 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:19,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 10:00:19,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:19,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:19,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1766573260, now seen corresponding path program 1 times [2024-11-08 10:00:19,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:00:19,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141283078] [2024-11-08 10:00:19,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:19,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:00:19,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:00:19,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 10:00:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:19,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:00:19,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:00:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:00:20,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:00:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 10:00:20,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:00:20,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141283078] [2024-11-08 10:00:20,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141283078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:00:20,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:00:20,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-08 10:00:20,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076893052] [2024-11-08 10:00:20,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:00:20,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 10:00:20,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:00:20,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 10:00:20,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:00:20,166 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 10:00:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:00:20,381 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2024-11-08 10:00:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:00:20,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-11-08 10:00:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:00:20,383 INFO L225 Difference]: With dead ends: 67 [2024-11-08 10:00:20,383 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 10:00:20,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:00:20,384 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:00:20,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 74 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:00:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 10:00:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2024-11-08 10:00:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-11-08 10:00:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-08 10:00:20,391 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2024-11-08 10:00:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:00:20,394 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-08 10:00:20,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 10:00:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-08 10:00:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 10:00:20,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:00:20,395 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:00:20,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 10:00:20,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:20,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:00:20,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:00:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash -572775278, now seen corresponding path program 1 times [2024-11-08 10:00:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:00:20,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621262595] [2024-11-08 10:00:20,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:00:20,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:00:20,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:00:20,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:00:20,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 10:00:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:00:20,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 10:00:20,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:00:21,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:00:21,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2024-11-08 10:00:21,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:00:21,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 34 [2024-11-08 10:00:21,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 10:00:21,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 10:00:21,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:00:21,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 58 [2024-11-08 10:00:21,670 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 10:00:21,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:00:21,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 28