./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 407fcf7d2eac351408fa4d5f2ec0e8445116bd56ec588be775b50f5c012c0e01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:06:50,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:06:50,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:06:50,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:06:50,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:06:50,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:06:50,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:06:50,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:06:50,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:06:50,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:06:50,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:06:50,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:06:50,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:06:50,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:06:50,973 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:06:50,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:06:50,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:06:50,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:06:50,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:06:50,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:06:50,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:06:50,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:06:50,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:06:50,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:06:50,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:06:50,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:06:50,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:06:50,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:06:50,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:06:50,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:06:50,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:06:50,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:06:50,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:06:50,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:06:50,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:06:50,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:06:50,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:06:50,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:06:50,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:06:50,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:06:50,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:06:50,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:06:50,983 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 407fcf7d2eac351408fa4d5f2ec0e8445116bd56ec588be775b50f5c012c0e01 [2024-10-10 22:06:51,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:06:51,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:06:51,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:06:51,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:06:51,251 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:06:51,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i [2024-10-10 22:06:52,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:06:52,847 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:06:52,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i [2024-10-10 22:06:52,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2bc2cef28/4c2aa2bae2a743cdb34cf7ebd4f55646/FLAGedbc36e95 [2024-10-10 22:06:52,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2bc2cef28/4c2aa2bae2a743cdb34cf7ebd4f55646 [2024-10-10 22:06:52,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:06:52,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:06:52,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:06:52,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:06:52,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:06:52,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:06:52" (1/1) ... [2024-10-10 22:06:52,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789a1128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:52, skipping insertion in model container [2024-10-10 22:06:52,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:06:52" (1/1) ... [2024-10-10 22:06:52,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:06:53,067 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i[1383,1396] [2024-10-10 22:06:53,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:06:53,085 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:06:53,109 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i[1383,1396] [2024-10-10 22:06:53,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:06:53,127 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:06:53,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53 WrapperNode [2024-10-10 22:06:53,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:06:53,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:06:53,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:06:53,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:06:53,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,165 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2024-10-10 22:06:53,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:06:53,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:06:53,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:06:53,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:06:53,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,197 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-10 22:06:53,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:06:53,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:06:53,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:06:53,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:06:53,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (1/1) ... [2024-10-10 22:06:53,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:06:53,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:06:53,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:06:53,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:06:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:06:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:06:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:06:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:06:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:06:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:06:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:06:53,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:06:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:06:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:06:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2024-10-10 22:06:53,326 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2024-10-10 22:06:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:06:53,458 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:06:53,460 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:06:53,641 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-10 22:06:53,641 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:06:53,672 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:06:53,672 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-10 22:06:53,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:06:53 BoogieIcfgContainer [2024-10-10 22:06:53,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:06:53,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:06:53,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:06:53,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:06:53,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:06:52" (1/3) ... [2024-10-10 22:06:53,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15715323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:06:53, skipping insertion in model container [2024-10-10 22:06:53,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:06:53" (2/3) ... [2024-10-10 22:06:53,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15715323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:06:53, skipping insertion in model container [2024-10-10 22:06:53,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:06:53" (3/3) ... [2024-10-10 22:06:53,685 INFO L112 eAbstractionObserver]: Analyzing ICFG mapavg5.i [2024-10-10 22:06:53,700 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:06:53,700 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:06:53,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:06:53,755 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;@61b46dea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:06:53,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:06:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 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-10-10 22:06:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:06:53,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:06:53,769 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:06:53,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:06:53,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:06:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1630272060, now seen corresponding path program 1 times [2024-10-10 22:06:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:06:53,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857759967] [2024-10-10 22:06:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:06:53,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:06:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:53,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 22:06:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-10 22:06:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-10 22:06:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:06:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:06:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857759967] [2024-10-10 22:06:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857759967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:06:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:06:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:06:54,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992069957] [2024-10-10 22:06:54,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:06:54,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:06:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:06:54,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:06:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:06:54,077 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:06:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:06:54,113 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2024-10-10 22:06:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:06:54,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 26 [2024-10-10 22:06:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:06:54,126 INFO L225 Difference]: With dead ends: 41 [2024-10-10 22:06:54,126 INFO L226 Difference]: Without dead ends: 19 [2024-10-10 22:06:54,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:06:54,137 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:06:54,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:06:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-10 22:06:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-10 22:06:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:06:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-10 22:06:54,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 26 [2024-10-10 22:06:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:06:54,169 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-10 22:06:54,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:06:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-10 22:06:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:06:54,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:06:54,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:06:54,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:06:54,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:06:54,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:06:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 970404386, now seen corresponding path program 1 times [2024-10-10 22:06:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:06:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235410349] [2024-10-10 22:06:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:06:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:06:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 22:06:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-10 22:06:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-10 22:06:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:06:54,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:06:54,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235410349] [2024-10-10 22:06:54,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235410349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:06:54,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:06:54,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:06:54,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278511013] [2024-10-10 22:06:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:06:54,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:06:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:06:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:06:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:06:54,438 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:06:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:06:54,469 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-10-10 22:06:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:06:54,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 26 [2024-10-10 22:06:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:06:54,471 INFO L225 Difference]: With dead ends: 36 [2024-10-10 22:06:54,471 INFO L226 Difference]: Without dead ends: 20 [2024-10-10 22:06:54,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:06:54,473 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 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-10-10 22:06:54,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:06:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-10 22:06:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-10 22:06:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:06:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-10 22:06:54,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 26 [2024-10-10 22:06:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:06:54,482 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-10 22:06:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:06:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-10 22:06:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:06:54,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:06:54,483 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:06:54,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:06:54,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:06:54,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:06:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2047390395, now seen corresponding path program 1 times [2024-10-10 22:06:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:06:54,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070344583] [2024-10-10 22:06:54,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:06:54,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:06:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-10 22:06:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 22:06:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:06:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 22:06:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:06:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070344583] [2024-10-10 22:06:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070344583] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:06:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654417471] [2024-10-10 22:06:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:06:54,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:06:54,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:06:54,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:06:54,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:06:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:54,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:06:54,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:06:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:06:54,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:06:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:06:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654417471] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:06:54,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:06:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-10-10 22:06:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472974244] [2024-10-10 22:06:54,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:06:54,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:06:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:06:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:06:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:06:54,963 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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-10-10 22:06:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:06:55,059 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-10-10 22:06:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:06:55,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 27 [2024-10-10 22:06:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:06:55,060 INFO L225 Difference]: With dead ends: 38 [2024-10-10 22:06:55,061 INFO L226 Difference]: Without dead ends: 22 [2024-10-10 22:06:55,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:06:55,064 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:06:55,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:06:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-10 22:06:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-10 22:06:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:06:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-10 22:06:55,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 27 [2024-10-10 22:06:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:06:55,075 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-10 22:06:55,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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-10-10 22:06:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-10 22:06:55,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:06:55,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:06:55,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:06:55,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:06:55,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:06:55,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:06:55,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:06:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1189276432, now seen corresponding path program 1 times [2024-10-10 22:06:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:06:55,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785378676] [2024-10-10 22:06:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:06:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:06:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-10 22:06:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:06:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:06:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-10 22:06:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:06:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785378676] [2024-10-10 22:06:55,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785378676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:06:55,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:06:55,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:06:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783610959] [2024-10-10 22:06:55,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:06:55,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:06:55,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:06:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:06:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:06:55,422 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:06:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:06:55,461 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-10 22:06:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:06:55,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-10 22:06:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:06:55,462 INFO L225 Difference]: With dead ends: 34 [2024-10-10 22:06:55,462 INFO L226 Difference]: Without dead ends: 23 [2024-10-10 22:06:55,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:06:55,464 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:06:55,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 20 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:06:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-10 22:06:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-10 22:06:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:06:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-10 22:06:55,469 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 31 [2024-10-10 22:06:55,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:06:55,470 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-10 22:06:55,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:06:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-10 22:06:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 22:06:55,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:06:55,472 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:06:55,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:06:55,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:06:55,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:06:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -989343202, now seen corresponding path program 1 times [2024-10-10 22:06:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:06:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430514831] [2024-10-10 22:06:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:06:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:06:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-10 22:06:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:06:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:06:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:06:55,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:06:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430514831] [2024-10-10 22:06:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430514831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:06:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453322754] [2024-10-10 22:06:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:06:55,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:06:55,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:06:55,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:06:55,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:06:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:06:55,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:06:55,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:06:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:06:55,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:06:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:06:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453322754] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:06:55,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:06:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-10-10 22:06:55,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561884363] [2024-10-10 22:06:55,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:06:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:06:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:06:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:06:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:06:55,836 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 22:06:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:06:55,876 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-10 22:06:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:06:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 32 [2024-10-10 22:06:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:06:55,878 INFO L225 Difference]: With dead ends: 40 [2024-10-10 22:06:55,878 INFO L226 Difference]: Without dead ends: 24 [2024-10-10 22:06:55,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:06:55,879 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:06:55,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:06:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-10 22:06:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-10 22:06:55,883 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-10-10 22:06:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-10 22:06:55,884 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 32 [2024-10-10 22:06:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:06:55,884 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-10 22:06:55,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 22:06:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-10 22:06:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:06:55,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:06:55,885 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:06:55,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:06:56,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:06:56,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:06:56,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:06:56,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1815157912, now seen corresponding path program 2 times [2024-10-10 22:06:56,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:06:56,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246791262] [2024-10-10 22:06:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:06:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:06:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:07:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-10 22:07:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 22:07:02,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:07:02,252 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig$NestedTraceCheckException: UNKNOWN during nested interpolation. I don't know how to continue at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-10 22:07:02,259 INFO L158 Benchmark]: Toolchain (without parser) took 9389.14ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 83.4MB in the beginning and 136.0MB in the end (delta: -52.6MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2024-10-10 22:07:02,259 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:07:02,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.52ms. Allocated memory is still 151.0MB. Free memory was 83.2MB in the beginning and 70.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:07:02,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.81ms. Allocated memory is still 151.0MB. Free memory was 70.7MB in the beginning and 69.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:07:02,260 INFO L158 Benchmark]: Boogie Preprocessor took 49.59ms. Allocated memory is still 151.0MB. Free memory was 69.0MB in the beginning and 66.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:07:02,260 INFO L158 Benchmark]: RCFGBuilder took 456.66ms. Allocated memory is still 151.0MB. Free memory was 66.9MB in the beginning and 113.8MB in the end (delta: -46.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 22:07:02,263 INFO L158 Benchmark]: TraceAbstraction took 8583.17ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 113.1MB in the beginning and 136.0MB in the end (delta: -22.9MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-10-10 22:07:02,264 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.19ms. Allocated memory is still 113.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.52ms. Allocated memory is still 151.0MB. Free memory was 83.2MB in the beginning and 70.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.81ms. Allocated memory is still 151.0MB. Free memory was 70.7MB in the beginning and 69.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.59ms. Allocated memory is still 151.0MB. Free memory was 69.0MB in the beginning and 66.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 456.66ms. Allocated memory is still 151.0MB. Free memory was 66.9MB in the beginning and 113.8MB in the end (delta: -46.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8583.17ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 113.1MB in the beginning and 136.0MB in the end (delta: -22.9MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NestedTraceCheckException: UNKNOWN during nested interpolation. I don't know how to continue de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NestedTraceCheckException: UNKNOWN during nested interpolation. I don't know how to continue: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:388) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-10 22:07:02,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 407fcf7d2eac351408fa4d5f2ec0e8445116bd56ec588be775b50f5c012c0e01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:07:04,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:07:04,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-10 22:07:04,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:07:04,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:07:04,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:07:04,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:07:04,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:07:04,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:07:04,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:07:04,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:07:04,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:07:04,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:07:04,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:07:04,614 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:07:04,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:07:04,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:07:04,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:07:04,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:07:04,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:07:04,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:07:04,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:07:04,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:07:04,620 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-10 22:07:04,620 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-10 22:07:04,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:07:04,620 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-10 22:07:04,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:07:04,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:07:04,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:07:04,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:07:04,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:07:04,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:07:04,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:07:04,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:07:04,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:07:04,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:07:04,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:07:04,623 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-10 22:07:04,623 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-10 22:07:04,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:07:04,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:07:04,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:07:04,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:07:04,624 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-10 22:07:04,625 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 407fcf7d2eac351408fa4d5f2ec0e8445116bd56ec588be775b50f5c012c0e01 [2024-10-10 22:07:04,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:07:04,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:07:04,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:07:04,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:07:04,974 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:07:04,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i [2024-10-10 22:07:06,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:07:06,702 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:07:06,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i [2024-10-10 22:07:06,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f454546f/0f4648b5e7e04506afa62dabcb6de4f8/FLAG16e8b452b [2024-10-10 22:07:06,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f454546f/0f4648b5e7e04506afa62dabcb6de4f8 [2024-10-10 22:07:06,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:07:06,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:07:06,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:07:06,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:07:06,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:07:06,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:07:06" (1/1) ... [2024-10-10 22:07:06,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71898b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:06, skipping insertion in model container [2024-10-10 22:07:06,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:07:06" (1/1) ... [2024-10-10 22:07:06,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:07:06,938 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i[1383,1396] [2024-10-10 22:07:06,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:07:06,972 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:07:06,995 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i[1383,1396] [2024-10-10 22:07:07,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:07:07,025 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:07:07,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07 WrapperNode [2024-10-10 22:07:07,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:07:07,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:07:07,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:07:07,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:07:07,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,064 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2024-10-10 22:07:07,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:07:07,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:07:07,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:07:07,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:07:07,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,104 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-10 22:07:07,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:07:07,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:07:07,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:07:07,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:07:07,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (1/1) ... [2024-10-10 22:07:07,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:07:07,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:07:07,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:07:07,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:07:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:07:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-10 22:07:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-10 22:07:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:07:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-10 22:07:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-10 22:07:07,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:07:07,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:07:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2024-10-10 22:07:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2024-10-10 22:07:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:07:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-10 22:07:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-10 22:07:07,310 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:07:07,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:07:07,812 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-10 22:07:07,812 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:07:07,851 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:07:07,851 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-10 22:07:07,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:07:07 BoogieIcfgContainer [2024-10-10 22:07:07,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:07:07,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:07:07,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:07:07,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:07:07,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:07:06" (1/3) ... [2024-10-10 22:07:07,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f57e4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:07:07, skipping insertion in model container [2024-10-10 22:07:07,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:07:07" (2/3) ... [2024-10-10 22:07:07,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f57e4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:07:07, skipping insertion in model container [2024-10-10 22:07:07,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:07:07" (3/3) ... [2024-10-10 22:07:07,863 INFO L112 eAbstractionObserver]: Analyzing ICFG mapavg5.i [2024-10-10 22:07:07,876 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:07:07,876 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:07:07,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:07:07,942 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;@4fbda32e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:07:07,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:07:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 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-10-10 22:07:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:07:07,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:07:07,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:07:07,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:07:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:07:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1630272060, now seen corresponding path program 1 times [2024-10-10 22:07:07,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:07:07,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528364204] [2024-10-10 22:07:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:07:07,981 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-10-10 22:07:07,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:07:07,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-10 22:07:07,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:07:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:07:08,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-10 22:07:08,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:07:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:07:08,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:07:08,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:07:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528364204] [2024-10-10 22:07:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528364204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:07:08,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:07:08,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:07:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234482848] [2024-10-10 22:07:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:07:08,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:07:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:07:08,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:07:08,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:07:08,401 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:07:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:07:08,561 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2024-10-10 22:07:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:07:08,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 26 [2024-10-10 22:07:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:07:08,573 INFO L225 Difference]: With dead ends: 41 [2024-10-10 22:07:08,573 INFO L226 Difference]: Without dead ends: 19 [2024-10-10 22:07:08,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:07:08,581 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:07:08,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:07:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-10 22:07:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-10 22:07:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:07:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-10 22:07:08,620 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 26 [2024-10-10 22:07:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:07:08,620 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-10 22:07:08,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:07:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-10 22:07:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:07:08,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:07:08,624 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:07:08,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:07:08,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-10 22:07:08,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:07:08,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:07:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash 970404386, now seen corresponding path program 1 times [2024-10-10 22:07:08,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:07:08,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487379539] [2024-10-10 22:07:08,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:07:08,829 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-10-10 22:07:08,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:07:08,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-10 22:07:08,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:07:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:07:09,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 22:07:09,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:07:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:07:23,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:07:23,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:07:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487379539] [2024-10-10 22:07:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487379539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:07:23,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:07:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-10 22:07:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410763942] [2024-10-10 22:07:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:07:23,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:07:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:07:23,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:07:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:07:23,762 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:07:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:07:47,650 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2024-10-10 22:07:47,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:07:47,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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) Word has length 26 [2024-10-10 22:07:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:07:47,663 INFO L225 Difference]: With dead ends: 40 [2024-10-10 22:07:47,663 INFO L226 Difference]: Without dead ends: 36 [2024-10-10 22:07:47,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:07:47,664 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:07:47,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-10-10 22:07:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-10 22:07:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2024-10-10 22:07:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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-10-10 22:07:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-10-10 22:07:47,675 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 26 [2024-10-10 22:07:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:07:47,676 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-10-10 22:07:47,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:07:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2024-10-10 22:07:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:07:47,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:07:47,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:07:47,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:07:47,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-10 22:07:47,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:07:47,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:07:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1647101286, now seen corresponding path program 1 times [2024-10-10 22:07:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:07:47,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864944687] [2024-10-10 22:07:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:07:47,880 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-10-10 22:07:47,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:07:47,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-10 22:07:47,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:07:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:07:48,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:07:48,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:07:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:07:48,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:07:48,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:07:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864944687] [2024-10-10 22:07:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864944687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:07:48,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:07:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:07:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697768672] [2024-10-10 22:07:48,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:07:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:07:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:07:48,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:07:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:07:48,226 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:07:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:07:48,400 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2024-10-10 22:07:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:07:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 27 [2024-10-10 22:07:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:07:48,402 INFO L225 Difference]: With dead ends: 54 [2024-10-10 22:07:48,402 INFO L226 Difference]: Without dead ends: 29 [2024-10-10 22:07:48,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:07:48,404 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 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.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:07:48,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:07:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-10 22:07:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-10 22:07:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 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-10-10 22:07:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2024-10-10 22:07:48,413 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 27 [2024-10-10 22:07:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:07:48,414 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-10-10 22:07:48,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:07:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2024-10-10 22:07:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:07:48,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:07:48,415 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:07:48,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:07:48,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-10 22:07:48,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:07:48,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:07:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -709458985, now seen corresponding path program 1 times [2024-10-10 22:07:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:07:48,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232718194] [2024-10-10 22:07:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:07:48,618 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-10-10 22:07:48,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:07:48,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-10 22:07:48,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:07:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:07:48,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:07:48,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:07:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:07:49,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:07:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:07:49,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:07:49,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232718194] [2024-10-10 22:07:49,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232718194] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:07:49,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:07:49,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-10 22:07:49,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049841380] [2024-10-10 22:07:49,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:07:49,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:07:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:07:49,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:07:49,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:07:49,203 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-10-10 22:07:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:07:49,525 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2024-10-10 22:07:49,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:07:49,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 28 [2024-10-10 22:07:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:07:49,527 INFO L225 Difference]: With dead ends: 55 [2024-10-10 22:07:49,527 INFO L226 Difference]: Without dead ends: 30 [2024-10-10 22:07:49,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:07:49,530 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:07:49,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:07:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-10 22:07:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-10 22:07:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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-10-10 22:07:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2024-10-10 22:07:49,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 28 [2024-10-10 22:07:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:07:49,538 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2024-10-10 22:07:49,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-10-10 22:07:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2024-10-10 22:07:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 22:07:49,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:07:49,539 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:07:49,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:07:49,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-10 22:07:49,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:07:49,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:07:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1707318726, now seen corresponding path program 2 times [2024-10-10 22:07:49,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:07:49,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224898885] [2024-10-10 22:07:49,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:07:49,741 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-10-10 22:07:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:07:49,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-10 22:07:49,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:07:49,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-10 22:07:49,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:07:49,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:07:49,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:07:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:07:50,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:07:50,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:07:50,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224898885] [2024-10-10 22:07:50,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224898885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:07:50,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:07:50,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:07:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153129888] [2024-10-10 22:07:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:07:50,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:07:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:07:50,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:07:50,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:07:50,085 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-10-10 22:07:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:07:50,291 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-10-10 22:07:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:07:50,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2024-10-10 22:07:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:07:50,295 INFO L225 Difference]: With dead ends: 43 [2024-10-10 22:07:50,295 INFO L226 Difference]: Without dead ends: 22 [2024-10-10 22:07:50,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:07:50,296 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 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.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:07:50,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:07:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-10 22:07:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-10 22:07:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:07:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-10 22:07:50,301 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 29 [2024-10-10 22:07:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:07:50,301 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-10 22:07:50,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-10-10 22:07:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-10 22:07:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:07:50,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:07:50,302 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:07:50,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:07:50,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-10 22:07:50,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:07:50,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:07:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1189276432, now seen corresponding path program 3 times [2024-10-10 22:07:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:07:50,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767626860] [2024-10-10 22:07:50,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:07:50,505 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-10-10 22:07:50,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:07:50,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-10 22:07:50,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:07:50,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 22:07:50,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:07:50,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:07:50,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:07:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:07:51,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:07:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:07:52,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:07:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767626860] [2024-10-10 22:07:52,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767626860] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:07:52,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:07:52,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-10-10 22:07:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319007075] [2024-10-10 22:07:52,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:07:52,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-10 22:07:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:07:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-10 22:07:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:07:52,120 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 22:07:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:07:53,345 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-10-10 22:07:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:07:53,346 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 31 [2024-10-10 22:07:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:07:53,347 INFO L225 Difference]: With dead ends: 57 [2024-10-10 22:07:53,347 INFO L226 Difference]: Without dead ends: 42 [2024-10-10 22:07:53,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:07:53,350 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:07:53,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 64 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 22:07:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-10 22:07:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2024-10-10 22:07:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:07:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-10 22:07:53,359 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 31 [2024-10-10 22:07:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:07:53,359 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-10 22:07:53,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 22:07:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-10 22:07:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 22:07:53,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:07:53,365 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:07:53,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:07:53,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-10 22:07:53,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:07:53,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:07:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1012663614, now seen corresponding path program 4 times [2024-10-10 22:07:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:07:53,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126999790] [2024-10-10 22:07:53,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:07:53,567 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-10-10 22:07:53,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:07:53,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-10 22:07:53,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Waiting until timeout for monitored process [2024-10-10 22:07:54,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:07:54,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:07:54,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:07:54,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:07:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:07:54,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:07:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-10 22:07:55,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:07:55,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126999790] [2024-10-10 22:07:55,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126999790] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:07:55,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:07:55,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-10 22:07:55,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686767999] [2024-10-10 22:07:55,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:07:55,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-10 22:07:55,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:07:55,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-10 22:07:55,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:07:55,401 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-10-10 22:07:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:07:56,131 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-10 22:07:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:07:56,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 34 [2024-10-10 22:07:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:07:56,132 INFO L225 Difference]: With dead ends: 56 [2024-10-10 22:07:56,133 INFO L226 Difference]: Without dead ends: 44 [2024-10-10 22:07:56,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:07:56,134 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 92 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:07:56,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 51 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:07:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-10 22:07:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 24. [2024-10-10 22:07:56,139 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-10-10 22:07:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-10 22:07:56,139 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 34 [2024-10-10 22:07:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:07:56,139 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-10 22:07:56,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-10-10 22:07:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-10 22:07:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:07:56,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:07:56,141 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:07:56,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Ended with exit code 0 [2024-10-10 22:07:56,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-10 22:07:56,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:07:56,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:07:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1815157912, now seen corresponding path program 1 times [2024-10-10 22:07:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:07:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157828127] [2024-10-10 22:07:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:07:56,343 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-10-10 22:07:56,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:07:56,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-10 22:07:56,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Waiting until timeout for monitored process