./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-16.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 d6d1133c9c30821e735c948d3959f88a96057a51cd0531437d4f6aabe9fe7ffd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:59:39,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:59:39,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:59:39,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:59:39,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:59:39,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:59:39,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:59:39,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:59:39,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:59:39,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:59:39,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:59:39,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:59:39,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:59:39,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:59:39,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:59:39,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:59:39,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:59:39,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:59:39,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:59:39,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:59:39,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:59:39,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:59:39,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:59:39,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:59:39,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:59:39,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:59:39,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:59:39,321 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:59:39,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:59:39,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:59:39,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:59:39,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:59:39,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:59:39,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:59:39,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:59:39,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:59:39,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:59:39,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:59:39,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:59:39,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:59:39,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:59:39,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:59:39,326 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 -> d6d1133c9c30821e735c948d3959f88a96057a51cd0531437d4f6aabe9fe7ffd [2024-11-09 01:59:39,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:59:39,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:59:39,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:59:39,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:59:39,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:59:39,633 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-16.i [2024-11-09 01:59:41,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:59:41,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:59:41,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-16.i [2024-11-09 01:59:41,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27c7e541/45f02bee03254bc9b636b36c6a42cd71/FLAG9ea84bfdc [2024-11-09 01:59:41,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27c7e541/45f02bee03254bc9b636b36c6a42cd71 [2024-11-09 01:59:41,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:59:41,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:59:41,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:59:41,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:59:41,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:59:41,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27576da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41, skipping insertion in model container [2024-11-09 01:59:41,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:59:41,455 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-16.i[916,929] [2024-11-09 01:59:41,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:59:41,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:59:41,529 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-16.i[916,929] [2024-11-09 01:59:41,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:59:41,606 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:59:41,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41 WrapperNode [2024-11-09 01:59:41,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:59:41,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:59:41,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:59:41,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:59:41,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,663 INFO L138 Inliner]: procedures = 30, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-11-09 01:59:41,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:59:41,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:59:41,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:59:41,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:59:41,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,687 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 01:59:41,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:59:41,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:59:41,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:59:41,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:59:41,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (1/1) ... [2024-11-09 01:59:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:59:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:59:41,792 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-09 01:59:41,796 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-09 01:59:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:59:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 01:59:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 01:59:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 01:59:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:59:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 01:59:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:59:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:59:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:59:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:59:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:59:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:59:42,071 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:59:42,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:59:42,717 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-09 01:59:42,717 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:59:42,741 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:59:42,741 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:59:42,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:59:42 BoogieIcfgContainer [2024-11-09 01:59:42,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:59:42,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:59:42,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:59:42,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:59:42,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:59:41" (1/3) ... [2024-11-09 01:59:42,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e40d124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:59:42, skipping insertion in model container [2024-11-09 01:59:42,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:41" (2/3) ... [2024-11-09 01:59:42,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e40d124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:59:42, skipping insertion in model container [2024-11-09 01:59:42,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:59:42" (3/3) ... [2024-11-09 01:59:42,750 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-16.i [2024-11-09 01:59:42,766 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:59:42,767 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:59:42,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:59:42,839 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;@4d4281c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:59:42,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:59:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 87 states have internal predecessors, (120), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:59:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 01:59:42,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:59:42,863 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:59:42,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:59:42,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:59:42,871 INFO L85 PathProgramCache]: Analyzing trace with hash 73527009, now seen corresponding path program 1 times [2024-11-09 01:59:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:59:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071398677] [2024-11-09 01:59:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:59:42,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:59:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:59:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:59:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:59:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:59:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:59:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:59:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:59:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:59:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:59:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:59:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:59:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:59:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:59:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:59:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:59:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:59:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:59:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:59:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:59:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:59:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:59:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 01:59:43,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:59:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071398677] [2024-11-09 01:59:43,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071398677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:59:43,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:59:43,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:59:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411139534] [2024-11-09 01:59:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:59:43,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:59:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:59:43,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:59:43,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:59:43,512 INFO L87 Difference]: Start difference. First operand has 110 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 87 states have internal predecessors, (120), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:59:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:59:43,546 INFO L93 Difference]: Finished difference Result 213 states and 339 transitions. [2024-11-09 01:59:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:59:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2024-11-09 01:59:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:59:43,555 INFO L225 Difference]: With dead ends: 213 [2024-11-09 01:59:43,556 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:59:43,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-09 01:59:43,563 INFO L432 NwaCegarLoop]: 155 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, 155 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-09 01:59:43,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:59:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:59:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 01:59:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:59:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-09 01:59:43,605 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 157 [2024-11-09 01:59:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:59:43,605 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-09 01:59:43,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:59:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-09 01:59:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 01:59:43,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:59:43,614 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:59:43,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:59:43,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:59:43,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:59:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash -123367621, now seen corresponding path program 1 times [2024-11-09 01:59:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:59:43,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436926736] [2024-11-09 01:59:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:59:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:59:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:59:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279432286] [2024-11-09 01:59:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:59:43,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:59:43,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:59:43,944 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-09 01:59:43,945 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-09 01:59:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:59:45,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:59:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:59:45,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:59:45,959 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:59:45,961 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:59:45,990 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-09 01:59:46,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:59:46,170 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 01:59:46,243 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:59:46,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:59:46 BoogieIcfgContainer [2024-11-09 01:59:46,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:59:46,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:59:46,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:59:46,252 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:59:46,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:59:42" (3/4) ... [2024-11-09 01:59:46,255 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:59:46,257 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:59:46,258 INFO L158 Benchmark]: Toolchain (without parser) took 5044.08ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 70.6MB in the beginning and 148.5MB in the end (delta: -77.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:59:46,259 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:59:46,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.60ms. Allocated memory is still 146.8MB. Free memory was 70.4MB in the beginning and 110.8MB in the end (delta: -40.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-09 01:59:46,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.23ms. Allocated memory is still 146.8MB. Free memory was 110.8MB in the beginning and 106.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:59:46,262 INFO L158 Benchmark]: Boogie Preprocessor took 59.69ms. Allocated memory is still 146.8MB. Free memory was 106.7MB in the beginning and 103.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:59:46,263 INFO L158 Benchmark]: RCFGBuilder took 1017.16ms. Allocated memory is still 146.8MB. Free memory was 103.8MB in the beginning and 88.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:59:46,263 INFO L158 Benchmark]: TraceAbstraction took 3506.77ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 86.9MB in the beginning and 148.5MB in the end (delta: -61.6MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2024-11-09 01:59:46,263 INFO L158 Benchmark]: Witness Printer took 5.48ms. Allocated memory is still 195.0MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:59:46,265 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.60ms. Allocated memory is still 146.8MB. Free memory was 70.4MB in the beginning and 110.8MB in the end (delta: -40.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.23ms. Allocated memory is still 146.8MB. Free memory was 110.8MB in the beginning and 106.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.69ms. Allocated memory is still 146.8MB. Free memory was 106.7MB in the beginning and 103.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.16ms. Allocated memory is still 146.8MB. Free memory was 103.8MB in the beginning and 88.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3506.77ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 86.9MB in the beginning and 148.5MB in the end (delta: -61.6MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 5.48ms. Allocated memory is still 195.0MB. Free memory is still 148.5MB. 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 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1, 4, 256, 0, 1, 1000000.8, 3.8, 25, 2.75, 0, 32, 2, 2, -32 }; [L55] signed char last_1_WrapperStruct00_var_1_9 = 25; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_9=25] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] EXPR WrapperStruct00.var_1_9 [L119] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L89] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_3 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_3 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L94] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L96] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L101] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L103] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L105] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L108] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L111] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L130] RET updateVariables() [L131] CALL step() [L59] EXPR WrapperStruct00.var_1_3 [L59] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L59] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L59] EXPR WrapperStruct00.var_1_3 [L59] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L59] COND FALSE !((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) [L62] EXPR WrapperStruct00.var_1_8 [L62] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_8 [L63] EXPR WrapperStruct00.var_1_11 [L63] signed char stepLocal_2 = WrapperStruct00.var_1_11; [L64] EXPR WrapperStruct00.var_1_10 [L64] unsigned char stepLocal_1 = 99999.375 <= WrapperStruct00.var_1_10; [L65] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25, stepLocal_1=0, stepLocal_2=3] [L65] COND FALSE !(WrapperStruct00.var_1_13 <= stepLocal_2) [L70] WrapperStruct00.var_1_15 = -25 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25, stepLocal_1=0] [L72] EXPR WrapperStruct00.var_1_6 [L72] unsigned char stepLocal_0 = WrapperStruct00.var_1_6; [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25, stepLocal_0=1, stepLocal_1=0] [L73] COND FALSE !(WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR ((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR (((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8)) [L122] EXPR WrapperStruct00.var_1_7 [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR (((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR ((((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8))) && ((WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_1 || WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_9 == ((signed char) ((((((WrapperStruct00.var_1_11) > (5)) ? (WrapperStruct00.var_1_11) : (5))) + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_14))) : ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_11)) : (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_12)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122] EXPR (((((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8))) && ((WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_1 || WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_9 == ((signed char) ((((((WrapperStruct00.var_1_11) > (5)) ? (WrapperStruct00.var_1_11) : (5))) + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_14))) : ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_11)) : (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_12)))) : 1)) && ((WrapperStruct00.var_1_13 <= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_7) && (99999.375 <= WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((signed short int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_15 == ((signed short int) -25))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L122-L123] return (((((last_1_WrapperStruct00_var_1_9 % ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) <= -1000000) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))) : 1) && (WrapperStruct00.var_1_7 == ((float) WrapperStruct00.var_1_8))) && ((WrapperStruct00.var_1_8 < (WrapperStruct00.var_1_7 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_1 || WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_9 == ((signed char) ((((((WrapperStruct00.var_1_11) > (5)) ? (WrapperStruct00.var_1_11) : (5))) + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_14))) : ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_11)) : (WrapperStruct00.var_1_9 == ((signed char) WrapperStruct00.var_1_12)))) : 1)) && ((WrapperStruct00.var_1_13 <= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_7) && (99999.375 <= WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((signed short int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_15 == ((signed short int) -25))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 2, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 155 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 840/840 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-09 01:59:46,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-16.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 d6d1133c9c30821e735c948d3959f88a96057a51cd0531437d4f6aabe9fe7ffd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:59:48,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:59:48,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:59:48,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:59:48,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:59:48,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:59:48,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:59:48,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:59:48,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:59:48,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:59:48,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:59:48,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:59:48,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:59:48,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:59:48,681 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:59:48,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:59:48,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:59:48,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:59:48,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:59:48,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:59:48,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:59:48,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:59:48,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:59:48,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:59:48,690 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:59:48,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:59:48,691 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:59:48,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:59:48,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:59:48,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:59:48,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:59:48,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:59:48,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:59:48,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:59:48,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:59:48,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:59:48,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:59:48,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:59:48,701 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:59:48,701 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:59:48,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:59:48,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:59:48,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:59:48,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:59:48,703 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 -> d6d1133c9c30821e735c948d3959f88a96057a51cd0531437d4f6aabe9fe7ffd [2024-11-09 01:59:49,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:59:49,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:59:49,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:59:49,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:59:49,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:59:49,064 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-16.i [2024-11-09 01:59:50,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:59:50,846 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:59:50,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-16.i [2024-11-09 01:59:50,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643253a82/45d2394fed044269904e127fb9534399/FLAG742f8fbb1 [2024-11-09 01:59:50,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643253a82/45d2394fed044269904e127fb9534399 [2024-11-09 01:59:50,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:59:50,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:59:50,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:59:50,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:59:50,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:59:50,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:59:50" (1/1) ... [2024-11-09 01:59:50,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@902064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:50, skipping insertion in model container [2024-11-09 01:59:50,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:59:50" (1/1) ... [2024-11-09 01:59:50,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:59:51,126 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-16.i[916,929] [2024-11-09 01:59:51,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:59:51,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:59:51,219 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-16.i[916,929] [2024-11-09 01:59:51,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:59:51,322 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:59:51,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51 WrapperNode [2024-11-09 01:59:51,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:59:51,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:59:51,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:59:51,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:59:51,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,403 INFO L138 Inliner]: procedures = 34, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-09 01:59:51,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:59:51,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:59:51,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:59:51,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:59:51,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,458 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-09 01:59:51,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:59:51,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:59:51,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:59:51,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:59:51,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (1/1) ... [2024-11-09 01:59:51,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:59:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:59:51,558 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-09 01:59:51,560 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-09 01:59:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:59:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:59:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:59:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:59:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:59:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:59:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:59:51,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:59:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 01:59:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 01:59:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:59:51,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:59:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:59:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:59:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:59:51,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:59:51,780 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:59:51,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:59:54,633 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-11-09 01:59:54,633 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:59:54,648 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:59:54,650 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:59:54,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:59:54 BoogieIcfgContainer [2024-11-09 01:59:54,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:59:54,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:59:54,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:59:54,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:59:54,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:59:50" (1/3) ... [2024-11-09 01:59:54,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dabd477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:59:54, skipping insertion in model container [2024-11-09 01:59:54,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:59:51" (2/3) ... [2024-11-09 01:59:54,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dabd477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:59:54, skipping insertion in model container [2024-11-09 01:59:54,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:59:54" (3/3) ... [2024-11-09 01:59:54,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-16.i [2024-11-09 01:59:54,675 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:59:54,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:59:54,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:59:54,744 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;@d335f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:59:54,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:59:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 87 states have internal predecessors, (120), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:59:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 01:59:54,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:59:54,769 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:59:54,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:59:54,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:59:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2073695678, now seen corresponding path program 1 times [2024-11-09 01:59:54,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:59:54,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727115072] [2024-11-09 01:59:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:59:54,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-09 01:59:54,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:59:54,799 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-09 01:59:54,811 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-09 01:59:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:55,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:59:55,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:59:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-09 01:59:55,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:59:55,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:59:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727115072] [2024-11-09 01:59:55,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727115072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:59:55,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:59:55,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:59:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867221920] [2024-11-09 01:59:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:59:55,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:59:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:59:55,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:59:55,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:59:55,441 INFO L87 Difference]: Start difference. First operand has 110 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 87 states have internal predecessors, (120), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:59:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:59:55,481 INFO L93 Difference]: Finished difference Result 209 states and 333 transitions. [2024-11-09 01:59:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:59:55,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2024-11-09 01:59:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:59:55,494 INFO L225 Difference]: With dead ends: 209 [2024-11-09 01:59:55,494 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 01:59:55,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-09 01:59:55,513 INFO L432 NwaCegarLoop]: 147 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, 147 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-09 01:59:55,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:59:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 01:59:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 01:59:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:59:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2024-11-09 01:59:55,557 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 157 [2024-11-09 01:59:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:59:55,558 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2024-11-09 01:59:55,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:59:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2024-11-09 01:59:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 01:59:55,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:59:55,562 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:59:55,576 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-09 01:59:55,763 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-09 01:59:55,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:59:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:59:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1876801048, now seen corresponding path program 1 times [2024-11-09 01:59:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:59:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360954340] [2024-11-09 01:59:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:59:55,766 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-09 01:59:55,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:59:55,769 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-09 01:59:55,770 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-09 01:59:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:56,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:59:56,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:59:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-09 01:59:56,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:59:56,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:59:56,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360954340] [2024-11-09 01:59:56,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360954340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:59:56,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:59:56,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:59:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891577838] [2024-11-09 01:59:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:59:56,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:59:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:59:56,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:59:56,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:59:56,350 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:59:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:59:56,448 INFO L93 Difference]: Finished difference Result 203 states and 294 transitions. [2024-11-09 01:59:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:59:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2024-11-09 01:59:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:59:56,451 INFO L225 Difference]: With dead ends: 203 [2024-11-09 01:59:56,451 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 01:59:56,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 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-09 01:59:56,455 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:59:56,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:59:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 01:59:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 01:59:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:59:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2024-11-09 01:59:56,480 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 157 [2024-11-09 01:59:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:59:56,482 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2024-11-09 01:59:56,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 01:59:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2024-11-09 01:59:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 01:59:56,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:59:56,488 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:59:56,505 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-09 01:59:56,688 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-09 01:59:56,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:59:56,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:59:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1905301338, now seen corresponding path program 1 times [2024-11-09 01:59:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:59:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390123321] [2024-11-09 01:59:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:59:56,691 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-09 01:59:56,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:59:56,694 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-09 01:59:56,696 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-09 01:59:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:59:57,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 01:59:57,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:59:57,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:59:57,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:59:57,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:59:57,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:59:58,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:59:58,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:59:58,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:59:58,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:59:58,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 01:59:58,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-09 01:59:58,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:59:58,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 44 [2024-11-09 01:59:58,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:59:58,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 54 [2024-11-09 01:59:59,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:59:59,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 30 [2024-11-09 01:59:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-09 01:59:59,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:59:59,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:59:59,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390123321] [2024-11-09 01:59:59,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390123321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:59:59,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:59:59,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:59:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679592205] [2024-11-09 01:59:59,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:59:59,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:59:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:59:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:59:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:59:59,307 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:00:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:04,843 INFO L93 Difference]: Finished difference Result 283 states and 407 transitions. [2024-11-09 02:00:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:00:04,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2024-11-09 02:00:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:04,846 INFO L225 Difference]: With dead ends: 283 [2024-11-09 02:00:04,846 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 02:00:04,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:00:04,848 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 328 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:04,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 321 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 02:00:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 02:00:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 116. [2024-11-09 02:00:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 02:00:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-09 02:00:04,866 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 157 [2024-11-09 02:00:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:04,867 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-09 02:00:04,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:00:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-09 02:00:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 02:00:04,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:04,870 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:00:04,891 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-09 02:00:05,071 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-09 02:00:05,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:05,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2131500520, now seen corresponding path program 1 times [2024-11-09 02:00:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:00:05,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195667957] [2024-11-09 02:00:05,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:05,073 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-09 02:00:05,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:00:05,077 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-09 02:00:05,080 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-09 02:00:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:05,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 02:00:05,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:00:06,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 02:00:06,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 02:00:06,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 02:00:06,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 02:00:07,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 02:00:07,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-11-09 02:00:07,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:07,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 80 [2024-11-09 02:00:07,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:07,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 81 [2024-11-09 02:00:08,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:08,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 85 [2024-11-09 02:00:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 72 proven. 440 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-09 02:00:08,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:00:08,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:00:08,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195667957] [2024-11-09 02:00:08,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195667957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:00:08,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [849991651] [2024-11-09 02:00:08,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:08,580 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:00:08,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:00:08,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:00:08,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 02:00:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:10,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 02:00:10,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:00:11,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:00:12,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 02:00:13,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:13,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 63 [2024-11-09 02:00:14,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:14,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 71 [2024-11-09 02:00:14,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:14,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 74 [2024-11-09 02:00:15,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:15,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 74 [2024-11-09 02:00:16,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:16,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 101 [2024-11-09 02:00:16,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:16,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 104 [2024-11-09 02:00:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:00:18,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:00:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [849991651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:18,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:00:18,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 24 [2024-11-09 02:00:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491421855] [2024-11-09 02:00:18,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:18,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:00:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:00:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:00:18,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2024-11-09 02:00:18,267 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 02:00:23,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:00:28,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:00:37,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:00:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:44,083 INFO L93 Difference]: Finished difference Result 513 states and 735 transitions. [2024-11-09 02:00:44,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 02:00:44,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 157 [2024-11-09 02:00:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:44,087 INFO L225 Difference]: With dead ends: 513 [2024-11-09 02:00:44,088 INFO L226 Difference]: Without dead ends: 400 [2024-11-09 02:00:44,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2024-11-09 02:00:44,090 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 449 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:44,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 757 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1731 Invalid, 1 Unknown, 0 Unchecked, 25.5s Time] [2024-11-09 02:00:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-09 02:00:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 329. [2024-11-09 02:00:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 261 states have (on average 1.3371647509578544) internal successors, (349), 263 states have internal predecessors, (349), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 02:00:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 473 transitions. [2024-11-09 02:00:44,159 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 473 transitions. Word has length 157 [2024-11-09 02:00:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:44,160 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 473 transitions. [2024-11-09 02:00:44,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-09 02:00:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 473 transitions. [2024-11-09 02:00:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 02:00:44,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:44,164 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:00:44,186 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 (5)] Ended with exit code 0 [2024-11-09 02:00:44,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-09 02:00:44,564 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 02:00:44,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:44,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -806644326, now seen corresponding path program 1 times [2024-11-09 02:00:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:00:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049873280] [2024-11-09 02:00:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:44,566 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-09 02:00:44,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:00:44,570 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-09 02:00:44,571 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-09 02:00:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:00:44,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:00:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-09 02:00:44,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:00:44,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:00:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049873280] [2024-11-09 02:00:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049873280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:44,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:44,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:00:44,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308558809] [2024-11-09 02:00:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:45,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:00:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:00:45,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:00:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:00:45,002 INFO L87 Difference]: Start difference. First operand 329 states and 473 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:00:45,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:45,097 INFO L93 Difference]: Finished difference Result 657 states and 946 transitions. [2024-11-09 02:00:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:00:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2024-11-09 02:00:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:45,103 INFO L225 Difference]: With dead ends: 657 [2024-11-09 02:00:45,103 INFO L226 Difference]: Without dead ends: 331 [2024-11-09 02:00:45,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 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-09 02:00:45,105 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:45,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:00:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-09 02:00:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-11-09 02:00:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 265 states have internal predecessors, (350), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 02:00:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 474 transitions. [2024-11-09 02:00:45,154 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 474 transitions. Word has length 157 [2024-11-09 02:00:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:45,155 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 474 transitions. [2024-11-09 02:00:45,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 02:00:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 474 transitions. [2024-11-09 02:00:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:00:45,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:45,157 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:00:45,178 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-09 02:00:45,361 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-09 02:00:45,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1251847999, now seen corresponding path program 1 times [2024-11-09 02:00:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:00:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215821496] [2024-11-09 02:00:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:45,363 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-09 02:00:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:00:45,365 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-09 02:00:45,365 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-09 02:00:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:46,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 02:00:46,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:00:46,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 02:00:46,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 02:00:46,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 02:00:47,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-11-09 02:00:47,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:47,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-11-09 02:00:47,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:47,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 65 [2024-11-09 02:00:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-09 02:00:47,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:00:47,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:00:47,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215821496] [2024-11-09 02:00:47,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215821496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:47,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:47,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:00:47,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513589211] [2024-11-09 02:00:47,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:47,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:00:47,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:00:47,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:00:47,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:00:47,867 INFO L87 Difference]: Start difference. First operand 331 states and 474 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-09 02:00:56,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:00:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:59,880 INFO L93 Difference]: Finished difference Result 805 states and 1151 transitions. [2024-11-09 02:00:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:00:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 158 [2024-11-09 02:00:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:59,885 INFO L225 Difference]: With dead ends: 805 [2024-11-09 02:00:59,886 INFO L226 Difference]: Without dead ends: 477 [2024-11-09 02:00:59,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:00:59,888 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 346 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:59,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 433 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2024-11-09 02:00:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-09 02:00:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 449. [2024-11-09 02:00:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 355 states have (on average 1.315492957746479) internal successors, (467), 359 states have internal predecessors, (467), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 02:00:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 635 transitions. [2024-11-09 02:00:59,949 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 635 transitions. Word has length 158 [2024-11-09 02:00:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:59,950 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 635 transitions. [2024-11-09 02:00:59,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-09 02:00:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 635 transitions. [2024-11-09 02:00:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:00:59,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:59,952 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:00:59,972 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-09 02:01:00,153 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-09 02:01:00,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:00,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:00,154 INFO L85 PathProgramCache]: Analyzing trace with hash 230779645, now seen corresponding path program 1 times [2024-11-09 02:01:00,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258815362] [2024-11-09 02:01:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:00,154 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-09 02:01:00,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:00,155 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-09 02:01:00,156 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-09 02:01:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:00,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 02:01:00,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:01,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 02:01:01,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 02:01:01,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-11-09 02:01:01,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:01,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-11-09 02:01:02,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:02,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-11-09 02:01:02,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:02,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-11-09 02:01:02,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:02,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2024-11-09 02:01:03,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:03,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 85 [2024-11-09 02:01:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 144 proven. 440 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 02:01:03,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:01:03,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:03,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258815362] [2024-11-09 02:01:03,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258815362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:01:03,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [510000695] [2024-11-09 02:01:03,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:01:03,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:01:03,660 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:01:03,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-09 02:01:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:05,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 02:01:05,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:06,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:01:07,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-09 02:01:08,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:08,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 63