./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:39:22,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:39:23,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:39:23,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:39:23,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:39:23,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:39:23,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:39:23,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:39:23,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:39:23,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:39:23,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:39:23,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:39:23,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:39:23,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:39:23,083 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:39:23,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:39:23,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:39:23,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:39:23,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:39:23,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:39:23,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:39:23,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:39:23,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:39:23,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:39:23,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:39:23,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:39:23,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:39:23,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:39:23,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:39:23,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:39:23,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:39:23,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:39:23,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:23,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:39:23,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:39:23,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:39:23,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:39:23,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:39:23,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:39:23,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:39:23,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:39:23,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:39:23,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 [2024-11-12 07:39:23,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:39:23,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:39:23,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:39:23,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:39:23,359 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:39:23,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2024-11-12 07:39:24,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:39:24,933 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:39:24,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2024-11-12 07:39:24,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9436adac2/b303256bd62c428a81d79ae22cd20d2f/FLAG7338a6ef1 [2024-11-12 07:39:24,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9436adac2/b303256bd62c428a81d79ae22cd20d2f [2024-11-12 07:39:24,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:39:24,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:39:24,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:24,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:39:24,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:39:24,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:24" (1/1) ... [2024-11-12 07:39:24,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61391c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:24, skipping insertion in model container [2024-11-12 07:39:24,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:24" (1/1) ... [2024-11-12 07:39:24,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:39:25,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i[916,929] [2024-11-12 07:39:25,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:25,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:39:25,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i[916,929] [2024-11-12 07:39:25,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:25,296 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:39:25,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25 WrapperNode [2024-11-12 07:39:25,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:25,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:25,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:39:25,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:39:25,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,360 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-11-12 07:39:25,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:25,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:39:25,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:39:25,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:39:25,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,413 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:39:25,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:39:25,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:39:25,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:39:25,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:39:25,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (1/1) ... [2024-11-12 07:39:25,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:25,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:39:25,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:39:25,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:39:25,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:39:25,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:39:25,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:39:25,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:39:25,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:39:25,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:39:25,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:39:25,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:39:25,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:39:25,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:39:25,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:39:25,681 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:39:25,683 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:39:26,273 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-12 07:39:26,274 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:39:26,300 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:39:26,301 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:39:26,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:26 BoogieIcfgContainer [2024-11-12 07:39:26,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:39:26,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:39:26,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:39:26,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:39:26,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:39:24" (1/3) ... [2024-11-12 07:39:26,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd4fe08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:26, skipping insertion in model container [2024-11-12 07:39:26,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:25" (2/3) ... [2024-11-12 07:39:26,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd4fe08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:26, skipping insertion in model container [2024-11-12 07:39:26,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:26" (3/3) ... [2024-11-12 07:39:26,313 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-26.i [2024-11-12 07:39:26,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:39:26,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:39:26,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:39:26,402 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;@318935bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:39:26,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:39:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:26,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:26,420 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:26,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:26,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:26,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1902283919, now seen corresponding path program 1 times [2024-11-12 07:39:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:26,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872713394] [2024-11-12 07:39:26,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:39:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:26,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872713394] [2024-11-12 07:39:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872713394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:26,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:39:26,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003293668] [2024-11-12 07:39:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:26,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:39:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:26,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:39:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:26,925 INFO L87 Difference]: Start difference. First operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:26,958 INFO L93 Difference]: Finished difference Result 179 states and 271 transitions. [2024-11-12 07:39:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:39:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-12 07:39:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:26,968 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:39:26,968 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 07:39:26,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:26,978 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:26,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 07:39:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 07:39:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-12 07:39:27,030 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2024-11-12 07:39:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:27,031 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-12 07:39:27,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-12 07:39:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:27,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:27,037 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:27,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:39:27,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:27,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:27,039 INFO L85 PathProgramCache]: Analyzing trace with hash -49370623, now seen corresponding path program 1 times [2024-11-12 07:39:27,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:27,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883827641] [2024-11-12 07:39:27,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:27,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:39:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:27,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883827641] [2024-11-12 07:39:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883827641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:27,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:27,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:39:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893993442] [2024-11-12 07:39:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:27,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:27,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:27,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:27,479 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:27,525 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2024-11-12 07:39:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:27,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-12 07:39:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:27,529 INFO L225 Difference]: With dead ends: 178 [2024-11-12 07:39:27,529 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 07:39:27,530 INFO L434 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-11-12 07:39:27,531 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:27,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 07:39:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-12 07:39:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-12 07:39:27,542 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2024-11-12 07:39:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:27,544 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-12 07:39:27,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-12 07:39:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:27,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:27,545 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:27,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:39:27,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:27,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash -47523581, now seen corresponding path program 1 times [2024-11-12 07:39:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553419157] [2024-11-12 07:39:27,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:39:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:27,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:27,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553419157] [2024-11-12 07:39:27,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553419157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:27,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:27,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405049326] [2024-11-12 07:39:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:27,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:27,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:27,926 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:27,953 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2024-11-12 07:39:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-12 07:39:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:27,957 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:39:27,957 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 07:39:27,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:27,959 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:27,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 07:39:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 07:39:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-12 07:39:27,977 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 89 [2024-11-12 07:39:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:27,980 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-12 07:39:27,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-12 07:39:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:27,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:27,985 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:27,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:39:27,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:27,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -865172031, now seen corresponding path program 1 times [2024-11-12 07:39:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205619539] [2024-11-12 07:39:27,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:27,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:39:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205619539] [2024-11-12 07:39:28,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205619539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:28,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:28,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:39:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811536229] [2024-11-12 07:39:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:28,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:28,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:28,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:28,378 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:28,511 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2024-11-12 07:39:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:28,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-12 07:39:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:28,513 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:39:28,513 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 07:39:28,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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-11-12 07:39:28,515 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:28,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:39:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 07:39:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 07:39:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2024-11-12 07:39:28,525 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 89 [2024-11-12 07:39:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:28,526 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2024-11-12 07:39:28,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2024-11-12 07:39:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:28,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:28,528 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:28,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:39:28,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:28,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1876289281, now seen corresponding path program 1 times [2024-11-12 07:39:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:28,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251025788] [2024-11-12 07:39:28,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:39:28,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364723175] [2024-11-12 07:39:28,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:28,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:39:28,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:28,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:39:28,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:39:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:39:29,524 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:39:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:39:29,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:39:29,860 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:39:29,861 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:39:29,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:39:30,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:39:30,069 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 07:39:30,129 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:39:30,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:39:30 BoogieIcfgContainer [2024-11-12 07:39:30,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:39:30,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:39:30,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:39:30,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:39:30,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:26" (3/4) ... [2024-11-12 07:39:30,136 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:39:30,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:39:30,137 INFO L158 Benchmark]: Toolchain (without parser) took 5175.23ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 92.0MB in the beginning and 58.2MB in the end (delta: 33.8MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-11-12 07:39:30,138 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory was 106.4MB in the beginning and 106.2MB in the end (delta: 181.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:39:30,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.01ms. Allocated memory is still 146.8MB. Free memory was 91.7MB in the beginning and 73.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 07:39:30,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.63ms. Allocated memory is still 146.8MB. Free memory was 73.6MB in the beginning and 69.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:39:30,138 INFO L158 Benchmark]: Boogie Preprocessor took 112.32ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 69.0MB in the beginning and 170.7MB in the end (delta: -101.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-12 07:39:30,139 INFO L158 Benchmark]: RCFGBuilder took 828.09ms. Allocated memory is still 201.3MB. Free memory was 170.7MB in the beginning and 135.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-12 07:39:30,139 INFO L158 Benchmark]: TraceAbstraction took 3827.00ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 59.3MB in the end (delta: 74.7MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-11-12 07:39:30,140 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 201.3MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:39:30,141 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory was 106.4MB in the beginning and 106.2MB in the end (delta: 181.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.01ms. Allocated memory is still 146.8MB. Free memory was 91.7MB in the beginning and 73.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.63ms. Allocated memory is still 146.8MB. Free memory was 73.6MB in the beginning and 69.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.32ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 69.0MB in the beginning and 170.7MB in the end (delta: -101.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * RCFGBuilder took 828.09ms. Allocated memory is still 201.3MB. Free memory was 170.7MB in the beginning and 135.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3827.00ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 59.3MB in the end (delta: 74.7MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 201.3MB. Free memory is still 58.2MB. 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: 19]: 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 someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L47] unsigned char last_1_WrapperStruct00_var_1_15 = 64; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_15=64] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L83] EXPR WrapperStruct00.var_1_15 [L83] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L93] RET updateLastVariables() [L94] CALL updateVariables() [L67] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L68] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L68] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L68] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L70] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L72] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L73] EXPR WrapperStruct00.var_1_14 [L73] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L73] EXPR WrapperStruct00.var_1_14 [L73] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L74] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L75] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L75] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L75] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L77] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L78] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L94] RET updateVariables() [L95] CALL step() [L51] EXPR WrapperStruct00.var_1_13 [L51] EXPR WrapperStruct00.var_1_14 [L51] WrapperStruct00.var_1_12 = ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) [L52] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L52] COND FALSE !((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) [L55] EXPR WrapperStruct00.var_1_13 [L55] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_13 [L56] EXPR WrapperStruct00.var_1_20 [L56] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L56] COND TRUE WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20 [L57] EXPR WrapperStruct00.var_1_15 [L57] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L57] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L57] EXPR WrapperStruct00.var_1_15 [L57] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L57] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) [L61] EXPR WrapperStruct00.var_1_15 [L61] EXPR WrapperStruct00.var_1_15 [L61] EXPR WrapperStruct00.var_1_1 [L61] signed long int stepLocal_0 = WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1); [L62] EXPR WrapperStruct00.var_1_15 [L62] EXPR WrapperStruct00.var_1_1 [L62] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64, stepLocal_0=192] [L62] COND FALSE !(stepLocal_0 != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR WrapperStruct00.var_1_20 [L86] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))))))) [L86] EXPR WrapperStruct00.var_1_1 [L86] EXPR WrapperStruct00.var_1_15 [L86] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L86] EXPR WrapperStruct00.var_1_15 [L86] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14))) [L86] EXPR WrapperStruct00.var_1_12 [L86] EXPR WrapperStruct00.var_1_13 [L86] EXPR WrapperStruct00.var_1_14 [L86] EXPR ((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86-L87] return (((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_13)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1037 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 539 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 498 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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-11-12 07:39:30,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:39:32,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:39:32,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:39:32,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:39:32,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:39:32,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:39:32,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:39:32,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:39:32,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:39:32,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:39:32,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:39:32,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:39:32,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:39:32,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:39:32,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:39:32,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:39:32,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:39:32,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:39:32,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:39:32,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:39:32,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:39:32,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:39:32,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:39:32,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:39:32,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:39:32,445 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:39:32,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:39:32,445 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:39:32,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:39:32,446 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:39:32,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:39:32,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:39:32,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:39:32,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:39:32,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:32,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:39:32,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:39:32,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:39:32,450 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:39:32,450 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:39:32,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:39:32,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:39:32,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:39:32,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:39:32,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 [2024-11-12 07:39:32,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:39:32,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:39:32,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:39:32,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:39:32,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:39:32,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2024-11-12 07:39:34,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:39:34,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:39:34,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2024-11-12 07:39:34,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ce5cc66/6924abef1bc74e08b3f4416628946a7f/FLAGa41a8194d [2024-11-12 07:39:34,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ce5cc66/6924abef1bc74e08b3f4416628946a7f [2024-11-12 07:39:34,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:39:34,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:39:34,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:34,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:39:34,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:39:34,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:34" (1/1) ... [2024-11-12 07:39:34,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737c784c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:34, skipping insertion in model container [2024-11-12 07:39:35,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:34" (1/1) ... [2024-11-12 07:39:35,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:39:35,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i[916,929] [2024-11-12 07:39:35,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:35,319 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:39:35,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i[916,929] [2024-11-12 07:39:35,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:35,423 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:39:35,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35 WrapperNode [2024-11-12 07:39:35,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:35,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:35,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:39:35,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:39:35,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,508 INFO L138 Inliner]: procedures = 37, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2024-11-12 07:39:35,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:35,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:39:35,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:39:35,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:39:35,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,564 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 22 writes are split as follows [0, 22]. [2024-11-12 07:39:35,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:39:35,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:39:35,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:39:35,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:39:35,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (1/1) ... [2024-11-12 07:39:35,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:35,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:39:35,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:39:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:39:35,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:39:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:39:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:39:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:39:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:39:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:39:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:39:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:39:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:39:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:39:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:39:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:39:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:39:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:39:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:39:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:39:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:39:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:39:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:39:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:39:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:39:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:39:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:39:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:39:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:39:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:39:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:39:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:39:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:39:35,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:39:35,909 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:39:35,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:39:37,125 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-12 07:39:37,125 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:39:37,145 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:39:37,145 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:39:37,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:37 BoogieIcfgContainer [2024-11-12 07:39:37,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:39:37,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:39:37,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:39:37,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:39:37,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:39:34" (1/3) ... [2024-11-12 07:39:37,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfb7ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:37, skipping insertion in model container [2024-11-12 07:39:37,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:35" (2/3) ... [2024-11-12 07:39:37,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfb7ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:37, skipping insertion in model container [2024-11-12 07:39:37,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:37" (3/3) ... [2024-11-12 07:39:37,154 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-26.i [2024-11-12 07:39:37,169 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:39:37,170 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:39:37,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:39:37,229 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;@1236ce54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:39:37,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:39:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:37,240 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:37,240 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:37,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:37,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash -877936993, now seen corresponding path program 1 times [2024-11-12 07:39:37,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:37,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925831527] [2024-11-12 07:39:37,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:37,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:37,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:37,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:37,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:39:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:37,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:39:37,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-12 07:39:37,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:37,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:37,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925831527] [2024-11-12 07:39:37,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925831527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:37,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:37,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:39:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572523975] [2024-11-12 07:39:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:37,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:39:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:39:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:37,765 INFO L87 Difference]: Start difference. First operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:37,789 INFO L93 Difference]: Finished difference Result 179 states and 271 transitions. [2024-11-12 07:39:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:39:37,791 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-12 07:39:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:37,797 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:39:37,797 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 07:39:37,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:37,803 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:37,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 07:39:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 07:39:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-12 07:39:37,854 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2024-11-12 07:39:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:37,855 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-12 07:39:37,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-12 07:39:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:37,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:37,859 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:37,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 07:39:38,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:38,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1465375761, now seen corresponding path program 1 times [2024-11-12 07:39:38,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:38,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782387438] [2024-11-12 07:39:38,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:38,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:38,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:38,068 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:38,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:39:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:38,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:38,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-12 07:39:38,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:38,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782387438] [2024-11-12 07:39:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782387438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:38,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:38,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:39:38,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287160477] [2024-11-12 07:39:38,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:38,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:38,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:38,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:38,494 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:38,850 INFO L93 Difference]: Finished difference Result 177 states and 254 transitions. [2024-11-12 07:39:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-12 07:39:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:38,858 INFO L225 Difference]: With dead ends: 177 [2024-11-12 07:39:38,858 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 07:39:38,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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-11-12 07:39:38,860 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:38,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:39:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 07:39:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 07:39:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-12 07:39:38,871 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2024-11-12 07:39:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:38,873 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-12 07:39:38,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-12 07:39:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:38,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:38,877 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:38,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 07:39:39,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:39,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:39,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:39,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1388474963, now seen corresponding path program 1 times [2024-11-12 07:39:39,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:39,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493558501] [2024-11-12 07:39:39,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:39,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:39,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:39,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:39,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 07:39:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:39,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:39,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:39,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 07:39:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:39,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:39,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493558501] [2024-11-12 07:39:39,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493558501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:39,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:39,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877142813] [2024-11-12 07:39:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:39,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:39,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:39,627 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:39,920 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2024-11-12 07:39:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:39,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-12 07:39:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:39,923 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:39:39,923 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 07:39:39,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:39,925 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:39,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:39:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 07:39:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 07:39:39,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-12 07:39:39,934 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 89 [2024-11-12 07:39:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:39,935 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-12 07:39:39,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-12 07:39:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:39,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:39,939 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:39,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 07:39:40,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:40,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:40,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:40,140 INFO L85 PathProgramCache]: Analyzing trace with hash 570826513, now seen corresponding path program 1 times [2024-11-12 07:39:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:40,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635705315] [2024-11-12 07:39:40,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:40,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:40,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:40,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:39:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:40,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:39:40,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:40,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:40,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635705315] [2024-11-12 07:39:40,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635705315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:40,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:40,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:39:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318899626] [2024-11-12 07:39:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:40,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:39:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:39:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:39:40,534 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:40,598 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-11-12 07:39:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:39:40,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-12 07:39:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:40,604 INFO L225 Difference]: With dead ends: 184 [2024-11-12 07:39:40,604 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:39:40,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-11-12 07:39:40,606 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:40,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 471 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:39:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-12 07:39:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-12 07:39:40,627 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 89 [2024-11-12 07:39:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:40,628 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-12 07:39:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-12 07:39:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:40,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:40,630 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:40,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:40,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:40,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 572673555, now seen corresponding path program 1 times [2024-11-12 07:39:40,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:40,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666791432] [2024-11-12 07:39:40,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:40,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:40,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:40,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:39:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:41,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:39:41,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:41,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:39:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-12 07:39:41,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:41,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666791432] [2024-11-12 07:39:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666791432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:41,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:41,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:39:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807337639] [2024-11-12 07:39:41,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:41,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:41,284 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:42,039 INFO L93 Difference]: Finished difference Result 187 states and 261 transitions. [2024-11-12 07:39:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:39:42,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-12 07:39:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:42,042 INFO L225 Difference]: With dead ends: 187 [2024-11-12 07:39:42,042 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 07:39:42,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:39:42,043 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 112 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:42,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 379 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:39:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 07:39:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-12 07:39:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-11-12 07:39:42,051 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 89 [2024-11-12 07:39:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:42,051 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-11-12 07:39:42,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-12 07:39:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 07:39:42,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:42,053 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:42,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:42,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:42,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 107335243, now seen corresponding path program 1 times [2024-11-12 07:39:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756992242] [2024-11-12 07:39:42,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:42,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:42,259 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:42,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:39:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:42,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:39:42,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:42,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2024-11-12 07:39:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:39:42,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:43,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-12 07:39:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:39:43,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:43,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756992242] [2024-11-12 07:39:43,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756992242] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:39:43,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:39:43,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-12 07:39:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680479265] [2024-11-12 07:39:43,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:39:43,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:39:43,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:43,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:39:43,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:39:43,025 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:39:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:44,356 INFO L93 Difference]: Finished difference Result 196 states and 270 transitions. [2024-11-12 07:39:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:39:44,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 91 [2024-11-12 07:39:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:44,361 INFO L225 Difference]: With dead ends: 196 [2024-11-12 07:39:44,361 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 07:39:44,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:39:44,363 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 126 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:44,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 449 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 07:39:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 07:39:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-12 07:39:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2024-11-12 07:39:44,374 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 91 [2024-11-12 07:39:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:44,374 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2024-11-12 07:39:44,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:39:44,374 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2024-11-12 07:39:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 07:39:44,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:44,376 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:44,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 07:39:44,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:44,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:44,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:44,577 INFO L85 PathProgramCache]: Analyzing trace with hash -779887603, now seen corresponding path program 1 times [2024-11-12 07:39:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:44,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857812094] [2024-11-12 07:39:44,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:44,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:44,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:44,581 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:44,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 07:39:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:44,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:44,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:44,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-12 07:39:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:44,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:44,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857812094] [2024-11-12 07:39:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857812094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:44,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639027356] [2024-11-12 07:39:44,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:44,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:44,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:44,929 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:45,142 INFO L93 Difference]: Finished difference Result 181 states and 249 transitions. [2024-11-12 07:39:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-12 07:39:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:45,144 INFO L225 Difference]: With dead ends: 181 [2024-11-12 07:39:45,144 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 07:39:45,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:45,146 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:45,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:39:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 07:39:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 07:39:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2024-11-12 07:39:45,153 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 91 [2024-11-12 07:39:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:45,153 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2024-11-12 07:39:45,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2024-11-12 07:39:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:39:45,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:45,155 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:45,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 07:39:45,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:45,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1993214942, now seen corresponding path program 1 times [2024-11-12 07:39:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287951590] [2024-11-12 07:39:45,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:45,359 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:45,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:39:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:45,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:45,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:45,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 07:39:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:45,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:45,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:45,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287951590] [2024-11-12 07:39:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287951590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:45,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:45,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:45,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814499506] [2024-11-12 07:39:45,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:45,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:45,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:45,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:45,697 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:45,924 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2024-11-12 07:39:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:45,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-12 07:39:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:45,926 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:39:45,926 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 07:39:45,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:45,928 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:45,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:39:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 07:39:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 07:39:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-12 07:39:45,934 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 96 [2024-11-12 07:39:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:45,935 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-12 07:39:45,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-12 07:39:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:39:45,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:45,939 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:45,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:46,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:46,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:46,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2133763552, now seen corresponding path program 1 times [2024-11-12 07:39:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:46,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040104814] [2024-11-12 07:39:46,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:46,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:46,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:46,143 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:46,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 07:39:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:46,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:46,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:46,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 07:39:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:46,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:46,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:46,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040104814] [2024-11-12 07:39:46,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040104814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:46,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:46,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106486373] [2024-11-12 07:39:46,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:46,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:46,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:46,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:46,554 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:46,873 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2024-11-12 07:39:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:46,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-12 07:39:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:46,875 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:39:46,875 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 07:39:46,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:46,876 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:46,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:39:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 07:39:46,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 07:39:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2024-11-12 07:39:46,882 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 96 [2024-11-12 07:39:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:46,882 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2024-11-12 07:39:46,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2024-11-12 07:39:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:39:46,883 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:46,884 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:46,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 07:39:47,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:47,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:47,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash 328325218, now seen corresponding path program 1 times [2024-11-12 07:39:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614927139] [2024-11-12 07:39:47,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:47,089 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:47,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 07:39:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:47,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:47,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:47,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 07:39:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:47,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:47,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:47,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614927139] [2024-11-12 07:39:47,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614927139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:47,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:47,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251667726] [2024-11-12 07:39:47,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:47,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:47,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:47,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:47,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:47,459 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:47,684 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2024-11-12 07:39:47,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:47,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-12 07:39:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:47,686 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:39:47,686 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 07:39:47,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:47,688 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:47,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:39:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 07:39:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 07:39:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2024-11-12 07:39:47,694 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 96 [2024-11-12 07:39:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:47,695 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2024-11-12 07:39:47,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2024-11-12 07:39:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:39:47,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:47,696 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:47,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 07:39:47,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:47,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:47,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 751027044, now seen corresponding path program 1 times [2024-11-12 07:39:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:47,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087291456] [2024-11-12 07:39:47,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:47,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:47,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:47,899 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:47,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 07:39:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:48,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:48,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:48,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-12 07:39:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:48,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:48,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:48,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087291456] [2024-11-12 07:39:48,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087291456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:48,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:48,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251184240] [2024-11-12 07:39:48,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:48,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:48,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:48,280 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:48,299 INFO L93 Difference]: Finished difference Result 177 states and 236 transitions. [2024-11-12 07:39:48,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:48,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-12 07:39:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:48,301 INFO L225 Difference]: With dead ends: 177 [2024-11-12 07:39:48,301 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 07:39:48,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:48,302 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:48,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 07:39:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 07:39:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 78 states have internal predecessors, (99), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 117 transitions. [2024-11-12 07:39:48,308 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 117 transitions. Word has length 96 [2024-11-12 07:39:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:48,309 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 117 transitions. [2024-11-12 07:39:48,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2024-11-12 07:39:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 07:39:48,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:48,315 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:48,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 07:39:48,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:48,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash -79956123, now seen corresponding path program 1 times [2024-11-12 07:39:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322395077] [2024-11-12 07:39:48,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:48,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:48,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:48,520 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:48,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 07:39:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:48,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:48,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:48,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 07:39:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:48,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:48,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322395077] [2024-11-12 07:39:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322395077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:48,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:48,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:48,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60342941] [2024-11-12 07:39:48,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:48,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:48,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:48,934 INFO L87 Difference]: Start difference. First operand 89 states and 117 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:48,958 INFO L93 Difference]: Finished difference Result 175 states and 231 transitions. [2024-11-12 07:39:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-12 07:39:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:48,959 INFO L225 Difference]: With dead ends: 175 [2024-11-12 07:39:48,959 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 07:39:48,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:48,960 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:48,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:48,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 07:39:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 07:39:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2024-11-12 07:39:48,964 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 101 [2024-11-12 07:39:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:48,964 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2024-11-12 07:39:48,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2024-11-12 07:39:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 07:39:48,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:48,967 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:48,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 07:39:49,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:49,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:49,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1768899865, now seen corresponding path program 1 times [2024-11-12 07:39:49,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:49,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134690839] [2024-11-12 07:39:49,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:49,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:49,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:49,170 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:49,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 07:39:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:49,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:49,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:49,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 07:39:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:49,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:49,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134690839] [2024-11-12 07:39:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134690839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:49,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492209206] [2024-11-12 07:39:49,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:49,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:49,564 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:49,584 INFO L93 Difference]: Finished difference Result 175 states and 229 transitions. [2024-11-12 07:39:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:49,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-12 07:39:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:49,585 INFO L225 Difference]: With dead ends: 175 [2024-11-12 07:39:49,585 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 07:39:49,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:49,586 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:49,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 07:39:49,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 07:39:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2024-11-12 07:39:49,591 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 101 [2024-11-12 07:39:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:49,591 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2024-11-12 07:39:49,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2024-11-12 07:39:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 07:39:49,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:49,593 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:49,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:49,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:49,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:49,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:49,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1246203753, now seen corresponding path program 1 times [2024-11-12 07:39:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:49,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549946352] [2024-11-12 07:39:49,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:49,796 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:49,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process