./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:40:53,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:40:53,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:40:53,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:40:53,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:40:53,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:40:53,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:40:53,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:40:53,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:40:53,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:40:53,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:40:53,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:40:53,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:40:53,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:40:53,723 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:40:53,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:40:53,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:40:53,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:40:53,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:40:53,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:40:53,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:40:53,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:40:53,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:40:53,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:40:53,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:40:53,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:40:53,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:40:53,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:40:53,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:40:53,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:40:53,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:40:53,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:40:53,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:40:53,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:40:53,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:40:53,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:40:53,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:40:53,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:40:53,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:40:53,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:40:53,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:40:53,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:40:53,743 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2024-10-11 00:40:53,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:40:54,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:40:54,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:40:54,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:40:54,055 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:40:54,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-10-11 00:40:55,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:40:55,863 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:40:55,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-10-11 00:40:55,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9aa2e6d50/db9146b672f3460aaea60611ba8bc745/FLAGee1b8246b [2024-10-11 00:40:56,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9aa2e6d50/db9146b672f3460aaea60611ba8bc745 [2024-10-11 00:40:56,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:40:56,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:40:56,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:40:56,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:40:56,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:40:56,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349d85a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56, skipping insertion in model container [2024-10-11 00:40:56,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:40:56,464 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c[1965,1978] [2024-10-11 00:40:56,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:40:56,477 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:40:56,499 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/float-newlib/double_req_bl_1250.c[1965,1978] [2024-10-11 00:40:56,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:40:56,517 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:40:56,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56 WrapperNode [2024-10-11 00:40:56,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:40:56,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:40:56,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:40:56,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:40:56,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,551 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-10-11 00:40:56,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:40:56,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:40:56,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:40:56,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:40:56,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,581 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-11 00:40:56,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:40:56,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:40:56,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:40:56,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:40:56,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (1/1) ... [2024-10-11 00:40:56,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:40:56,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:40:56,644 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-11 00:40:56,648 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-11 00:40:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:40:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:40:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 00:40:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 00:40:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-11 00:40:56,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-11 00:40:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 00:40:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 00:40:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:40:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:40:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 00:40:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 00:40:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 00:40:56,789 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:40:56,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:40:57,006 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 00:40:57,007 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:40:57,062 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:40:57,065 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 00:40:57,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:57 BoogieIcfgContainer [2024-10-11 00:40:57,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:40:57,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:40:57,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:40:57,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:40:57,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:40:56" (1/3) ... [2024-10-11 00:40:57,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a71bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:40:57, skipping insertion in model container [2024-10-11 00:40:57,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:56" (2/3) ... [2024-10-11 00:40:57,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a71bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:40:57, skipping insertion in model container [2024-10-11 00:40:57,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:57" (3/3) ... [2024-10-11 00:40:57,078 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2024-10-11 00:40:57,093 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:40:57,093 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:40:57,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:40:57,164 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;@4aa6a7cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:40:57,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:40:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:40:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:40:57,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:57,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:57,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:57,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1136836470, now seen corresponding path program 1 times [2024-10-11 00:40:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836112457] [2024-10-11 00:40:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 00:40:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:57,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:57,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836112457] [2024-10-11 00:40:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836112457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:57,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:57,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:40:57,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942261681] [2024-10-11 00:40:57,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:57,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:40:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:40:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:40:57,429 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:57,478 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2024-10-11 00:40:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:40:57,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 00:40:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:57,487 INFO L225 Difference]: With dead ends: 42 [2024-10-11 00:40:57,487 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 00:40:57,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 00:40:57,493 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:57,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 00:40:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 00:40:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:40:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-11 00:40:57,532 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 12 [2024-10-11 00:40:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:57,532 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-11 00:40:57,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-10-11 00:40:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 00:40:57,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:57,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:40:57,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:57,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:57,539 INFO L85 PathProgramCache]: Analyzing trace with hash 675730551, now seen corresponding path program 1 times [2024-10-11 00:40:57,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:57,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112146456] [2024-10-11 00:40:57,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:57,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 00:40:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112146456] [2024-10-11 00:40:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112146456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:40:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34990578] [2024-10-11 00:40:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:57,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:40:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:40:57,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:57,850 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:57,899 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-10-11 00:40:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:40:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 00:40:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:57,903 INFO L225 Difference]: With dead ends: 28 [2024-10-11 00:40:57,903 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 00:40:57,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:57,906 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:57,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 00:40:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 00:40:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 00:40:57,916 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-10-11 00:40:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:57,917 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 00:40:57,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 00:40:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 00:40:57,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:57,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:57,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:40:57,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:57,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:57,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1007705357, now seen corresponding path program 1 times [2024-10-11 00:40:57,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:57,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218681971] [2024-10-11 00:40:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 00:40:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:58,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:58,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218681971] [2024-10-11 00:40:58,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218681971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:58,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:58,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:40:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097683816] [2024-10-11 00:40:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:58,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:40:58,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:58,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:40:58,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:58,081 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:58,116 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-11 00:40:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:40:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 00:40:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:58,118 INFO L225 Difference]: With dead ends: 32 [2024-10-11 00:40:58,118 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 00:40:58,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:58,120 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:58,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 00:40:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-11 00:40:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 00:40:58,126 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 14 [2024-10-11 00:40:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:58,127 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 00:40:58,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 00:40:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 00:40:58,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:58,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:40:58,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:58,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1021663091, now seen corresponding path program 1 times [2024-10-11 00:40:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599199774] [2024-10-11 00:40:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:58,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 00:40:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:58,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599199774] [2024-10-11 00:40:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599199774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:40:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917950333] [2024-10-11 00:40:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:58,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:40:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:58,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:40:58,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:58,258 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:58,309 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-11 00:40:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:40:58,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 00:40:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:58,311 INFO L225 Difference]: With dead ends: 32 [2024-10-11 00:40:58,311 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 00:40:58,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:58,312 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:58,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 00:40:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-11 00:40:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 00:40:58,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2024-10-11 00:40:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 00:40:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 00:40:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 00:40:58,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:58,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:40:58,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:58,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2111117713, now seen corresponding path program 1 times [2024-10-11 00:40:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989455095] [2024-10-11 00:40:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 00:40:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989455095] [2024-10-11 00:40:58,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989455095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:58,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:58,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:40:58,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515633355] [2024-10-11 00:40:58,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:58,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:40:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:58,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:40:58,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:58,475 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:58,522 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-11 00:40:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:40:58,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 00:40:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:58,525 INFO L225 Difference]: With dead ends: 32 [2024-10-11 00:40:58,525 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 00:40:58,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:58,526 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:58,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 00:40:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-11 00:40:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 00:40:58,538 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2024-10-11 00:40:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:58,539 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 00:40:58,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 00:40:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 00:40:58,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:58,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:58,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 00:40:58,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:58,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:58,544 INFO L85 PathProgramCache]: Analyzing trace with hash -368307378, now seen corresponding path program 1 times [2024-10-11 00:40:58,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:58,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781354492] [2024-10-11 00:40:58,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:58,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:40:58,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 00:40:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:40:58,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 00:40:58,612 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 00:40:58,613 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:40:58,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 00:40:58,618 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 00:40:58,639 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:40:58,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:40:58 BoogieIcfgContainer [2024-10-11 00:40:58,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:40:58,649 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:40:58,649 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:40:58,649 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:40:58,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:57" (3/4) ... [2024-10-11 00:40:58,652 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 00:40:58,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:40:58,654 INFO L158 Benchmark]: Toolchain (without parser) took 2418.62ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 91.8MB in the beginning and 103.0MB in the end (delta: -11.2MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-10-11 00:40:58,654 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory was 114.0MB in the beginning and 113.9MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:40:58,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.92ms. Allocated memory is still 146.8MB. Free memory was 91.8MB in the beginning and 78.8MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 00:40:58,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.86ms. Allocated memory is still 146.8MB. Free memory was 78.8MB in the beginning and 77.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:40:58,655 INFO L158 Benchmark]: Boogie Preprocessor took 51.23ms. Allocated memory is still 146.8MB. Free memory was 77.5MB in the beginning and 75.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:40:58,655 INFO L158 Benchmark]: RCFGBuilder took 460.45ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 75.3MB in the beginning and 200.6MB in the end (delta: -125.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-11 00:40:58,655 INFO L158 Benchmark]: TraceAbstraction took 1580.65ms. Allocated memory is still 230.7MB. Free memory was 199.9MB in the beginning and 103.0MB in the end (delta: 96.9MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2024-10-11 00:40:58,656 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 230.7MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:40:58,659 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.22ms. Allocated memory is still 146.8MB. Free memory was 114.0MB in the beginning and 113.9MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.92ms. Allocated memory is still 146.8MB. Free memory was 91.8MB in the beginning and 78.8MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.86ms. Allocated memory is still 146.8MB. Free memory was 78.8MB in the beginning and 77.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.23ms. Allocated memory is still 146.8MB. Free memory was 77.5MB in the beginning and 75.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 460.45ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 75.3MB in the beginning and 200.6MB in the end (delta: -125.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1580.65ms. Allocated memory is still 230.7MB. Free memory was 199.9MB in the beginning and 103.0MB in the end (delta: 96.9MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 230.7MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 74]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 18, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L69] double x = 0.0 / 0.0; [L70] double y = 0.0 / 0.0; [L71] CALL, EXPR fmax_double(x, y) [L57] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967306] [L29] __uint32_t msw, lsw; VAL [\old(x)=4294967306, x=4294967306] [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; VAL [\old(x)=4294967306, \result=0, x=4294967306] [L57] RET, EXPR __fpclassify_double(x) VAL [x=4294967306] [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; VAL [\result=4294967307, x=4294967306] [L71] RET, EXPR fmax_double(x, y) [L71] double res = fmax_double(x, y); [L73] CALL, EXPR isnan_double(res) [L18] return x != x; [L73] RET, EXPR isnan_double(res) [L73] COND TRUE !isnan_double(res) [L74] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 123 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 00:40:58,688 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/float-newlib/double_req_bl_1250.c -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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:41:01,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:41:01,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 00:41:01,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:41:01,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:41:01,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:41:01,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:41:01,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:41:01,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:41:01,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:41:01,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:41:01,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:41:01,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:41:01,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:41:01,152 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:41:01,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:41:01,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:41:01,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:41:01,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:41:01,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:41:01,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:41:01,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:41:01,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:41:01,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 00:41:01,161 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 00:41:01,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:41:01,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 00:41:01,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:41:01,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:41:01,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:41:01,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:41:01,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:41:01,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:41:01,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:41:01,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:41:01,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:41:01,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:41:01,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:41:01,166 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 00:41:01,167 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 00:41:01,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:41:01,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:41:01,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:41:01,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:41:01,168 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 00:41:01,168 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2024-10-11 00:41:01,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:41:01,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:41:01,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:41:01,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:41:01,542 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:41:01,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-10-11 00:41:03,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:41:03,431 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:41:03,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2024-10-11 00:41:03,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce266dd53/7756169fdcec4108b67929d75cd3630f/FLAG80bb338cd [2024-10-11 00:41:03,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce266dd53/7756169fdcec4108b67929d75cd3630f [2024-10-11 00:41:03,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:41:03,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:41:03,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:41:03,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:41:03,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:41:03,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:41:03" (1/1) ... [2024-10-11 00:41:03,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e1b172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:03, skipping insertion in model container [2024-10-11 00:41:03,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:41:03" (1/1) ... [2024-10-11 00:41:03,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:41:04,040 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/float-newlib/double_req_bl_1250.c[1965,1978] [2024-10-11 00:41:04,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:41:04,062 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:41:04,097 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/float-newlib/double_req_bl_1250.c[1965,1978] [2024-10-11 00:41:04,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:41:04,129 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:41:04,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04 WrapperNode [2024-10-11 00:41:04,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:41:04,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:41:04,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:41:04,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:41:04,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,173 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2024-10-11 00:41:04,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:41:04,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:41:04,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:41:04,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:41:04,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,222 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-11 00:41:04,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:41:04,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:41:04,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:41:04,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:41:04,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (1/1) ... [2024-10-11 00:41:04,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:41:04,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:41:04,309 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-11 00:41:04,319 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-11 00:41:04,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:41:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 00:41:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 00:41:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 00:41:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 00:41:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 00:41:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-11 00:41:04,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-11 00:41:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 00:41:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 00:41:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:41:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:41:04,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 00:41:04,483 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:41:04,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:41:04,720 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 00:41:04,720 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:41:04,762 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:41:04,762 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 00:41:04,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:04 BoogieIcfgContainer [2024-10-11 00:41:04,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:41:04,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:41:04,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:41:04,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:41:04,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:41:03" (1/3) ... [2024-10-11 00:41:04,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b3db4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:41:04, skipping insertion in model container [2024-10-11 00:41:04,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:04" (2/3) ... [2024-10-11 00:41:04,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b3db4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:41:04, skipping insertion in model container [2024-10-11 00:41:04,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:04" (3/3) ... [2024-10-11 00:41:04,771 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2024-10-11 00:41:04,789 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:41:04,790 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:41:04,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:41:04,865 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;@48cb5633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:41:04,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:41:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:41:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 00:41:04,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:04,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:04,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1389439651, now seen corresponding path program 1 times [2024-10-11 00:41:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:04,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387778010] [2024-10-11 00:41:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:04,913 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-11 00:41:04,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:04,918 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-11 00:41:04,919 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-11 00:41:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:05,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 00:41:05,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:41:05,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:05,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387778010] [2024-10-11 00:41:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387778010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:41:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358345556] [2024-10-11 00:41:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:05,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:41:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:05,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:41:05,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:41:05,091 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:05,116 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2024-10-11 00:41:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:41:05,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 00:41:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:05,135 INFO L225 Difference]: With dead ends: 38 [2024-10-11 00:41:05,136 INFO L226 Difference]: Without dead ends: 18 [2024-10-11 00:41:05,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-11 00:41:05,142 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:05,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-11 00:41:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-11 00:41:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:41:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-11 00:41:05,174 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 11 [2024-10-11 00:41:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:05,175 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-11 00:41:05,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-10-11 00:41:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:41:05,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:05,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:05,185 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 (2)] Ended with exit code 0 [2024-10-11 00:41:05,378 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-11 00:41:05,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:05,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash 169183490, now seen corresponding path program 1 times [2024-10-11 00:41:05,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:05,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953285270] [2024-10-11 00:41:05,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:05,380 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-11 00:41:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:05,384 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-11 00:41:05,386 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-11 00:41:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:05,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:05,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:41:05,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:05,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953285270] [2024-10-11 00:41:05,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953285270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:05,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:05,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:05,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581029478] [2024-10-11 00:41:05,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:05,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:05,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:05,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:05,531 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:05,566 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-11 00:41:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 00:41:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:05,570 INFO L225 Difference]: With dead ends: 25 [2024-10-11 00:41:05,570 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 00:41:05,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:05,572 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:05,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 00:41:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 00:41:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:41:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-11 00:41:05,584 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 12 [2024-10-11 00:41:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:05,584 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-11 00:41:05,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-11 00:41:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 00:41:05,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:05,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:05,593 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-11 00:41:05,787 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-11 00:41:05,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:05,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1541297030, now seen corresponding path program 1 times [2024-10-11 00:41:05,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:05,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405982053] [2024-10-11 00:41:05,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:05,790 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-11 00:41:05,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:05,791 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-11 00:41:05,792 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-11 00:41:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:05,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:05,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:41:05,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:05,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:05,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405982053] [2024-10-11 00:41:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405982053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:05,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:05,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974845396] [2024-10-11 00:41:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:05,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:05,876 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:05,900 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-11 00:41:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:05,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 00:41:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:05,901 INFO L225 Difference]: With dead ends: 28 [2024-10-11 00:41:05,901 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 00:41:05,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:05,903 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 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-11 00:41:05,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 00:41:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-11 00:41:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:41:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-11 00:41:05,908 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 13 [2024-10-11 00:41:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:05,909 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-11 00:41:05,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-11 00:41:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 00:41:05,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:05,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:05,915 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-11 00:41:06,110 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-11 00:41:06,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:06,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:06,111 INFO L85 PathProgramCache]: Analyzing trace with hash 382191238, now seen corresponding path program 1 times [2024-10-11 00:41:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:06,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502602244] [2024-10-11 00:41:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:06,112 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-11 00:41:06,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:06,119 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-11 00:41:06,122 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-11 00:41:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:06,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:06,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:41:06,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:06,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502602244] [2024-10-11 00:41:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502602244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:06,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742787662] [2024-10-11 00:41:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:06,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:06,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:06,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:06,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:06,228 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:06,343 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-11 00:41:06,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:06,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 00:41:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:06,350 INFO L225 Difference]: With dead ends: 28 [2024-10-11 00:41:06,351 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 00:41:06,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:06,352 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:06,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:41:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 00:41:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-11 00:41:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:41:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-11 00:41:06,364 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 14 [2024-10-11 00:41:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:06,364 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-11 00:41:06,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-11 00:41:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 00:41:06,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:06,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:06,374 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-11 00:41:06,570 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-11 00:41:06,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1935302518, now seen corresponding path program 1 times [2024-10-11 00:41:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056242580] [2024-10-11 00:41:06,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:06,573 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-11 00:41:06,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:06,576 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-11 00:41:06,578 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-11 00:41:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:06,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:06,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:41:06,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:06,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:06,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056242580] [2024-10-11 00:41:06,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056242580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:06,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:06,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:06,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952917818] [2024-10-11 00:41:06,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:06,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:06,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:06,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:06,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:06,689 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:06,751 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-10-11 00:41:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 00:41:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:06,754 INFO L225 Difference]: With dead ends: 28 [2024-10-11 00:41:06,754 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 00:41:06,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:06,756 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:06,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:41:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 00:41:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-11 00:41:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:41:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2024-10-11 00:41:06,763 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 15 [2024-10-11 00:41:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:06,764 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2024-10-11 00:41:06,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2024-10-11 00:41:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 00:41:06,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:06,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:06,771 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 (6)] Ended with exit code 0 [2024-10-11 00:41:06,965 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-11 00:41:06,966 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:06,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1047798837, now seen corresponding path program 1 times [2024-10-11 00:41:06,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:06,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288095789] [2024-10-11 00:41:06,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:06,967 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-11 00:41:06,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:06,968 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-11 00:41:06,970 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-11 00:41:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:07,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 00:41:07,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:41:07,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:07,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288095789] [2024-10-11 00:41:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288095789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:07,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:41:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201648451] [2024-10-11 00:41:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:07,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:41:07,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:07,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:41:07,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:41:07,145 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:07,206 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-11 00:41:07,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:41:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 00:41:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:07,208 INFO L225 Difference]: With dead ends: 25 [2024-10-11 00:41:07,208 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 00:41:07,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:41:07,209 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:07,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:41:07,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 00:41:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-11 00:41:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:41:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-11 00:41:07,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 15 [2024-10-11 00:41:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:07,219 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-11 00:41:07,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-11 00:41:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 00:41:07,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:07,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:07,227 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-11 00:41:07,422 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-11 00:41:07,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:07,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:07,423 INFO L85 PathProgramCache]: Analyzing trace with hash -391505825, now seen corresponding path program 1 times [2024-10-11 00:41:07,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:07,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162168298] [2024-10-11 00:41:07,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:07,424 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-11 00:41:07,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:07,426 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-11 00:41:07,427 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-11 00:41:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:07,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:07,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 00:41:07,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:07,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162168298] [2024-10-11 00:41:07,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162168298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:07,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:07,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:07,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684680254] [2024-10-11 00:41:07,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:07,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:07,561 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:07,588 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-11 00:41:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:07,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-11 00:41:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:07,589 INFO L225 Difference]: With dead ends: 25 [2024-10-11 00:41:07,589 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 00:41:07,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:07,590 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:07,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 00:41:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 00:41:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 00:41:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-11 00:41:07,597 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 20 [2024-10-11 00:41:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:07,598 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-11 00:41:07,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-11 00:41:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 00:41:07,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:07,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:07,607 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 (8)] Forceful destruction successful, exit code 0 [2024-10-11 00:41:07,801 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-11 00:41:07,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:07,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1279023809, now seen corresponding path program 1 times [2024-10-11 00:41:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121390442] [2024-10-11 00:41:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:07,803 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-11 00:41:07,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:07,806 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-11 00:41:07,807 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 [2024-10-11 00:41:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:07,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:07,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 00:41:07,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:07,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:07,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121390442] [2024-10-11 00:41:07,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121390442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:07,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:07,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:07,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099745240] [2024-10-11 00:41:07,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:07,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:07,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:07,918 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:07,941 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-11 00:41:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:07,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 00:41:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:07,943 INFO L225 Difference]: With dead ends: 27 [2024-10-11 00:41:07,943 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 00:41:07,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:07,944 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:07,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 00:41:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-11 00:41:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 00:41:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-11 00:41:07,949 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 21 [2024-10-11 00:41:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:07,949 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-11 00:41:07,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-11 00:41:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 00:41:07,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:07,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:07,960 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 (9)] Forceful destruction successful, exit code 0 [2024-10-11 00:41:08,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-11 00:41:08,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:08,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash 780882339, now seen corresponding path program 1 times [2024-10-11 00:41:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998270916] [2024-10-11 00:41:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:08,153 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-11 00:41:08,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:08,156 INFO L229 MonitoredProcess]: Starting monitored process 10 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-11 00:41:08,157 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 (10)] Waiting until timeout for monitored process [2024-10-11 00:41:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:08,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:08,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 00:41:08,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:08,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:08,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998270916] [2024-10-11 00:41:08,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998270916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:08,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:08,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869873960] [2024-10-11 00:41:08,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:08,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:08,273 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:08,291 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-11 00:41:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:08,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-11 00:41:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:08,292 INFO L225 Difference]: With dead ends: 27 [2024-10-11 00:41:08,293 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 00:41:08,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:08,293 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:08,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 00:41:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-11 00:41:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 00:41:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-11 00:41:08,298 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2024-10-11 00:41:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:08,298 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-11 00:41:08,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-11 00:41:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 00:41:08,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:08,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:08,307 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 (10)] Forceful destruction successful, exit code 0 [2024-10-11 00:41:08,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-11 00:41:08,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1773413381, now seen corresponding path program 1 times [2024-10-11 00:41:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175739352] [2024-10-11 00:41:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:08,501 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-11 00:41:08,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:08,502 INFO L229 MonitoredProcess]: Starting monitored process 11 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-11 00:41:08,505 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 (11)] Waiting until timeout for monitored process [2024-10-11 00:41:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:08,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:08,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 00:41:08,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:08,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175739352] [2024-10-11 00:41:08,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175739352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:08,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:08,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229105110] [2024-10-11 00:41:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:08,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:08,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:08,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:08,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:08,616 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:08,645 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-11 00:41:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:08,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-11 00:41:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:08,647 INFO L225 Difference]: With dead ends: 27 [2024-10-11 00:41:08,647 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 00:41:08,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:08,648 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:08,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 00:41:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-11 00:41:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 00:41:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-11 00:41:08,670 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-10-11 00:41:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:08,671 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-11 00:41:08,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-11 00:41:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 00:41:08,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:08,672 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:08,677 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 (11)] Forceful destruction successful, exit code 0 [2024-10-11 00:41:08,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-11 00:41:08,872 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:08,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1634050234, now seen corresponding path program 1 times [2024-10-11 00:41:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:08,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359814081] [2024-10-11 00:41:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:08,874 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-11 00:41:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:08,875 INFO L229 MonitoredProcess]: Starting monitored process 12 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-11 00:41:08,876 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 (12)] Waiting until timeout for monitored process [2024-10-11 00:41:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:08,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 00:41:08,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 00:41:09,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:09,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359814081] [2024-10-11 00:41:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359814081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:09,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:09,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:41:09,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877778426] [2024-10-11 00:41:09,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:09,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:41:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:09,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:41:09,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:41:09,072 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:09,102 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-10-11 00:41:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:41:09,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-11 00:41:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:09,104 INFO L225 Difference]: With dead ends: 20 [2024-10-11 00:41:09,104 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 00:41:09,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:41:09,105 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:09,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 00:41:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 00:41:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:41:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 00:41:09,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-10-11 00:41:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:09,106 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 00:41:09,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 00:41:09,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 00:41:09,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:41:09,116 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 (12)] Forceful destruction successful, exit code 0 [2024-10-11 00:41:09,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-11 00:41:09,316 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:09,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 00:41:09,372 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:41:09,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:41:09 BoogieIcfgContainer [2024-10-11 00:41:09,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:41:09,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:41:09,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:41:09,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:41:09,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:04" (3/4) ... [2024-10-11 00:41:09,388 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 00:41:09,391 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-10-11 00:41:09,396 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-11 00:41:09,397 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 00:41:09,398 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 00:41:09,398 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 00:41:09,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 00:41:09,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 00:41:09,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:41:09,497 INFO L158 Benchmark]: Toolchain (without parser) took 5721.89ms. Allocated memory is still 86.0MB. Free memory was 64.3MB in the beginning and 44.6MB in the end (delta: 19.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-10-11 00:41:09,497 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 28.3MB in the beginning and 28.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:41:09,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.55ms. Allocated memory is still 86.0MB. Free memory was 64.1MB in the beginning and 50.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 00:41:09,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.56ms. Allocated memory is still 86.0MB. Free memory was 50.6MB in the beginning and 49.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:41:09,498 INFO L158 Benchmark]: Boogie Preprocessor took 85.64ms. Allocated memory is still 86.0MB. Free memory was 49.0MB in the beginning and 46.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:41:09,498 INFO L158 Benchmark]: RCFGBuilder took 498.10ms. Allocated memory is still 86.0MB. Free memory was 46.7MB in the beginning and 54.8MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 00:41:09,498 INFO L158 Benchmark]: TraceAbstraction took 4618.74ms. Allocated memory is still 86.0MB. Free memory was 54.1MB in the beginning and 49.4MB in the end (delta: 4.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-10-11 00:41:09,499 INFO L158 Benchmark]: Witness Printer took 111.56ms. Allocated memory is still 86.0MB. Free memory was 49.4MB in the beginning and 44.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 00:41:09,501 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.21ms. Allocated memory is still 56.6MB. Free memory was 28.3MB in the beginning and 28.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.55ms. Allocated memory is still 86.0MB. Free memory was 64.1MB in the beginning and 50.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.56ms. Allocated memory is still 86.0MB. Free memory was 50.6MB in the beginning and 49.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.64ms. Allocated memory is still 86.0MB. Free memory was 49.0MB in the beginning and 46.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.10ms. Allocated memory is still 86.0MB. Free memory was 46.7MB in the beginning and 54.8MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4618.74ms. Allocated memory is still 86.0MB. Free memory was 54.1MB in the beginning and 49.4MB in the end (delta: 4.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Witness Printer took 111.56ms. Allocated memory is still 86.0MB. Free memory was 49.4MB in the beginning and 44.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 74]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 242 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=2, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 178 ConstructedInterpolants, 8 QuantifiedInterpolants, 278 SizeOfPredicates, 2 NumberOfNonLiveVariables, 681 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-11 00:41:09,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE